Backpressure-based Packet-by-Packet Adaptive Routing in Communication Networks

Details Backpressure-based Packet-by-Packet Adaptive Routing in Communication Networks Backpressure-based Packet-by-Packet Adaptive Routing in Communication Networks

2010-05-27

arxiv.org/abs/1005.4984v1

Computer Science

Networking and Internet Architecture

13 pages, 9 figures

Scientific paper

Backpressure-based adaptive routing algorithms where each packet is routed along a possibly different path have been extensively studied in the literature. However, such algorithms typically result in poor delay performance and involve high implementation complexity. In this paper, we develop a new adaptive routing algorithm built upon the widely-studied back-pressure algorithm. We decouple the routing and scheduling components of the algorithm by designing a probabilistic routing table which is used to route packets to per-destination queues. The scheduling decisions in the case of wireless networks are made using counters called shadow queues. The results are also extended to the case of networks which employ simple forms of network coding. In that case, our algorithm provides a low-complexity solution to optimally exploit the routing-coding tradeoff.

Affiliated with

Also associated with

No associations

Rating

Backpressure-based Packet-by-Packet Adaptive Routing in Communication Networks does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Backpressure-based Packet-by-Packet Adaptive Routing in Communication Networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Backpressure-based Packet-by-Packet Adaptive Routing in Communication Networks will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-191883