Traffic engineering with estimated traffic matrices
暂无分享,去创建一个
[1] Ross W. Callon,et al. Use of OSI IS-IS for routing in TCP/IP and dual environments , 1990, RFC.
[2] Edith Cohen,et al. Making intra-domain routing robust to changing and uncertain traffic demands: understanding fundamental tradeoffs , 2003, SIGCOMM '03.
[3] Albert G. Greenberg,et al. Experience in measuring backbone traffic variability: models, metrics, measurements and meaning , 2002, IMW '02.
[4] Ratul Mahajan,et al. Measuring ISP topologies with rocketfuel , 2002, TNET.
[5] K. G. Ramakrishnan,et al. Optimal routing in shortest-path data networks , 2001, Bell Labs Technical Journal.
[6] Anja Feldmann,et al. NetScope: traffic engineering for IP networks , 2000, IEEE Netw..
[7] Celso C. Ribeiro,et al. A Memetic Algorithm for OSPF Routing , 2002 .
[8] Harald Räcke,et al. Minimizing Congestion in General Networks , 2002, FOCS.
[9] Anja Feldmann,et al. Deriving traffic demands for operational IP networks: methodology and experience , 2000, SIGCOMM.
[10] Philippe L. Toint,et al. Transportation Modelling and Operations Research: A Fruitful Connection , 1998 .
[11] Jacek Kowalski,et al. Modelling Traffic Demand Between Nodes in a Telecommunications Network , 1995 .
[12] A. Dwivedi,et al. Traffic model for USA long-distance optical network , 2000, Optical Fiber Communication Conference. Technical Digest Postconference Edition. Trends in Optics and Photonics Vol.37 (IEEE Cat. No. 00CH37079).
[13] Panos M. Pardalos,et al. A Genetic Algorithm for the Weight Setting Problem in OSPF Routing , 2002, J. Comb. Optim..
[14] Eric C. Rosen,et al. Multiprotocol Label Switching Architecture , 2001, RFC.
[15] David K. Smith. Network Flows: Theory, Algorithms, and Applications , 1994 .
[16] J. L. Wang,et al. Minimax open shortest path first routing algorithms in networks supporting the SMDS service , 1993, Proceedings of ICC '93 - IEEE International Conference on Communications.
[17] Debasis Mitra,et al. A case study of multiservice, multipriority traffic engineering design for data networks , 1999, Seamless Interconnection for Universal Services. Global Telecommunications Conference. GLOBECOM'99. (Cat. No.99CH37042).
[18] Albert G. Greenberg,et al. Fast accurate computation of large-scale IP traffic matrices from link loads , 2003, SIGMETRICS '03.
[19] Matthew Roughan,et al. Experience in measuring internet backbone traffic variability: Models metrics, measurements and meaning , 2003 .
[20] Kenneth L. Calvert,et al. Modeling Internet topology , 1997, IEEE Commun. Mag..
[21] Mikkel Thorup,et al. Internet traffic engineering by optimizing OSPF weights , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).
[22] Christophe Diot,et al. Traffic matrix estimation: existing techniques and new directions , 2002, SIGCOMM 2002.
[23] J. K. Lenstra,et al. Local Search in Combinatorial Optimisation. , 1997 .
[24] John Moy,et al. OSPF Version 2 , 1998, RFC.
[25] J. Tinbergen. Shaping the World Economy: Suggestions for an International Economic Policy , 1964 .
[26] Mikkel Thorup,et al. Optimizing OSPF/IS-IS weights in a changing world , 2002, IEEE J. Sel. Areas Commun..