Loading...

Resource Allocation in Multi-hop Networks with Consideration of End to End Delay

Khamse Ashar, Jalal | 2012

719 Viewed
  1. Type of Document: M.Sc. Thesis
  2. Language: Farsi
  3. Document No: 43718 (05)
  4. University: Sharif University of Technology
  5. Department: Electrical Engineering
  6. Advisor(s): Golestani, Jamaledin; Modarres Hashemi, Mahmood
  7. Abstract:
  8. Cross layer resource allocation is necessary for efficient use of resource sina data communication network.In such a design, in addition tomaximizing the throughput of the network, Quality of Service constraints shouldbe considered for each session. End-to-end delayis one of the most important QoS parameters, which should be considered especially for multimedia applications.In this dissertation, we develop a jointly optimal service scheduling, routing & flow control algorithm for a wired multi-hop network which provides intended upper bounds on sessions' maximum delay. In order to incorporate worst-case delay constraint in cross layer formulation, we first attain an upper bound for the end to end delay of a traffic stream over multiple paths in a wired network.Although the analysis of the worst-case delay of a traffic stream over a single path has been extensively investigated in the literature, to the best of our knowledge no researches have been devoted to the general multiple path scenario. To develop worst-case delay analysis for the multiple path scenario, we address two challenging events: merging different sub-streams of a session and distributing a traffic stream among different paths (traffic partitioning). Offering proper algorithms for managing these challenges, we get an upper bound on sessions' worst-case delay. Next, we formulate flow control, routing and links' capacity assignment problem with the worst-case delay constraints in a convex optimization framework and solve it in a distributed manner. Although this formulation has been proposed under the deterministic model of traffic, it results structurally the same routing method as the Gallager's minimum delay routing algorithm.
  9. Keywords:
  10. Resources Allocation ; Service Quality Provisioning ; Routing Algorithm ; Convex Optimization ; Worst-Case Delay Analysis ; Cross Layer Approach ; Trafic Partitioning

 Digital Object List

 Bookmark

No TOC