Can an overlay compensate for a careless underlay?

Proceedings - IEEE INFOCOM

Volumn , Issue , 2006, Pages

  Zhang, Honggang ^a   Kurose, Jim ^a   Towsley, Don ^a  

^a Biologically Inspired Neural and Dynamical Systems Laboratory   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

NATIVE NETWORK; OVERLAY PERFORMANCE;

GRAPH THEORY; OPTIMIZATION; ROUTING ALGORITHMS; TELECOMMUNICATION TRAFFIC;

COMPUTER NETWORKS;

EID: 37249069211     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFOCOM.2006.323     Document Type: Conference Paper

References (21)

1. Border Gateway Protocol 4 (BGP-4), http://www.ietf.org/internet-drafts/ draft-ietf-idr-bgp4-23.txt.
2. D. Andersen, H. Balakrishnan, M. F. Kaashoek, and R. Morris. Resilient overlay networks. In Proc. 18th ACM Symposium on Operating Systems Principles, Banff, Canada, October 2001.
3. D. Applegate and E. Cohen. Making intra-domain routing robust to changing and uncertain traffic demands: Understanding fundamental tradeoffs. In ACM SIGCOMM 2003, Karlsruhe, Germany.
4. B. Bollobas. Random Graphs. Academic Press, Orlando, Florida, 1985.
5. T. Bu and D. Towsley. On distinguishing between internet power law topology generators. In IEEE INFOCOM 2002.
6. B. Fortz and M. Thorup. Internet traffic engineering by optimizing OSPF weights. In IEEE INFOCOM 2000.
7. C. Gkantsidis, M. Mihail, and A. Saberi. Conductance and congestion in power law graphs. In ACM SIGMETRICS 2003.
8. D. W. Junghee Han and F. Jahanian. Topology aware overlay networks. In IEEE INFOCOM 2005.
9. L. Li, D. Alderson, W. Willinger, and J. Doyle. A first-principles approach to understanding the internet's router-level topology. In SIGCOMM 2004.
10. Z. Li and P. Mohapatra. The impact of topology on overlay routing service. In IEEE Infocom 2004.
11. Y. Liu, H. Zhang, D. Towsley, and W. Gong. On the interaction between overlay routing and underlay routing. In IEEE INFOCOM 2005.
12. A. Medina, N. Taft, K. Salamatian, S. Bhattacharyya, and C. Diot. Traffic matrix estimation: Existing techniques compared and new directions. In ACM SIGCOMM 2002.
13. A. Nakao, L. Peterson, and A. Bavier. A routing underlay for overlay networks. In ACM SIGCOMM 2003.
14. A. M. Odlyzko. Data networks are mostly empty and for good reason. In IT Professional 1 (no. 2), March/April 1999.
15. L. Qiu, Y. R. Yang, Y. Zhang, and S. Shenker. On selfish routing in internet-like environments. In ACM SIGCOMM 2003.
16. C. C. R. Keralapura, N. Taft and G. Iannaconne. Can isp's take the heat from overlay networks? In ACM HotNets Workshop 2004.
17. T. Roughgarden and E. Tardos. How bad is selfish routing? In IEEE Symposium on Foundations of Computer Science, pages 93-102, 2000.
18. A. Shiryaev. Probability. Springer-Verlag New York Inc., NY, 1995.
19. N. Spring, R. Mahajan, and D. Wetherall. Measuring isp topologies with rocketfuel. In ACM SIGCOMM 2002.
20. H. Tangmunarunkit, R. Govindan, S. Jamin, S. Shenker, and W. Willinger. Network topology generators: Degree-based vs structural. In ACM SIGCOMM 2002.
21. E. W. Zegura, K. L. Calvert, and S. Bhattacharjee. How to model an internetwork. In IEEE INFOCOM 2006.