Dynamic reconfiguration and routing algorithms for IP-over-WDM networks with stochastic traffic

Proceedings - IEEE INFOCOM

Volumn 1, Issue , 2005, Pages 432-443

  Brzezinski, Andrew ^a   Modiano, Eytan ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

INTERNET PROTOCOLS (IP); MULTI-HOP ROUTING; ROUTING ALGORITHMS; SINGLE-HOP ROUTING;

COMPUTER SIMULATION; DECISION MAKING; INTERNET; NETWORK PROTOCOLS; OPTICAL COMMUNICATION; RANDOM PROCESSES; ROUTERS; SCHEDULING; TELECOMMUNICATION TRAFFIC; THROUGHPUT; TOPOLOGY; TRANSCEIVERS; TUNING; WAVELENGTH DIVISION MULTIPLEXING;

ALGORITHMS;

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

References (15)

1. A. Narula-Tam and E. Modiano, "Dynamic load balancing in WDM networks with and without wavelength constraints," IEEE J. Select. Areas Commun., vol. 18, pp. 1972-1979, October 2000.
2. J.-F. P. Labourdette and A. S. Acampora, "Logically rearrangeable multihop lightwave networks," IEEE Trans. Commun., vol. 39, pp. 1223-1230, August 1991.
3. J.-F. P. Labourdette, F. W. Hart, and A. S. Acampora, "Branch-exchange sequences for reconfiguration of lightwave networks," IEEE Trans. Commun., vol. 42, pp. 2822-2832, October 1994.
4. I. Baldine and G. Rouskas, "Traffic adaptive WDM networks: a study of reconfiguration issues," J. Lightwave Technol., vol. 19, pp. 433-455, April 2001.
5. I. Widjaja, I. Saniee, R. Giles, and D. Mitra, "Light core and intelligent edge for a flexible, thin-layered and cost-effective optical transport network," IEEE Commun. Mag., vol. 41, pp. S30-S36, May 2003.
6. K. Ross, N. Bambos, K. Kumaran, I. Saniee, and I. Widjaja, "Scheduling bursts in time-domain wavelength interleaved networks," IEEE J. Select. Areas Commun., vol. 21, pp. 1441-1451, November 2003.
7. J. G. Dai and B. Prabhakar, "The throughput of data switches with and without speedup," in IEEE Proc. INFOCOM, 2000, pp. 556-564.
8. L. Tassiulas and A. Ephremides, "Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks," IEEE Trans. Automat. Contr. vol. 37, no. 12, pp. 1936-1948, December 1992.
9. A. Stolyar, "Maxweight scheduling in a generalized switch: state space collapse and workload minimization in heavy traffic," Annals of Applied Probability, vol. 14, no. 1, pp. 1-53, January 2004.
10. S. Meyn and R. Tweedie, Markov Chains and Stochastic Stability, Springer Verlag, 1996.
11. M. Andrews, K. Kumaran, K. Ramanan, A. Stolyar, R. Vijayakumar, and P. Whiting, "Scheduling in a queueing system with asynchronously varying service rates," Probability in the Engineering and Informational Sciences, vol. 18, pp. 191-217, 2004.
12. A. L. Dulmage and N. S. Mendelsohn, "Matrices associated with the hitchcock problem," Journal of the ACM, October 1962.
13. C. Chang, W. Chen, and H. Huang, "Birkhoff-von Neumann input buffered crossbar switches," in IEEE Proc. INFOCOM, 2000.
14. E. Leonardi, M. Mellia, F. Neri, and M. Ajmone Marsan, "Bounds on average delays and queue size averages and variances in input-queued cell-based switches," in IEEE Proc. INFOCOM, 2001.
15. N. McKeown, A. Mekkittikul, V. Anantharam, and J. Walrand, "Achieving 100% throughput in an input-queued switch," IEEE Trans. Commun., vol. 47, pp. 1260-1267, August 1999.