On Buffer-Economical Store-and-Forward Deadlock Prevention

Baruch Awerbuch; Shay Kutten; David Peleg

doi:10.1109/26.328973

On Buffer-Economical Store-and-Forward Deadlock Prevention

Baruch Awerbuch, Shay Kutten, David Peleg

Research output: Contribution to journal › Article › peer-review

7 Scopus citations

Abstract

This note deals with store-and-forward deadlock prevention in communication networks. The approach we adopt is that of establishing buffer classes in order to prevent cyclic wailing chains. This type of solutions usually tends to require many buffers. The main contribution of the current note is in showing that the number of required buffers can be reduced considerably by employing a hierarchical organization of the network. The note proposes a new hierarchical scheme for arbitrary networks, that features a tradeoff between the communication overhead and the buffer requirements of the routing. This tradeoff can be shown to be close to optimal.

Original language	English
Pages (from-to)	2934-2937
Number of pages	4
Journal	IEEE Transactions on Communications
Volume	42
Issue number	11
DOIs	https://doi.org/10.1109/26.328973
State	Published - Nov 1994
Externally published	Yes

Bibliographical note

Funding Information:
Paper approved by J. M. Jaffe, the Editor for Switchmg and Routing of the IEEE Communications Society. Manuscript received June 13, 1990; revised April 10, 1991 and January 27,1993. The work of B. Awerbuch was supported by the Air Force under Contract TND GAFOSR-86-0078, ARO Contract DAAL 03-86-K-0171, NSF Contract CCR8611442, and a special grant from IBM. The work of D. Peleg was supported in part by an Allon Fellowship, a Bantrell Fellowship, and by a Walter and Elise Haas Career Development Award. This paper was presented in part at INFO COM, Bal-Harbour, FL, April 1991.

Funding

Paper approved by J. M. Jaffe, the Editor for Switchmg and Routing of the IEEE Communications Society. Manuscript received June 13, 1990; revised April 10, 1991 and January 27,1993. The work of B. Awerbuch was supported by the Air Force under Contract TND GAFOSR-86-0078, ARO Contract DAAL 03-86-K-0171, NSF Contract CCR8611442, and a special grant from IBM. The work of D. Peleg was supported in part by an Allon Fellowship, a Bantrell Fellowship, and by a Walter and Elise Haas Career Development Award. This paper was presented in part at INFO COM, Bal-Harbour, FL, April 1991.

Funders	Funder number
Air Force	TND GAFOSR-86-0078
National Science Foundation	CCR8611442
Army Research Office	DAAL 03-86-K-0171
International Business Machines Corporation

Access to Document

10.1109/26.328973

Cite this

@article{2f4ddf8f81664ea5b3bf6a0d6181220b,

title = "On Buffer-Economical Store-and-Forward Deadlock Prevention",

abstract = "This note deals with store-and-forward deadlock prevention in communication networks. The approach we adopt is that of establishing buffer classes in order to prevent cyclic wailing chains. This type of solutions usually tends to require many buffers. The main contribution of the current note is in showing that the number of required buffers can be reduced considerably by employing a hierarchical organization of the network. The note proposes a new hierarchical scheme for arbitrary networks, that features a tradeoff between the communication overhead and the buffer requirements of the routing. This tradeoff can be shown to be close to optimal.",

author = "Baruch Awerbuch and Shay Kutten and David Peleg",

note = "Funding Information: Paper approved by J. M. Jaffe, the Editor for Switchmg and Routing of the IEEE Communications Society. Manuscript received June 13, 1990; revised April 10, 1991 and January 27,1993. The work of B. Awerbuch was supported by the Air Force under Contract TND GAFOSR-86-0078, ARO Contract DAAL 03-86-K-0171, NSF Contract CCR8611442, and a special grant from IBM. The work of D. Peleg was supported in part by an Allon Fellowship, a Bantrell Fellowship, and by a Walter and Elise Haas Career Development Award. This paper was presented in part at INFO COM, Bal-Harbour, FL, April 1991.",

year = "1994",

month = nov,

doi = "10.1109/26.328973",

language = "אנגלית",

volume = "42",

pages = "2934--2937",

journal = "IEEE Transactions on Communications",

issn = "0090-6778",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

number = "11",

}

TY - JOUR

T1 - On Buffer-Economical Store-and-Forward Deadlock Prevention

AU - Awerbuch, Baruch

AU - Kutten, Shay

AU - Peleg, David

N1 - Funding Information: Paper approved by J. M. Jaffe, the Editor for Switchmg and Routing of the IEEE Communications Society. Manuscript received June 13, 1990; revised April 10, 1991 and January 27,1993. The work of B. Awerbuch was supported by the Air Force under Contract TND GAFOSR-86-0078, ARO Contract DAAL 03-86-K-0171, NSF Contract CCR8611442, and a special grant from IBM. The work of D. Peleg was supported in part by an Allon Fellowship, a Bantrell Fellowship, and by a Walter and Elise Haas Career Development Award. This paper was presented in part at INFO COM, Bal-Harbour, FL, April 1991.

PY - 1994/11

Y1 - 1994/11

N2 - This note deals with store-and-forward deadlock prevention in communication networks. The approach we adopt is that of establishing buffer classes in order to prevent cyclic wailing chains. This type of solutions usually tends to require many buffers. The main contribution of the current note is in showing that the number of required buffers can be reduced considerably by employing a hierarchical organization of the network. The note proposes a new hierarchical scheme for arbitrary networks, that features a tradeoff between the communication overhead and the buffer requirements of the routing. This tradeoff can be shown to be close to optimal.

AB - This note deals with store-and-forward deadlock prevention in communication networks. The approach we adopt is that of establishing buffer classes in order to prevent cyclic wailing chains. This type of solutions usually tends to require many buffers. The main contribution of the current note is in showing that the number of required buffers can be reduced considerably by employing a hierarchical organization of the network. The note proposes a new hierarchical scheme for arbitrary networks, that features a tradeoff between the communication overhead and the buffer requirements of the routing. This tradeoff can be shown to be close to optimal.

UR - http://www.scopus.com/inward/record.url?scp=0028543159&partnerID=8YFLogxK

U2 - 10.1109/26.328973

DO - 10.1109/26.328973

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:0028543159

SN - 0090-6778

VL - 42

SP - 2934

EP - 2937

JO - IEEE Transactions on Communications

JF - IEEE Transactions on Communications

IS - 11

ER -

On Buffer-Economical Store-and-Forward Deadlock Prevention

Abstract

Bibliographical note

Funding

Access to Document

Other files and links

Fingerprint

Cite this