Routing Using Potentials: A Dynamic Traffic-Aware Routing Algorithm

Computer Communication Review

Volumn 33, Issue 4, 2003, Pages 37-48

  Basu, Anindya ^a   Lin, Alvin ^b   Ramanathan, Sharad ^a  

^a LUCENT TECHNOLOGIES   (United States)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Congestion; Potential; Routing; Steepest Gradient; Traffic Aware

Indexed keywords

POTENTIAL; ROUTINGS; STEEPEST GRADIENT; TRAFFIC AWARE;

ALGORITHMS; BANDWIDTH; COMPUTATIONAL METHODS; COMPUTER SIMULATION; COSTS; NETWORK PROTOCOLS; OPTIMIZATION; PACKET NETWORKS; PROBLEM SOLVING; THEOREM PROVING;

INTERNET;

EID: 1242287733     PISSN: 01464833     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (30)

1. R. Ahuja, T. Magnanti, and J. Orlin. Network Flaws: Theory, Algorithms, and Applications. Prentice Hall, Englewood Cliffs, NJ, 1993.
2. 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.
3. E. J. Anderson, T. E. Anderson, S. D. Dribble, 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.
4. A. L. Barabási and R. Albert. Emergence of Scaling in Random Networks. Science, 286:509-512, 1999.
5. D. Bertsekas and R. Gallager. Second Derivative Algorithm for Minimum Delay Distributed Routing in Networks. IEEE Transactions on Communications, 32(8):911-919, 1984.
6. K. Binder and D. W. Heermann. Monte Carlo Simulation in Statistical Physics. Springer Verlag, Berlin, Germany, 4th edition, August 2002.
7. E. W. Dijkstra. A Note on Two Problems in Connexion with Graphs. Numerische Mathematik, 1:269-271, 1959.
8. 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.
9. 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.
10. 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.
11. 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.
12. 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.
13. S. Herzog. RSVP Extensions for Policy Control. RFC 2750, IETF, January 2000.
14. J. D. Jackson. Classical Electrodynamics. John Wiley & Sons, New York, NY, 3rd edition, August 1998.
15. 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.
16. H. Kobayashi and M. Gerla. Optimal Routing in Closed Queuing Networks. ACM Transactions on Computer Systems, 1(4):294-310, November 1983.
17. E. Kreyszig. Advanced Engineering Mathematics. John Wiley & Sons, New York, NY, 8th edition, December 1998.
18. 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.
19. J. Moy. OSPF Version 2. RFC 2328, IETF, April 1998.
20. The Network Simulator - ns-2. http://www.isi.edu/nsnam/ns/.
21. V. Paxson and S. Floyd. Wide Area Traffic: The Failure of Poisson Modeling. IEEE/ACM Transactions on Networking, 3(3):226-244, 1995.
22. 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.
23. R. L. Rardin. Optimizations in Operations Research. Prentice Hall, Upper Saddle River, NJ, 1998.
24. 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.
25. W. R. Stevens. TCP/IP Illustrated, volume 1. Addison-Wesley, Boston, MA, January 1994.
26. 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.
27. 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.
28. Z. Wang and J. Crowcroft. Shortest Path First with Emergency Exits. In Proceedings of SIGCOMM '90, pages 166-176, Philadelphia, PA, August 1990.
29. B. Waxman. Routing of Multipoint Connections. IEEE Journal on Selected Areas in Communications, 6(9): 1617-1622, December 1998.
30. P. H. Winston. Artificial Intelligence. Addison Wesley, Boston, MA, 3rd edition, January 1992.