A new routing control technique using active temporal data management

被引:1
作者
Kim, DH
Ryu, KH [1 ]
Cho, YS
机构
[1] Chungbuk Natl Univ, Dept Comp Sci, Cheongju 361763, South Korea
[2] Elect & Telecommun Res Inst, Taejon 305350, South Korea
关键词
Number:; 96132-IT2-I2; Acronym:; -; Sponsor:; 971-0902-015-2; KOSEF; Sponsor: Korea Science and Engineering Foundation;
D O I
10.1016/S0164-1212(99)00108-9
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
Determining the optimal path from source to destination as well as switching packets along the path is one of the main roles of a router in the Internet. Although there are vigorous researches so far related to various kinds of routing protocol, it still needs more sophisticated control techniques to resolve a routing loop problem. In this paper, we propose a new routing control technique using active temporal data management. It uses historical routing information as well as active message processing for efficient management so that it not only minimizes the size and the frequency of messages exchanged among routers, but also assures fast convergence to prevent the message loop. Also in terms of active real-time routing function, it determines the order of messages that happen periodically or aperiodically by means of computing their deadline time described in messages. With a simple example using the suggested technique, we analyze a logical performance evaluation by comparing it with some popular conventional routing protocols such as RIP and IGRP. Finally, concluding remarks and future works are discussed. (C) 2000 Elsevier Science Inc. All rights reserved.
引用
收藏
页码:37 / 48
页数:12
相关论文
共 23 条
[1]  
ALBRIGHTSON R, 1994, P NETW INT 94 LAS VE
[2]  
[Anonymous], 1995, ROUTING INTERNET
[3]  
[Anonymous], 1994, 1583 RFC
[4]  
Bellman R., 1957, DYNAMIC PROGRAMMING
[5]  
BERTSEKAS G, 1992, DATA NETWORKS
[6]  
COMER, 1988, INTERNETWORKING TCP
[7]  
ERIC C, 1982, 827 RFC
[8]  
FORSTER J, 1991, SVNC C
[9]  
HEDRICK C, 1988, 1058 RFCNETW INF CTR
[10]  
Hedrick C., 1989, INTRO IGRP