DORA: Efficient Routing for MPLS Traffic Engineering
Journal of Network and Systems Management
Internet traffic engineering using multi-protocol label switching (MPLS)
Computer Networks: The International Journal of Computer and Telecommunications Networking - Special issue: Towards a new internet architecture
Optimal Link Capacity Dimensioning in Proportionally Fair Networks
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
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
ICN '01 Proceedings of the First International Conference on Networking-Part 2
Bandwidth-delay constrained routing algorithms
Computer Networks: The International Journal of Computer and Telecommunications Networking
Routing restorable bandwidth guaranteed connections using maximum 2-route flows
IEEE/ACM Transactions on Networking (TON)
Traffic engineering for MPLS-based virtual private networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
A parameter based admission control for differentiated services networks
Computer Networks: The International Journal of Computer and Telecommunications Networking - QoS in multiservice IP networks
Virtual Traffic Path Optimization in Connection-Oriented Networks with Stochastic Traffic
Journal of Network and Systems Management
Routing demands with time-varying bandwidth profiles on a MPLS network
Computer Networks: The International Journal of Computer and Telecommunications Networking
Fast network re-optimization schemes for MPLS and optical networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Dynamic online QoS routing schemes: performance and bounds
Computer Networks: The International Journal of Computer and Telecommunications Networking
A link weight assignment algorithm for traffic-engineered networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Multi-path routing versus tree routing for VPN bandwidth provisioning in the hose model
Computer Networks: The International Journal of Computer and Telecommunications Networking
Understanding optimal data gathering in the energy and latency domains of a wireless sensor network
Computer Networks: The International Journal of Computer and Telecommunications Networking
IEEE Transactions on Computers
Interface split routing for finer-grained traffic engineering
Performance Evaluation
International Journal of Ad Hoc and Ubiquitous Computing
Fast reroute with pre-established bypass tunnel in MPLS
Computer Communications
DeSiNe: a flow-level QoS simulator of networks
Proceedings of the 1st international conference on Simulation tools and techniques for communications, networks and systems & workshops
Integration of explicit effective-bandwidth-based QoS routing with best-effort routing
IEEE/ACM Transactions on Networking (TON)
Journal of Network and Systems Management
MPLS Online Routing Optimization Using Prediction
Network Control and Optimization
Traffic engineering of MPLS backbone networks in the presence of heterogeneous streams
Computer Networks: The International Journal of Computer and Telecommunications Networking
Research challenges in QoS routing
Computer Communications
An open source traffic engineering toolbox
Computer Communications
Fast network re-optimization schemes for MPLS and optical networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Dynamic online QoS routing schemes: Performance and bounds
Computer Networks: The International Journal of Computer and Telecommunications Networking
Routing demands with time-varying bandwidth profiles on a MPLS network
Computer Networks: The International Journal of Computer and Telecommunications Networking
A new path selection algorithm for MPLS networks based on available bandwidth estimation
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
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
Reinforcement learning-based load shared sequential routing
NETWORKING'07 Proceedings of the 6th international IFIP-TC6 conference on Ad Hoc and sensor networks, wireless networks, next generation internet
Fast network re-optimization schemes for MPLS and optical networks
IWQoS'03 Proceedings of the 11th international conference on Quality of service
Virtual-Flow Multipath Algorithms for MPLS
International Journal of Internet Technology and Secured Transactions
Autonomic traffic engineering for network robustness
IEEE Journal on Selected Areas in Communications
Towards resource-optimal routing plans for real-time traffic
ISoLA'10 Proceedings of the 4th international conference on Leveraging applications of formal methods, verification, and validation - Volume Part I
Constrained minimum lightpath affinity routing in multi-layer optical transport networks
Journal of High Speed Networks
Robust network planning in nonuniform traffic scenarios
Computer Communications
Anycasting in connection-oriented computer networks: Models, algorithms and results
International Journal of Applied Mathematics and Computer Science - Computational Intelligence in Modern Control Systems
A new function for optimization of working paths in survivable MPLS networks
ISCIS'06 Proceedings of the 21st international conference on Computer and Information Sciences
Minimum interference path selection based on maximum degree of sharing
HPCC'05 Proceedings of the First international conference on High Performance Computing and Communications
On the performance of dynamic online qos routing schemes
QoS-IP'05 Proceedings of the Third international conference on Quality of Service in Multiservice IP Networks
QoS dynamic routing in content delivery networks
NETWORKING'05 Proceedings of the 4th IFIP-TC6 international conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communication Systems
Energy efficient online routing of flows with additive constraints
Computer Networks: The International Journal of Computer and Telecommunications Networking
An energy-aware dynamic RWA framework for next-generation wavelength-routed networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Lambda GLSP setup with QoS requirements in optical Internet
Computer Communications
Profile-based routing and traffic engineering
Computer Communications
Dynamic bandwidth allocation in multi-class connection-oriented networks
Computer Communications
Computer Communications
On multi-stream multi-source multicast routing
Computer Networks: The International Journal of Computer and Telecommunications Networking
Hi-index | 0.08 |
This paper presents new algorithms for dynamic routing of bandwidth guaranteed tunnels, where tunnel routing requests arrive one by one and there is no a priori knowledge regarding future requests. This problem is motivated by the service provider needs for fast deployment of bandwidth guaranteed services. Offline routing algorithms cannot be used since they require a priori knowledge of all tunnel requests that are to be rooted. Instead, on-line algorithms that handle requests arriving one by one and that satisfy as many potential future demands as possible are needed. The newly developed algorithms are on-line algorithms and are based on the idea that a newly routed tunnel must follow a route that does not “interfere too much” with a route that may he critical to satisfy a future demand. We show that this problem is NP-hard. We then develop path selection heuristics which are based on the idea of deferred loading of certain “critical” links. These critical links are identified by the algorithm as links that, if heavily loaded, would make it impossible to satisfy future demands between certain ingress-egress pairs. Like min-hop routing, the presented algorithm uses link-state information and some auxiliary capacity information for path selection. Unlike previous algorithms, the proposed algorithm exploits any available knowledge of the network ingress-egress points of potential future demands, even though the demands themselves are unknown. If all nodes are ingress-egress nodes, the algorithm can still be used, particularly to reduce the rejection rate of requests between a specified subset of important ingress-egress pairs. The algorithm performs well in comparison to previously proposed algorithms on several metrics like the number of rejected demands and successful rerouting of demands upon link failure