Parameterised Gradient Based Routing (PGBR) for Future Internet

被引:2
作者
Balasubramaniam, Sasitharan [1 ]
Botvich, Dmitri [1 ]
Mineraud, Julien [1 ]
Donnelly, William [1 ]
机构
[1] Waterford Inst Technol, Telecommun Software & Syst Grp, Carriganore, Waterford, Ireland
来源
2009 INTERNATIONAL CONFERENCE ON ADVANCED INFORMATION NETWORKING AND APPLICATIONS | 2009年
关键词
Dynamic and Distributed Routing; Future Internet;
D O I
10.1109/AINA.2009.140
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
The current internet infrastructure is facing a number of limitations that is not suitable to meet the growing number of services and users. In particular, one aspect that requires enhancement is routing, where original routing concepts were designed for static traffic patterns with minimal variations and supporting mainly low throughput traffic (e.g. Data). As the number of users as well as services supporting the user grows, the current routing mechanisms will not be feasible. In this paper we present a gradient based distributed routing technique that is based on discovering routes through a gradient field created in the topology. The gradient calculation is based on weighted sum of a number of components, which modifies the gradient field as the network load changes. Simulation results have also been presented to validate the proposed routing algorithm.
引用
收藏
页码:58 / 65
页数:8
相关论文
共 19 条
[1]  
[Anonymous], IEEE J SELECTED AREA
[2]  
[Anonymous], 1998, RFC
[3]  
APOSTOLOPOULOS G, 1999, P INF 99 APR
[4]  
APPLEGATE D, 2006, IEEE ACM T NETWORKIN, V14
[5]  
BALASUBRAMANIAM S, 2007, ADV BIOL INSPIRED IN
[6]  
Basu A., 2003, P SIGCOMM 2003 KARLS
[7]  
CHEN S, 1998, IEEE NETWORK, V12
[8]  
CHEN YW, 2002, IEEE INT C COMM ICC
[9]  
Fortz B., 2000, P IEEE INFOCOM
[10]  
GOPALAN K, 2004, IEEE COMMUNICATI JUN