DocumentCode
3465084
Title
Interconnection of single-hop random-access networks
Author
Bisdikian, C. ; Merakos, L. ; Georgiadis, L.
Author_Institution
Connecticut Univ., Storrs, CT, USA
fYear
1988
fDate
28 Nov-1 Dec 1988
Firstpage
1101
Abstract
The interconnection of two random-access packet-switched networks is considered. In each network a station, called the bride node, receives internetwork packets from the network users and forwards them to the bridge node of the destination network via a point-to-point link, called the bridge link. The bridge node of the destination network places these internetwork packets in its queue for subsequent transmission to the network users. The bridge nodes are assumed to share the same random-access channel that the users do; this type of multiplexing is referred to as contention multiplexing. Assuming that the input traffic in network i , i =1, 2, is Poisson with intensity λi, sufficient conditions are derived for the system stability as it is defined by the set S ={(λ1, λ2): the packet delay is finite with probability one}
Keywords
multiplexing; packet switching; telecommunication networks; Poisson traffic; bride node; bridge link; contention multiplexing; destination network; interconnection; internetwork packets; packet delay; packet-switched networks; point-to-point link; random-access channel; single-hop random-access networks; station; system stability; traffic intensity; Artificial intelligence; Bridges; Broadcasting; Delay effects; IP networks; Interconnected systems; Propagation delay; Random variables; Regions; Stability;
fLanguage
English
Publisher
ieee
Conference_Titel
Global Telecommunications Conference, 1988, and Exhibition. 'Communications for the Information Age.' Conference Record, GLOBECOM '88., IEEE
Conference_Location
Hollywood, FL
Type
conf
DOI
10.1109/GLOCOM.1988.26005
Filename
26005
Link To Document