TY - GEN
T1 - A dynamic interdomain communication path setup in active network
AU - Yeh, Jyh Haw
AU - Chow, Randy
AU - Newman, Richard
PY - 1999
Y1 - 1999
N2 - An internetwork is composed of many administrative domains (ADs) with different administrative and security policies for protecting their own valuable resources. A network traffic flow between end-to-end stub ADs through intermediate transit ADs must not violate any stub or transit domain policies. Packets may be dropped by routers that detect a policy violation. Therefore, it is necessary for a communication session to set up a communication path in which all constituent routers are willing to serve for the session so that data packets can be delivered safely without being discarded. Moreover, such a communication path cannot always guarantee successful packet delivery if the intermediate routers or links are prone to failure or congestion. This paper proposes a dynamic interdomain communication path setup protocol to address these issues. The protocol is dynamic in the sense that the path determination strategy is distributed and a path can be reconfigured to bypass a failed or congested router or link. These two dynamic features require the intermediate network nodes to perform some computation and to make some decisions. The implementation of the protocol relies on the computational capability of an active network in which active nodes in the network can provide computational capabilities in addition to traditional communication. Thus, the design of the protocol is based on the assumption of an active network architecture. The protocol will be a useful tool for all connection-oriented applications in active networks.
AB - An internetwork is composed of many administrative domains (ADs) with different administrative and security policies for protecting their own valuable resources. A network traffic flow between end-to-end stub ADs through intermediate transit ADs must not violate any stub or transit domain policies. Packets may be dropped by routers that detect a policy violation. Therefore, it is necessary for a communication session to set up a communication path in which all constituent routers are willing to serve for the session so that data packets can be delivered safely without being discarded. Moreover, such a communication path cannot always guarantee successful packet delivery if the intermediate routers or links are prone to failure or congestion. This paper proposes a dynamic interdomain communication path setup protocol to address these issues. The protocol is dynamic in the sense that the path determination strategy is distributed and a path can be reconfigured to bypass a failed or congested router or link. These two dynamic features require the intermediate network nodes to perform some computation and to make some decisions. The implementation of the protocol relies on the computational capability of an active network in which active nodes in the network can provide computational capabilities in addition to traditional communication. Thus, the design of the protocol is based on the assumption of an active network architecture. The protocol will be a useful tool for all connection-oriented applications in active networks.
UR - http://www.scopus.com/inward/record.url?scp=84878601415&partnerID=8YFLogxK
U2 - 10.1007/978-3-540-48507-0_25
DO - 10.1007/978-3-540-48507-0_25
M3 - Conference contribution
AN - SCOPUS:84878601415
SN - 3540662383
SN - 9783540662389
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 274
EP - 285
BT - Active Networks - First International Working Conference, IWAN 1999, Proceedings
T2 - 1st International Working Conference on Active Networks, IWAN 1999
Y2 - 30 June 1999 through 2 July 1999
ER -