Anindya Basu
ABSTRACT
We present a routing paradigm called PBR that utilizes steepest gradient search methods to route data packets. More specifically, the PBR paradigm assigns scalar potentials to network elements and forwards packets in the direction of maximum positive force. We show that the family of PBR schemes are loop free and that the standard shortest path routing algorithms are a special case of the PBR paradigm. We then show how to design a potential function that accounts for traffic conditions at a node. The resulting routing algorithm routes around congested areas while preserving the key desirable properties of IP routing mechanisms including hop-by-hop routing, local route computations and statistical multiplexing. Our simulations using the ns simulator indicate that the traffic aware routing algorithm shows significant improvements in end-to-end delay and jitter when compared to standard shortest path routing algorithms. The simulations also indicate that our algorithm does not incur too much control overheads and is fairly stable even when traffic conditions are dynamic.
- R. Ahuja, T. Magnanti, and J. Orlin. Network Flows: Theory, Algorithms, and Applications. Prentice Hall, Englewood Cliffs, NJ, 1993. Google Scholar
Digital Library
- D. Andersen, H. Balakrishnan, M. F. Kaashoek, and R. Morris. Resilient Overlay Networks. In Proceedings of the 18th ACM Symposium on Operating System Principles, pages 131--145, Chateau Lake Louise, Banff, Canada, October 2001. Google ScholarDigital Library
- E. J. Anderson, T. E. Anderson, S. D. Gribble, A. R. Karlin, and S. Savage. A Quantitative Evaluation of Traffic-Aware Routing Strategies. ACM SIGCOMM Computer Communication Review, 32(1):67--67, January 2002. Google ScholarDigital Library
- A. L. Barabási and R. Albert. Emergence of Scaling in Random Networks. Science, 286:509--512, 1999.Google Scholar
- D. Bertsekas and R. Gallager. Second Derivative Algorithm for Minimum Delay Distributed Routing in Networks. IEEE Transactions on Communications, 32(8):911--919, 1984.Google ScholarCross Ref
- K. Binder and D. W. Heermann. Monte Carlo Simulation in Statistical Physics. Springer Verlag, Berlin, Germany, 4th edition, August 2002.Google Scholar
- E. W. Dijkstra. A Note on Two Problems in Connexion with Graphs. Numerische Mathematik, 1:269--271, 1959.Google ScholarDigital Library
- B. Faverjon and P. Tournassoud. A Local Based Approach for Path Planning of Manipulators with a High Number of Degrees of Freedom. In Proceedings of IEEE International Conference on Robotics and Automation, pages 1152--1159, March 1987.Google Scholar
- L. K. Fleischer. Approximating Fractional Multicommodity Flow Independent of the Number of Commodities. In Proceedings of the 40th Annual Symposium on Foundations of Computer Science, pages 24--31, New York, NY, October 1999. Google ScholarDigital Library
- B. Fortz and M. Thorup. Internet Traffic Engineering by Optimizing OSPF Weights. In Proceedings of Infocom '00, pages 519--528, Tel Aviv, Israel, March 2000.Google ScholarCross Ref
- N. Garg and J. Konemann. Faster and Simpler Algorithms for Multicommodity Flow and Other Fractional Packing Problems. In Proceedings of the 39th Annual Symposium on Foundations of Computer Science, pages 300--309, Palo Alto, CA, November 1998. Google ScholarDigital Library
- V. Guruswami, S. Khanna, R. Rajaraman, F. B. Shepherd, and M. Yannakakis. Near-Optimal Hardness Results and Approximation Algorithms for Edge-Disjoint Paths and Related Problems. In Proceedings of the 31st ACM Symposium on Theory of Computing, pages 19--28, Atlanta, GA, May 1999. Google ScholarDigital Library
- S. Herzog. RSVP Extensions for Policy Control. RFC 2750, IETF, January 2000. Google ScholarDigital Library
- J. D. Jackson. Classical Electrodynamics. John Wiley & Sons, New York, NY, 3rd edition, August 1998.Google Scholar
- O. Khatib and J. F. Le Maitre. Dynamic Control of Manipulators Operating in A Complex Environment. In Proceedings of the 3rd CISM-IFToMM, Udine, Italy, 1978.Google Scholar
- H. Kobayashi and M. Gerla. Optimal Routing in Closed Queuing Networks. ACM Transactions on Computer Systems, 1(4):294--310, November 1983. Google ScholarDigital Library
- E. Kreyszig. Advanced Engineering Mathematics. John Wiley & Sons, New York, NY, 8th edition, December 1998. Google ScholarDigital Library
- A. Medina, A. Lakhina, I. Matta, and J. Byers. BRITE: An approach to Universal Topology Generation. In Proceedings of the International Workshop on Modeling, Analysis and Simulation of Computer and Telecommunications Systems, Cincinnati, OH, August 2001. Google ScholarDigital Library
- J. Moy. OSPF Version 2. RFC 2328, IETF, April 1998.Google Scholar
- The Network Simulator --- ns-2. http://www.isi.edu/nsnam/ns/.Google Scholar
- V. Paxson and S. Floyd. Wide Area Traffic: The Failure of Poisson Modeling. IEEE/ACM Transactions on Networking, 3(3):226--244, 1995. Google ScholarDigital Library
- W. H. Press, B. P. Flannery, S. A. Teukolsky, and W. T. Vetterling. Numerical Recipes in C. Cambridge University Press, Cambridge, UK, 2nd edition, January 1993.Google Scholar
- R. L. Rardin. Optimizations in Operations Research. Prentice Hall, Upper Saddle River, NJ, 1998.Google Scholar
- A. Shaikh, J. Rexford, and K. G. Shin. Load-Sensitive Routing of Long-Lived IP Flows. In Proceedings of SIGCOMM '99, pages 215--226, Boston, MA, August--September 1999. Google ScholarDigital Library
- W. R. Stevens. TCP/IP Illustrated, volume 1. Addison-Wesley, Boston, MA, January 1994. Google ScholarDigital Library
- L. Tassiulas and A. Ephremides. Stability Properties of Constrained Queueing Systems and Scheduling Policies for Maximum Throughput in Multihop Networks. IEEE Transactions on Automatic Control, 37(12):1936--1948, December 1992.Google ScholarCross Ref
- S. Vutukury and J. J. Garcia-Luna-Aceves. A Simple Approximation to Minimum Delay Routing. In Proceedings of SIGCOMM '99, pages 227--238, Boston, MA, August--September 1999. Google ScholarDigital Library
- Z. Wang and J. Crowcroft. Shortest Path First with Emergency Exits. In Proceedings of SIGCOMM '90, pages 166--176, Philadelphia, PA, August 1990. Google ScholarDigital Library
- B. Waxman. Routing of Multipoint Connections. IEEE Journal on Selected Areas in Communications, 6(9):1617--1622, December 1998. Google ScholarDigital Library
- P. H. Winston. Artificial Intelligence. Addison Wesley, Boston, MA, 3rd edition, January 1992. Google ScholarDigital Library
Index Terms
- Routing using potentials: a dynamic traffic-aware routing algorithm
Recommendations
Pathlet routing
SIGCOMM '09We present a new routing protocol, pathlet routing, in which networks advertise fragments of paths, called pathlets, that sources concatenate into end-to-end source routes. Intuitively, the pathlet is a highly flexible building block, capturing policy ...
On the implications of routing metric staleness in delay tolerant networks
Delay Tolerant Network (DTN) routing addresses challenges of providing end-to-end service where end-to-end data forwarding paths may not exist. The performance of current DTN routing protocols is often limited by routing metric ''staleness'', i.e., ...
Multipath routing algorithms for congestion minimization
NETWORKING'05: Proceedings of the 4th IFIP-TC6 international conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communication SystemsUnlike traditional routing schemes that route all traffic along a single path, multipath routing strategies split the traffic among several paths in order to ease congestion. It has been widely recognized that multipath routing can be fundamentally more ...
Comments