A new approach to the maximum-flow problem
Journal of the ACM (JACM)
Data Structures and Their Algorithms
Data Structures and Their Algorithms
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
DORA: Efficient Routing for MPLS Traffic Engineering
Journal of Network and Systems Management
Profile-Based Routing: A New Framework for MPLS Traffic Engineering
COST 263 Proceedings of the Second International Workshop on Quality of Future Internet Services
On path selection for traffic with bandwidth guarantees
ICNP '97 Proceedings of the 1997 International Conference on Network Protocols (ICNP '97)
Path selection methods with multiple constraints in service-guaranteed WDM networks
IEEE/ACM Transactions on Networking (TON)
Providing public intradomain traffic matrices to the research community
ACM SIGCOMM Computer Communication Review
Distributed dynamic QoS-aware routing in WDM optical networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Design of logical topologies for wavelength-routed optical networks
IEEE Journal on Selected Areas in Communications
IEEE Journal on Selected Areas in Communications
IEEE Network: The Magazine of Global Internetworking
Integrated IP/WDM routing in GMPLS-based optical networks
IEEE Network: The Magazine of Global Internetworking
Hi-index | 0.00 |
In this paper, a new traffic engineering-capable routing and wavelength assignment scheme is proposed to efficiently handle LSP and lightpath setup requests with different QoS requirements on modern multi-layer (fully optical core and time-division multiplexed edge) transport networks. The objectives of the proposed algorithm are to minimize the rejection probability by maximizing the network load balancing and efficiently handling the grooming of several LSPs on the same lightpath while respecting the constraints of the optical node architecture and considering both traffic engineering and QoS requirements. The proposed solution consists of a two-stage RWA algorithm: each time a new request arrives, an on-line dynamic grooming scheme finds a set of feasible lightpaths which fulfill the QoS and traffic engineering requirements; then, the best feasible lightpath is selected, aiming to keep the network unbalancing and blocking probability as low as possible in the medium and long term, according to a novel global path affinity minimization concept. Extensive simulation experiments have been performed in which our on-line dynamic RWA algorithm demonstrated significant performances. Thanks to its optimal network resource usage and to its reasonable computational space and time complexity, the algorithm can be very attractive for the next-generation optical wavelength-switched networks.