A quantitative measure for telecommunications networks topology design

IEEE/ACM Transactions on Networking

Volumn 13, Issue 4, 2005, Pages 731-742

  Maxemchuk, Nicholas F ^a   Ouveysi, Iradj ^b   Zukerman, Moshe ^b  

^a Columbia University ^*  (United States)

^b UNIVERSITY OF MELBOURNE   (Australia)

Author keywords

Dense wavelength division multiplexing (DWDM); Linear programming; Network topology; Telecommunications

Indexed keywords

DENSE WAVELENGTH DIVISION MULTIPLEXING; INTERNET; LINEAR PROGRAMMING; NETWORK PROTOCOLS; TELECOMMUNICATION TRAFFIC;

NETWORK PERFORMANCE; TELECOMMUNICATION NETWORK DESIGN; TOPOLOGY LIFETIME;

TELECOMMUNICATION NETWORKS;

EID: 24644438133     PISSN: 10636692     EISSN: None     Source Type: Journal    
DOI: 10.1109/TNET.2005.852889     Document Type: Article

References (27)

1. S. Sen, R. Doverspike, and S. Cosares, "Network planning with random demand," Telecommun. Syst., vol. 3, pp. 11-30, 1994.
2. M. Pickavet and P. Demeester, "Multi-period planning of survivable WDM networks," Eur. Trans. Telecommun., Special Issue on WDM Networks, vol. 11, no. 1, pp. 7-16, Jan./Feb. 2000.
3. K. Sato, Advances in Transport Network Technologies. Norwood, MA: Artech House, 1996.
4. R. Ramaswami and K. Sivarajan, "Design of logical topologies for wavelength-routed optical networks," IEEE J. Sel. Areas Commun., vol. 14, no. 5, pp. 840-851, Jun. 1996.
5. B. Van Caenegem, W. Van Parys, F. De Turck, and P. Demeester, "Dimensioning of survivable WDM networks," IEEE J. Sel. Areas Commun., vol. 16, no. 7, pp. 1146-1157, Sep. 1998.
6. H. Harai et al., "Design of reconfigurable lightpaths in IP over WDM networks," IEICE Trans. Commun., vol. E82, no. 1, Jan. 1999.
7. S. Rajagopalan, M. Singh, and T. Morton, "Capacity expansion and replacement in growing markets with uncertain technological breakthroughs," Manag. Sci., vol. 44, no. 1, pp. 12-30, 1998.
8. M. Gryseels, L. Sorbello, and P. Demeester, "Planning in uncertain and dynamic environments," presented at the 9th Int. Telecommunications Network Planning Symp. (Networks 2000), Toronto, Canada, Sep. 2000.
9. N. F. Maxemchuk, I. Ouveysi, and M. Zukerman,"A quantitative measure for comparison between topologies of modern telecommunications networks," in Proc. IEEE GLOBECOM, vol. 1, San Francisco, CA, Dec. 2000, pp. 690-694.
10. M. J. Todd, "Polynomial expected behavior of a pivoting algorithm for linear complementarity and linear programming problems," Math. Program., vol. 35, pp. 173-192, 1986.
11. A. Schrijver, Theory of Linear and Integer Programming. New York: Wiley, 1987.
12. F. E. Ross, "FDDI - A tutorial," IEEE Commun. Mag., vol. 24, no. 5, pp. 10-17, May 1986.
13. M. J. Johnson, "Reliability mechanisms of the FDDI high bandwidth token ring protocol," in Comput. Netw. ISDN Syst., 1986, vol. 11, pp. 121-131.
14. C. G. Omidyar and A. Aldridge, "Introduction to SDH/SONET," IEEE Commun. Mag., vol. 31, no. 9, pp. 30-33, Sep. 1993.
15. C. S. Raghavendra and M. Gerla, "Optimal loop topologies for distributed systems," in Proc. Data Communications Symp., 1981, pp. 218-223.
16. X. D. Hu, F. K. Hwang, and W.-C. Li, "Most reliable double loop networks in survival reliability," in Proc. Networks, vol. 23, Aug. 1993, pp. 451-458.
17. N. F. Maxemchuk, "Regular mesh topologies in local and metropolitan area networks," AT&T Tech. J., vol. 64, no. 7, pp. 1659-1686, Sep. 1985.
18. N. F. Maxemchuk, "Routing in the Manhattan Street Network," IEEE Trans. Commun., vol. COM-35, no. 5, pp. 503-512, May 1987.
19. G. Albertengo, R. LoCigno, and G. Panzzardi, "Optimal routing for the broad-band manhattan street network," in Proc. ICC, Jun. 1991, pp. 1676-1680.
20. S. Bhattacharyya, C. Diot, J. Jetcheva, and N. Taft, "Pop-level and access-link-level traffic dynamics in a tier-1 POP," presented at the ACM SIGCOMM Internet Measurement Workshop (IMW), San Francisco, CA, Nov. 2001.
21. F. Borgonovo and E. Cadorin, "Routing in the bidirectional Manhattan Network," presented at the 3rd Int. Conf. Data Communications and Systems, Rio de Janeiro, Brazil, 1987.
22. J. T. Brassil, A. K. Choudhury, and N. F. Maxemchuk, "The Manhattan Street Network: A high performance, highly reliable metropolitan area network," Comput. Netw. ISDN Syst., vol. 26, pp. 841-858, Mar. 1994.
23. M. Dodge. (2004) An Atlas of Cyberspaces: AT&T IP Backbone Network, 2Q2000. Centre for Advanced Spatial Analysis, University College London, London, U.K. [Online]. Available: http://www.geog.ucl.ac.uk/casa/martin/ atlas/att_backbone_large.gif
24. G. B. Dantzig, Linear Programming and Extensions. Princeton, NJ: Princeton Univ. Press, 1963.
25. B. Fortz and M. Thorup, "Optimizing OPSF/IS-IS weights in a changing world," IEEE J. Sel. Areas Commun., vol. 20, no. 4, pp. 756-767, May 2002.
26. A. Medina, N. Taft, K. Salamatian, S. Bhattacharyya, and C. Diot, "Traffic matrix estimation: Existing techniques and new directions," presented at the ACM SIGCOMM, Pittsburgh, PA, Aug. 2002.
27. K. G. Murty, Linear and Combinatorial Programming. New York: Wiley, 1976.