IEEE Global Telecommunications Conference, 1989, and Exhibition. 'Communications Technology for the 1990s and Beyond
DOI: 10.1109/glocom.1989.64246
|View full text |Cite
|
Sign up to set email alerts
|

Meeting the challenge: congestion and flow control strategies for broadband information transport

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
17
0

Publication Types

Select...
6
2
1

Relationship

0
9

Authors

Journals

citations
Cited by 93 publications
(18 citation statements)
references
References 10 publications
0
17
0
Order By: Relevance
“…Thus, larger buffers will be invariably associated with greater delay and lowered performance. Eckberg et al [15] corroborate by noting that large and expensive buffers add significantly to end-to-end delays. Zhang [18] stresses the importance of finite buffers in switching nodes and notes that the assumption of infinite buffers is unrealistic.…”
Section: Introductionmentioning
confidence: 61%
See 1 more Smart Citation
“…Thus, larger buffers will be invariably associated with greater delay and lowered performance. Eckberg et al [15] corroborate by noting that large and expensive buffers add significantly to end-to-end delays. Zhang [18] stresses the importance of finite buffers in switching nodes and notes that the assumption of infinite buffers is unrealistic.…”
Section: Introductionmentioning
confidence: 61%
“…Li [14] proposes a new analytical model for overload control in finite message storage buffers. Eckberg et al [15] propose a core network congestion control, termed "bandwidth management," wherein cells that correspond to excessive traffic are first tagged selectively based on traffic agreements and real-time traffic monitoring and then discarded where congestion is encountered.…”
Section: Introductionmentioning
confidence: 99%
“…• Specification of how many requests for slot allocation from each active connection will be serviced in the current frame • Determination of the exact location in the frame of the time slot allocated to each serviced request For the first action, the algorithm combines priorities with a leaky bucket traffic regulator [18]. It sorts connections based on their service class [19], and assigns priorities to them as shown in Table 1 (the larger the number the higher the priority).…”
Section: The Scheduling Algorithm Of Mascaramentioning
confidence: 99%
“…In preventive load control, it is mandatory to supervise each connection at the entrance to the network in order to make the QOS estimate reliable. If a violation of the agreement (either caused by a malfunctioning terminal or due to a deliberate attempt) is detected, cells will be dropped or, as suggested in [4], marked so that they can be dropped in a later stage. The function that is supervising the connection has been given many names in literature, such as policing, flow enforcement, traffic enforcement, and usage parameter control (the last is used by CCITT, see [ 5 ] ) .…”
Section: Introductionmentioning
confidence: 99%