On the computational complexity and effectiveness of "N-hub shortest-path routing"

Proceedings - IEEE INFOCOM

Volumn 1, Issue , 2004, Pages 694-704

  Cohen, Reuven ^a   Nakibli, Gabi ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; OPTIMIZATION; PACKET NETWORKS; PROBABILITY; PROBLEM SOLVING; ROUTERS; SET THEORY; TELECOMMUNICATION TRAFFIC;

CONGESTION CONTROL; N-HUB ROUTING; SHORTEST-PATH ROUTING; SOURCE DESTINATION;

INTERNET;

EID: 8344238206     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (29)

1. Z. Wang and J. Crowcroft, "Shortest path first with emergency exits," in Proceedings of the ACM SIGCOMM, September 1990, pp. 166-176.
2. P. D. J. Chen and D. Subramanian, "An efficient multipath forwarding method," in Proceedings of the IEEE INFOCOM, San Francisco, March 1998, pp. 1418-1425.
3. S. V. J.J. Garcia-Luna-Aceves and W. Zaumen, "A practical approach to minimizing delays in internet routing protocols," in Proceedings of the IEEE ICC, Vancouver, June 1999.
4. S. Vutukury and J. Garcia-Luna-Aceves, "A simple approximation to minimum delay routing," in Proceedings of the ACM SIGCOMM, 1999.
5. P. Francis and R. Gondivan, "Flexible routing and addressing for a next generation IP," in Proceedings of the ACM SIGCOMM, September 1994, pp. 116-125.
6. N. C. I. Castineyra and M. Steenstrup, "The nimrod routing architecture," RFC 1992, August 1996.
7. S. Z. S. S. I. Stoica, D. Adkins and S. Surana, "Internet indirection infrastructure," in Proceedings of ACM SIGCOMM 2002, August 2002.
8. M. F. K. David G. Andersen, Hari Balakrishnan and R. Morris, "Resilient overlay networks," http://nms.lcs.mit.edu/papers/ ronsosp2001.html, 2001.
9. J. Postel, "Internet protocol," IETF RFC 791, September 1981.
10. S. M. Bellovin, "Security problems in the TCP/IP protocol suite," Computer Communications Review, vol. 9, no. 2, pp. 32-48, April 1989.
11. R. Govindan and H. Tangmunarunkit, "Heuristics for internet map discovery," in Proceedings of the IEEE INFOCOM, Tel Aviv, March 2000, pp. 1371-1380.
12. S. Deering and R. Hinden, "Internet protocol, version 6 (IPv6) specification," IETF RFC 2460, December 1998.
13. C. Perkins, "IP encapsulation within IP," IETF RFC 2003, October 1996.
14. E. Rosen, "Multiprotocol label switching architecture (MPLS)," RFC 3031, January 2001.
15. B. Jamoussi, "Constraint-based LSP setup using LDP," RFC 3212, January 2002.
16. J. Moy, "OSPF version 2," IETF RFC 2328, April 1998.
17. S. B. et al. "An architecture for differentiated services," IETF RFC 2475, December 1998.
18. S. G. Kollopoulus and C. Stein, "Improved approximation algorithms for the unsplittable flow problems," in Proceedings of FOCS, 1997, pp. 426-435.
19. N. G. Y. Dinitz and M. Goemans, "On the single-source unsplittable flow problem," Combinatorica, vol. 19, pp. 17-41, 1999.
20. J. A. et al. "Online load balancing with applications to machine scheduling and virtual circuit routing," Journal of the ACM, vol. 44, no. 3, pp. 486-504, 1997.
21. J. T. Havill and W. Mao, "Greedy online algorithms for routing permanent virtual circuits," Networks, vol. 34, pp. 136-153, 1999.
22. W. Mao and R. Simha, "Routing and scheduling file transfers in packet-switched networks," Journal of Computing and Information, vol. 1, pp. 559-574, 1994.
23. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. San Francisco: W. H. Freeman and Co., 1979.
24. R. M. Karp, "Online algorithms versus offline algorithms: How much is it worth to know the future?" International Computer Science Institute, Technical Report TR-92-044, 1992.
25. E. W. Zegura, K. L. Calvert, and S. Bhattacharjee, "How to model an internetwork," in IEEE Infocom. vol. 2, San Francisco, CA: IEEE, March 1996, pp. 594-602.
26. I. M. A. Medina, A. Lakhina and J. Byers, "BRITE: An approach to universal topology generation," in Proceedings of MASCOTS, 2001.
27. "Lp_solve software," ftp.es.tue.nl/pub/lp_solve.
28. P. Raghavan and C. D. Thompson, "Randomized rounding: A technique for provably good algorithms and algorithmic proofs," Combinatorica, vol. 7, pp. 365-374, 1987.
29. W. Hoeffding, "Probability inequalities for sums of bounded random variables," American Statistics Association Journal, vol. 58, pp. 13-30, 1963.