Internet QoS: Architectures and Mechanisms for Quality of Service
Internet QoS: Architectures and Mechanisms for Quality of Service
BRITE: An Approach to Universal Topology Generation
MASCOTS '01 Proceedings of the Ninth International Symposium in Modeling, Analysis and Simulation of Computer and Telecommunication Systems
On selection of candidate paths for proportional routing
Computer Networks: The International Journal of Computer and Telecommunications Networking
GMPLS: Architecture and Applications (The Morgan Kaufmann Series in Networking)
GMPLS: Architecture and Applications (The Morgan Kaufmann Series in Networking)
Network Routing: Algorithms, Protocols, and Architectures
Network Routing: Algorithms, Protocols, and Architectures
Traffic Engineering and QoS Optimization of Integrated Voice & Data Networks
Traffic Engineering and QoS Optimization of Integrated Voice & Data Networks
An open source traffic engineering toolbox
Computer Communications
Multi-service routing: a routing proposal for the next generation internet
NETWORKING'06 Proceedings of the 5th international IFIP-TC6 conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communications Systems
Traffic engineering with traditional IP routing protocols
IEEE Communications Magazine
Quality-of-service routing for supporting multimedia applications
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
Service differentiation in IP core networks may be supported by dedicated path selection rules. This paper investigates the degree of service distinction achievable when common routing strategies, like ECMP, SWP and WSP, are applied to two traffic classes separately and in different combinations. One traffic class requires low latencies, while the other is considered as best-effort traffic. A Maple program has been developed that evaluates network performance characteristics, like maximal link utilization, and per-class measures, like mean end-to-end delay and mean number of hops, when paths are computed on demand with traffic demands arriving in arbitrary order. Realistic network topologies may be imported from the publicly available tool BRITE, while link capacities and traffic patterns are chosen randomly (with realistic constraints) in Maple. Experiments show that a comparable service differentiation may already be achieved with less sophisticated strategy combinations, which apply ECMP to the delay-critical traffic class.