Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
Fast and scalable layer four switching
Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
High-speed policy-based packet forwarding using efficient multi-dimensional range matching
Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
Packet classification using tuple space search
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
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
A QoS Routing Mechanism for Reducing the Routing Inaccuracy Effects
QoS-IP 2003 Proceedings of the Second International Workshop on Quality of Service in Multiservice IP Networks
A New Class of Online Minimum-Interference Routing Algorithms
NETWORKING '02 Proceedings of the Second International IFIP-TC6 Networking Conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; and Mobile and Wireless Communications
Dynamic Online Routing Algorithm for MPLS Traffic Engineering
NETWORKING '02 Proceedings of the Second International IFIP-TC6 Networking Conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; and Mobile and Wireless Communications
Restoration by path concatenation: fast recovery of MPLS paths
Distributed Computing - Special issue: Selected papers from PODC '01
Bandwidth-delay constrained routing algorithms
Computer Networks: The International Journal of Computer and Telecommunications Networking
Inter-Area Traffic Engineering in a Differentiated Services Network
Journal of Network and Systems Management
Hybrid traffic engineering: the least path interference algorithm
SAICSIT '04 Proceedings of the 2004 annual research conference of the South African institute of computer scientists and information technologists on IT research in developing countries
Stochastic traffic engineering for demand uncertainty and risk-aware network revenue management
IEEE/ACM Transactions on Networking (TON)
Design and implementation of a scalable constraint-based routing module for QoS path computation
Proceedings of the 4th international IFIP/ACM Latin American conference on Networking
International Journal of Autonomous and Adaptive Communications Systems
Journal of Network and Systems Management
A traffic engineering approach for placement and selection of network services
IEEE/ACM Transactions on Networking (TON)
Hybrid routing in next generation IP networks
Computer Communications
Policy-driven traffic engineering for intra-domain quality of service provisioning
QofIS'02/ICQT'02 Proceedings of the 3rd international conference on quality of future internet services and internet charging and QoS technologies 2nd international conference on From QoS provisioning to QoS charging
An efficient virtual topology design and traffic engineering scheme for IP/WDM networks
ONDM'07 Proceedings of the 11th international IFIP TC6 conference on Optical network design and modeling
A robust routing plan to optimize throughput in core networks
ITC20'07 Proceedings of the 20th international teletraffic conference on Managing traffic performance in converged networks
Demand-oblivious routing: distributed vs. centralized approaches
INFOCOM'10 Proceedings of the 29th conference on Information communications
Constrained minimum lightpath affinity routing in multi-layer optical transport networks
Journal of High Speed Networks
QoS protection optimisation for MPLS
International Journal of Communication Networks and Distributed Systems
A new hybrid traffic engineering routing algorithm for bandwidth guaranteed traffic
AINTEC'06 Proceedings of the Second Asian international conference on Technologies for Advanced Heterogeneous Networks
A new precomputation scheme for MPLS traffic engineering routing
ICDCN'06 Proceedings of the 8th international conference on Distributed Computing and Networking
Profile-based routing and traffic engineering
Computer Communications
| Hi-index | 0.00 |
We present a new algorithm and framework for dynamic routing of bandwidth guaranteed flows. The problem is motivated by the need todynamically set up bandwidth guaranteed paths in carrier and ISP networks. Traditional routing algorithms such as minimum hop routing or widest path routing do not take advantage of any knowledge about the traffic distribution or ingress-egress pairs, and therefore can often lead to severe network underutilization. Our work is inspired by the recently proposed "minimum interference routing" algorithm (MIRA) of Kodialam and Lakshman, but it improves on their approach in several ways. Our main idea is to use a "traffic profile" of the network, obtained by measurements or service level agreements (SLAs), as a rough predictor of the future traffic distribution. We use this profile to solve a multicommodity network flow problem, whose output is used both to guide our online path selection algorithm as well as impose admission control. The offline multicommodity solution seems very effective at distributing the routes and avoiding bottlenecks around hot spots. In particular, our algorithm can anticipate a flow's blocking effect on groups of ingress-egress pairs, while MIRA only considers one ingress-egress pair at a time. Our simulation results show that the new algorithm outperforms shortest path, widest path, and minimum interference routing algorithms on several metrics, including the fraction of requests routed and the fraction of requested bandwidth routed. Finally, the framework is quite general and can be extended in numerous ways to accommodate a variety of traffic management priorities in the network.