End-to-End Delay in Localized QoS Routing

被引:0
作者
Alzahrani, Ahmed S. [1 ]
Woodward, Michael E. [1 ]
机构
[1] Univ Bradford, Dept Comp, Bradford BD7 1DP, W Yorkshire, England
来源
2008 11TH IEEE SINGAPORE INTERNATIONAL CONFERENCE ON COMMUNICATION SYSTEMS (ICCS), VOLS 1-3 | 2008年
关键词
Routing; Quality of Service; Localized Routing; Delay constraint;
D O I
暂无
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Quality of service (QoS) routing has been proposed for supporting the requirements of network applications and satisfying connection constraints. A large amount of information needs to be exchanged periodically among routers. Therefore, in order to satisfy such requirements localized QoS routing algorithms have been proposed. This is where source nodes make routing decisions based on statistics collected locally. Using local information for routing avoids the overheads of exchanging global information with other nodes. In this paper we present a localized delay-based QoS routing (DBR) algorithm which relies on delay constraint that each path satisfies to make routing decisions. We also modify Credit Based Routing (CBR) so that this uses delay instead of bandwidth. The two localized algorithms and the commonly used global shortest path algorithm (Dijkstra's) are compared under different delay constraints and network topologies. We demonstrated through simulation that our scheme performs better than the modified CBR under different range of workloads and system parameters and outperforms the Dijkstra scheme in all network topologies, unless unrealistically small update intervals are used.
引用
收藏
页码:1698 / 1704
页数:7
相关论文
共 16 条
  • [1] ALABBAD S, 2006, P 40 ANN SIM S IEE H
  • [2] Localised credit based QoS routing
    Alabbad, S. H.
    Woodward, M. E.
    [J]. IEE PROCEEDINGS-COMMUNICATIONS, 2006, 153 (06): : 787 - 796
  • [3] [Anonymous], 1999, 2676 RFC
  • [4] [Anonymous], OMNET DISCRETE EVENT
  • [5] Intradomain QoS routing in IP networks:: A feasibility and cost/benefit analysis
    Apostolopoulos, G
    Guérin, R
    Kamat, S
    Orda, A
    Tripathi, SK
    [J]. IEEE NETWORK, 1999, 13 (05): : 42 - 54
  • [6] APOSTOLOPOULOS G, 1998, COMPUTER COMMUNICATI, V28
  • [7] Chen SG, 1998, ICC 98 - 1998 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS VOLS 1-3, P874, DOI 10.1109/ICC.1998.685137
  • [8] DOAR M, 1993, BAD IS NAIVE MULTICA, P82
  • [9] GUERIN R, 1999, IEEE ACM T NETWORK, V7, P605
  • [10] KUIPERS FA, 2004, IEEE NETWORK SEP