Thumbnail
Access Restriction
Subscribed

Author Birman, Alexander ♦ Gail, H. Richard ♦ Hantler, Sidney L. ♦ Rosberg, Zvi ♦ Sidi, Moshe
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Copyright Year ©1995
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Subject Keyword Buffer overflow ♦ Gradual input ♦ Multiplexor ♦ Parallel queues ♦ Service discipline ♦ Switch
Abstract Consider a switching component in a packet-switching network, where messages from several incoming channels arrive and are routed to appropriate outgoing ports according to a service policy. One requirement in the design of such a system is to determine the buffer storage necessary at the input of each channel and the policy for serving these buffers that will prevent buffer overflow and the corresponding loss of messages. In this paper, a class of buffer service policies, called Least Time to Reach Bound (LTRB), is introduced that guarantees no overflow, and for which the buffer size required at each input channel is independent of the number of channels and their relative speeds. Further, the storage requirement is only twice the maximal length of a message in all cases, and as a consequence the class is shown to be $\textit{optimal}$ in the sense that any nonoverflowing policy requires at least as much storage as LTRB.
ISSN 00045411
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 1995-05-01
Publisher Place New York
e-ISSN 1557735X
Journal Journal of the ACM (JACM)
Volume Number 42
Issue Number 3
Page Count 17
Starting Page 641
Ending Page 657


Open content in new tab

   Open content in new tab
Source: ACM Digital Library