Thesis Subjects on QoS Routing

1
Thesis Subjects on QoS Routing
2
QoS Routing basics

• Given a computer network
• Connection oriented
• Large number of nodes
• Large number of connections per port
• Geographically distant nodes
• Problem We need to set up connections with a
  given guaranteed QoS
• Bandwidth guarantee
• Delay Guarantee

3
QoS Routing basics(2)

• Connection oriented networks
• fixed-path connections
• set-up phase before data transfer phase
• A connection set-up request
• Source node, destination node
• Requested QoS
• End-to-end delay bound
• End-to-end bandwidth requirement

4
QoS Routing Algorithms Performance Analysis
5
QoS Routing Algorithms

• There are QoS Routing Algorithms in Literature
• Identify such algorithms
• What type of guarantees do they support
• What type of network are they designed for
• What is the network size
• What are the number of connections per port
• Implement and compare the performances
• Suggest improvements to the algorithms

6
Novelty

• The algorithms should be implemented such that
  they work as fast as possible on a given machine
• Speed measure number of connections set up/sec
• Data structure development
• Table management
• Search
• Sort
• Based on implementation results modification
  suggestions for those algorithms to improve the
  performances
• Implementation complexity
• Network Resource Utilization

7
Required Work for the student

• Literature survey
• Identify the QoS Algorithms to analyze
• For those algorithms clearly define parameters
  such as
• What type of QoS Guarantees
• What size of network
• Implement the algorithms
• Performance analysis via simulation
• Programming skills are required
• Write your own simulation code
• It might be required to use a known network
  simulator such as NS2

8
QoS Algorithm Development
9
Network state

• Each link and node has a state describing the
  available resources such as
• Available link bandwidth
• Available buffer size
• The state changes dynamically
• New connections are set-up
• Existing connections are terminated
• Problems
• How to maintain the state information at each
  node
• How to propagate the state information in the
  network

10
Network size

• Large number of nodes
• Large distances and propagation delays between
  nodes
• Large number of connections per port

11
Problems

• Utilize the network as much as possible
• Accept the connection if there are enough
  resources available in the network to accommodate
  the requested QoS level
• Do not disrupt the QoS guarantee of the
  connections already set up in the network
• Implementation complexity should be low
• Time complexity We need to set up a large number
  of connections/sec
• Space complexity Amount of information to be
  stored per connection in each node must be small
• Information complexity Amount of information to
  be communicated within the network for QoS
  routing should be small

12
Novelty

• A new QoS algorithm with better performance
  compared to the other algorithms in literature
  for a specific network

13
Required Work for the student

• Literature survey
• Define the problem precisely, clearly define
  parameters such as
• What type of QoS Guarantees
• What size of network
• Come up with an algorithm
• Show that it works
• Find the worst case and average performance via
  analysis and simulation
• Programming skills are required
• Write your own simulation code
• It might be required to use a known network
  simulator such as NS2