Flow Control in Local-Area Networks of Interconnected Token Rings

Bux, Werner; Grillo, D.

doi:10.1007/978-3-642-86726-2_11

Cited by 7 publications

(5 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This is also the point at which the response time approaches innity. The purpose of a congestion control scheme [14,3] is to detect the fact that the network has reached the point of congestion collapse resulting in packet losses and to reduce the load so the network can return to an uncongested state.…”

Section: Congestion Avoidancementioning

confidence: 99%

Congestion avoidance in computer networks with a connectionless network layer: concepts, goals and methodology

Jain

Ramakrishnan

[1988] Proceedings. Computer Networking Symposium

127

View full text Add to dashboard Cite

Congestion is said to occur in the network when the resource demands exceed the capacity and packets are lost due to too much queuing in the network. During congestion, the network throughput may drop to zero and the path delay m a y become very high. A congestion control scheme helps the network to recover from the congestion state.Recent technological advances in computer networks have resulted in a signicant increase in the bandwidth of computer network links. The ARPAnet was designed in the 1970s using leased telephone lines having a bandwidth of 50 Kbits/second. In the 1980s, local area networks (LAN) such as Ethernet and Token rings have been introduced with a bandwidth in the range of 10 Mbits/second. In this second half of the same decade, eorts are underway to standardize ber optic LANs with a bandwidth of 100 Mbits/second and higher.The steadily increasing bandwidth of computer networks would lead one to believe that network congestion is a problem of the past. In fact, most network designers have found the opposite to be true. Congestion control has been receiving increased attention lately due to an increasing speed mismatch caused by the variety of links that compose a computer network today. Congestion occurs mainly at routers (intermediate nodes, gateways, or IMPs) and links in the network where the rate of incoming trac exceeds the bandwidth of the receiving node or link.

show abstract

Section: Congestion Avoidancementioning

confidence: 99%

Congestion avoidance in computer networks with a connectionless network layer: concepts, goals and methodology

Jain

Ramakrishnan

[1988] Proceedings. Computer Networking Symposium

127

View full text Add to dashboard Cite

show abstract

“…Algorithms for congestion control [3,4,6] have been developed * The authors' e-mail addresses arc : rick@gateway .mitre .org rama@dsmait .dec .co m mankin@gateway .initre.or g ** The work at MITRE was supported by the Defense Communications Agency under Contract F 19628 -90-C-0001 . and are in widespread use .…”

Section: Introductionmentioning

confidence: 99%

Dynamics of congestion control and avoidance of two-way traffic in an OSI testbed

Wilder¹,

Ramakrishnan²,

Mankin³

1991

SIGCOMM Comput. Commun. Rev.

View full text Add to dashboard Cite

Abstrac tAn extensive set of measurements were made i n an OSI testbed to study the behavior of congestion control and avoidance . Testbed systems use d the Connectionless Network Protocol (CLNP) an d Transport Protocol Class 4 (TP4), which ha d been modified to perform the CE-bit [10] congestion avoidance and the "CUTE" [6] congestio n recovery algorithms .We found that two-way traffic has dynamic s which can significantly decrease fairness amon g competing connections using congestio n avoidance . We present experiments that demonstrate this problem and our analysis of how twoway traffic results in reduced fairness . This analysis led us to develop an effectiv e modification to the congestion avoidance algorithms to maintain fairness with two-way traffic .Our analysis of experimental results also points to undesirable interactions between two-way traffic dynamics and a sending strategy that time s data transmissions by the receipt of acknowledgements . These interactions reinforce burstiness of transmissions, therefore increasing bufferin g requirements and delay in rooters . They may also decrease throughput .

show abstract

“…The dynamic window mechanism works as follows, [8]. Initially, mobiles use the window size as defined during the set-up of the logical link, Wmax.…”

Section: Llc Error Detectionlrccoverymentioning

confidence: 99%

“…Since data information has to be transpotted transparently, the paper also considers LLC (Logical Link Control) error detectiordrecovery functionalities as exercised at the Data Link layer and prompted by access collision on the medium. The recovery mechanism is of the Go-back-n type and is based on a dynamic window flow conml algorithm, [8], which has proven effective in a variety of traffic situations. …”

Section: Introducitonmentioning

confidence: 99%

A combined LLC/MAC traffic analysis of the radio interface in TDMA-based third generation mobile systems

Grillo

Subiaco

[1992 Proceedings] Vehicular Technology Society 42nd VTS Conference - Frontiers of Technology

View full text Add to dashboard Cite

SIP, DG, V. Valcannuta 250, I -00166 Rome, Italy (work carried aut when the puthot was w i h Fondazione Ugo Bordoni)Absrrucr -PRMA is a TDM-based multiple access protocol for third generation mobile radio systems capable of accommodating synchFonous and asynchmnous traffic and enabling efficient specaum usage. However, a traffic performance analysis of the protocol has been only carried out for speech traffic. This paper extends the analysis to a vaffic mixture comprising speech and data applications. The paper also considers error detectionhecovery functonalities as exercised at the Data Link layer. I. INTRODUCITONAmong the objectives set for third generation mobile radio systems are high capacity and integration with ISDNB-ISDN, [l], [2]. These objectives reflect, i.a.. in demanding design of the radio subsystem and in particular of the radio interface. One key element in the architecture of the radio interface is the multiple access technique because of its impact on the traffic handling capacity. Two major techniques, TDMA, [31, and CDMA, [41, [SI, are currently considered to have the potential for achieving the high capacity needed in third generation systems. A TDM-based multiple access protocol, PRMA (packet Reservation Multiple Access) has been proposed in [6], [7]. The protocol has the attractive property of enabling flexible and efficient specvum usage. Also, the protocol has the potential for coping with the service requirements of a range of traffic and application types.However, a traffic performance analysis of the protocol has been only carried out for speech traffic. This paper extends the analysis to a rraffic m i x m comprising speech and data applications. Since data information has to be transpotted transparently, the paper also considers LLC (Logical Link Control) error detectiordrecovery functionalities as exercised at the Data Link layer and prompted by access collision on the medium. The recovery mechanism is of the Go-back-n type and is based on a dynamic window flow conml algorithm, [8], which has proven effective in a variety of traffic situations. 11. LLC & MAC FUNCTION MODELLING The model described in the following relates to user information flowing from the mobile stations to the base station. Each mobile is involved in only one session, either speech or data. The base only delivers acknowledgement signals to the mobiles in case of data

show abstract

Flow Control in Local-Area Networks of Interconnected Token Rings

Cited by 7 publications

References 5 publications

Congestion avoidance in computer networks with a connectionless network layer: concepts, goals and methodology

Congestion avoidance in computer networks with a connectionless network layer: concepts, goals and methodology

Dynamics of congestion control and avoidance of two-way traffic in an OSI testbed

A combined LLC/MAC traffic analysis of the radio interface in TDMA-based third generation mobile systems

Contact Info

Product

Resources

About