Minimizing packet loss by optimizing OSPF weights using online simulation

Proceedings - IEEE Computer Society's Annual International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems, MASCOTS

Volumn 2003-January, Issue , 2003, Pages 79-86

  Kaur, H T ^a   Ye, T ^a   Kalyanaraman, S ^a   Vastola, K S ^a  

^a RENSSELAER POLYTECHNIC INSTITUTE   (United States)

Author keywords

Analytical models; Computational modeling; Costs; Network topology; Protocols; Routing; Telecommunication network topology; Telecommunication traffic; Tellurium; Traffic control

Indexed keywords

ANALYTICAL MODELS; COSTS; DROPS; HEURISTIC ALGORITHMS; NETWORK MANAGEMENT; NETWORK PROTOCOLS; PACKET LOSS; QUEUEING THEORY; TELECOMMUNICATION NETWORKS; TELECOMMUNICATION TRAFFIC; TELLURIUM; TELLURIUM COMPOUNDS; TOPOLOGY; TRAFFIC CONTROL;

COMPUTATIONAL MODEL; LINEAR OBJECTIVE FUNCTIONS; LOCAL SEARCH HEURISTICS; NETWORK TOPOLOGY; OPTIMIZATION SCHEME; PACKET-DROP PROBABILITY; ROUTING; TRAFFIC CONDITIONS;

OPTIMIZATION;

EID: 33847052396     PISSN: 15267539     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/MASCOT.2003.1240645     Document Type: Conference Paper

References (15)

1. Dimitri P. Bertsekas, "Dynamic Models of Shortest Path Routing Algorithms for Communication Networks with Multiple Destinations," Proceedings of 1979 IEEE Conference on Decision and Control, pp. 127-133, Dec. 1979.
2. Robert B. Cooper, "Introduction to Queueing Theory," Second Ed. New York : North Holland, 1981.
3. Bernard Fortz and Mikkel Thorup, "Internet Traffic Engineering by Optimizing OSPF Weights, in Proceedings of the INFOCOM 2000, pp. 519-528, 2000.
4. Bernard Fortz and Mikkel Thorup, "Increasing Internet Capacity Using Local Search," Preprint, http://smg.ulb.ac.be/Preprints/Fortz00-21.html, 2000.
5. David W. Glazer and Carl Tropper, "A New Metric for Dynamic Routing Algorithms," IEEE Transactions on Communications, Vol. 38 No.3March 1990.
6. A. Feldmann, A. Greenberg, C. Lund, N. Reingold, J. Rexford and F. True, "Deriving traffic demands for operational IP networks: methodology and experience," IEEE/ACM Transaction on Networking, pp. 265-278, June 2001.
7. A. Feldmann, A. Greenberg, C. Lund, N. Reingold and J. Rexford, "Netscope: traffic engineering for IP networks," IEEE Network Magazine, special issue on Internet traffic engineering, pp. 11-19, March/April 2000.
8. Atul Khanna, John Zinky, "The Revised ARPANET Routing Metric," Proceedings of ACM SIGCOMM, pp. 45-56, 1989.
9. R. Nagarajan, J. F. Kurose and D. Towsley, "Approximation techniques for computing packet loss in finite-buffered voice multiplexers," IEEE J.Select.Areas Commun., 9(3):368-377, April 1991.
10. J. Moy, "OSPF Version 2," RFC 2178, April 1998.
11. (1997) NS-2(network simulator) http://www-mash.cs.berkeley.edu/ns.
12. Harry G. Perros Queueing Networks With Blocking, Exact and Approximate Solutions, Oxford University Press, 1994.
13. Z. Wang, J. Crowcroft, "Analysis of Shortest-Path Routing Algorithms in a Dynamic Network Environment," Computer Communication Review, Vol. 22, no. 2, pp.63-71, 1992.
14. T. Ye, D. Harrison, B. Mo, B. Sikdar, H. T. Kaur, S. Kalyanaraman, B. Szymanski and K. S. Vastola, "Network Management and Control Using Collaborative On-line Simulation," In Proceedings of IEEE ICC, Helsinki, Finland, June 2001.
15. T. Ye, S. Kalyanaraman, "A Recursive Random Search Algorithm for Network Protocol Optimization," Technical report, ECSE Department, Rensselaer Polytechnic Institute, 2001.