A new class of QoS routing strategies based on network graph reduction
Proceedings - IEEE INFOCOM - Tập 2 - Trang 715-722 vol.2
Tóm tắt
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 the performance index of the algorithm itself, for a given network topology, load and traffic pattern. 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 outperform 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.
Từ khóa
#Routing #Telecommunication traffic #IP networks #Cost function #Throughput #Electronic mail #Network topology #Traffic control #TCPIP #BandwidthTài liệu tham khảo
0, Georgia Teach-Internetwork Topology Models
10.1109/GLOCOM.2001.965901
0, ANCLES - A Network Call-Level Simulator
rosen, 2001, Multi-protocol label switching architecture, RFC 3031
10.1109/HPSR.2001.923650
10.1145/190314.190330
casetti, 0, An adaptive routing algorithm for best-effort traffic in integrated-services networks, 16th International Teletraffic Congress (ITC-16) Edinburgh UK June 1999
ma, 0, Routing traffic with quality-of-service guarantees in integrated services networks, 8th IEEE/ACM International Workshop on Network and Operating Systems Support for Digital Audio and Video (NOSSDAV'98) England July 1998
ma, 1996, Routing high-bandwidth traffic in max-min fair share networks, Proceedings of the ACM Sigcomm'96, 206
wang, 1996, QoS routing for supporting multimedia applications, IEEE JSAC, 14, 1228
bertsekas, 1992, Data networks
10.1145/316194.316225
apostolopoulos, 1999, QoS routing mechanisms and OSPF extensions, RFC 2676
apostolopoulos, 0, Quality of service based routing: A performance perspective, ACM SIGCOMM'98 Vancouver Canada Sept 1998
10.1007/978-0-387-35388-3_37
callon, 1990, Use of OSI IS-IS for routing in TCP/IP and dual environments, RFC 1195
moy, 1998, Open shortest path first version 2, RFC 2328