Data networks
Controlling alternate routing in general-mesh packet flow networks
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
Routing high-bandwidth traffic in max-min fair share networks
Conference proceedings on Applications, technologies, architectures, and protocols for computer communications
Quality of service based routing: a performance perspective
Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
Load-sensitive routing of long-lived IP flows
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Algebra and algorithms for QoS path computation and hop-by-hop routing in the internet
IEEE/ACM Transactions on Networking (TON)
Internet QoS Routing Using the Bellman-Ford Algorithm
HPN '98 Proceedings of the IFIP TC-6 Eigth International Conference on High Performance Networking
Quality-of-service routing for supporting multimedia applications
IEEE Journal on Selected Areas in Communications
Optimal scheduling and routing for maximum network throughput
IEEE/ACM Transactions on Networking (TON)
Dynamic grooming in IP over optical networks based on the overlay architecture
Optical Switching and Networking
Planning data transfers in grids: a multi-service queueing approach
Concurrency and Computation: Practice & Experience
Hi-index | 0.00 |
This paper discusses a new approach to QoS routing, introducing the notion of algorithm resilience (i.e., its capability to adapt to network and load modifications) as performance index of the algorithm itself.The new approach can be summarized as Network Graph Reduction, i.e., a modification of the graph describing the network before the routing path is computed, in order to exclude from the path selection over-congested portions of the network. This solution leads to a class of two-step routing algorithms, where both steps are simple, hence allowing efficient implementation.Simulation experiments, run on randomly-generated topologies and traffic patterns, show that these routing algorithms perform consistently better than both the standard Minimum Hop algorithm and those QoS-based algorithms based on the same metrics but not using the notion of Network Graph Reduction.