Path selection in user-controlled circuit-switched optical networks

User-controlled circuit-switched optical networks are gaining popularity in an effort to fulfill the insatiable data transport needs of the online community. In this paper we consider the resource allocation challenges that arise in such networks, in particular problems related to construction of end-to-end lightpaths for carrying large multimedia streams. Specifically, we discuss variations of the least cost and widest path problems that address two unique aspects of the user-controlled environment. First, since network resources are exposed for user-control using a service-oriented software control plane, each lightpath is subject to an expiry time. Second, because Wavelength Division Multiplexing (WDM) and resource partitioning introduces multiple redundant paths, classic least cost path computations tend to yield multiple optimal solutions, and so it is useful to break ties among these in a judicious manner. We present polynomial-time path selection techniques that address these issues using efficient data structures. We also show the benefit of breaking ties in shortest path computations in a manner that reduces harmful fragmentation of capacity.

[1]  Klara Nahrstedt,et al.  An overview of quality of service routing for next-generation high-speed networks: problems and solutions , 1998, IEEE Netw..

[2]  Robert E. Tarjan,et al.  Fibonacci heaps and their uses in improved network optimization algorithms , 1984, JACM.

[3]  Mark H. Ellisman,et al.  Data-intensive e-science frontier research , 2003, CACM.

[4]  Ossama Younis,et al.  Constraint-based routing in the internet: Basic principles and recent research , 2003, IEEE Communications Surveys & Tutorials.

[5]  Raouf Boutaba,et al.  Grid-Controlled Lightpaths for High Performance Grid Applications , 2003, Journal of Grid Computing.

[6]  Raouf Boutaba,et al.  Lightpaths on demand: a Web-services-based management system , 2004, IEEE Communications Magazine.

[7]  G. Junyent,et al.  Evolution of the user controlled lightpath provisioning system , 2005, Proceedings of 2005 7th International Conference Transparent Optical Networks, 2005..

[8]  Eric Mannie,et al.  Generalized Multi-Protocol Label Switching (GMPLS) Architecture , 2004, RFC.

[9]  Vern Paxson,et al.  Empirically derived analytic models of wide-area TCP connections , 1994, TNET.

[10]  C. Wright.  Experiences with optical internetworking forum (OIF) user to network interface (UNI) interoperability trials , 2002, Optical Fiber Communication Conference and Exhibit.

[11]  Mikkel Thorup,et al.  Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity , 1998, STOC '98.

[12]  Debanjan Saha,et al.  The optical network control plane: state of the standards and deployment , 2003, IEEE Commun. Mag..

[13]  Michel Savoie,et al.  Customer-managed end-to-end lightpath provisioning , 2005 .

[14]  Bill St. Arnaud,et al.  Transatlantic Native 10 Gigabit Ethernet Experiments: Connecting Geneva to Ottawa , 2004, HSNMC.

[15]  Liam Roditty,et al.  A faster and simpler fully dynamic transitive closure , 2003, SODA '03.

[16]  Biswanath Mukherjee,et al.  Virtual-topology adaptation for WDM mesh networks under dynamic traffic , 2003, TNET.

[17]  Kang G. Shin,et al.  Distributed QoS Routing Using Bounded Flooding , 1999 .

[18]  Admela Jukan,et al.  Extending end-to-end optical service provisioning and restoration in carrier networks: opportunities, issues, and challenges , 2004, IEEE Communications Magazine.

[19]  Michel Savoie,et al.  Service-Oriented Virtual Private Networks for Grid Applications , 2007, IEEE International Conference on Web Services (ICWS 2007).

[20]  Sally Floyd,et al.  Wide area traffic: the failure of Poisson modeling , 1995, TNET.

[21]  Leon Gommans,et al.  Dynamic paths in multi-domain optical networks for grids , 2005, Future Gener. Comput. Syst..

[22]  A.M.J. Koonen,et al.  A very high capacity optical fibre network for large- scale antenna constellations: the RETINA project , 2001 .

[23]  Michel Savoie,et al.  Customer-managed end-to-end lightpath provisioning , 2005, Int. J. Netw. Manag..

[24]  Uri Zwick,et al.  Improved Dynamic Reachability Algorithms for Directed Graphs , 2008, SIAM J. Comput..

[25]  Jing Wu,et al.  Customer-controlled and -managed optical networks , 2003 .

[26]  Anja Feldmann,et al.  The changing nature of network traffic: scaling phenomena , 1998, CCRV.

[27]  Hung Keng Pung,et al.  Fast and efficient flooding based QoS routing algorithm , 1999, Proceedings Eight International Conference on Computer Communications and Networks (Cat. No.99EX370).

[28]  Bill St. Arnaud,et al.  Optical BGP (OBGP): InterAS lightpath provisioning , 2001 .

[29]  Halima Elbiaze,et al.  A policy-based approach for user controlled lightpath provisioning , 2004, 2004 IEEE/IFIP Network Operations and Management Symposium (IEEE Cat. No.04CH37507).

[30]  Bo Xu,et al.  Eucalyptus: Intelligent Infrastructure Enabled Participatory Design Studio , 2006, Proceedings of the 2006 Winter Simulation Conference.

[31]  Ariel Orda,et al.  QoS Routing Mechanisms and OSPF Extensions , 1999, RFC.

[32]  Peter Steenkiste,et al.  On path selection for traffic with bandwidth guarantees , 1997, Proceedings 1997 International Conference on Network Protocols.