A simple livelock-free algorithm for packet switching

Shyamasundar, R. K. (1984) A simple livelock-free algorithm for packet switching Science of Computer Programming, 4 (3). pp. 249-256. ISSN 0167-6423

Full text not available from this repository.

Official URL: http://www.sciencedirect.com/science/article/pii/0...

Related URL: http://dx.doi.org/10.1016/0167-6423(84)90002-9

Abstract

Store-and-forward deadlock (SFD) occurs in packet switched computer networks when, among some cycle of packets buffered by the communication system, each packet in the cycle waits for the use of the buffer currently occupied by the next packet in the cycle. In this paper, a deadlock-free algorithm as well as a livelock-free algorithm for packet switching is obtained using the strategy of the banker's algorithm. Furthermore, the solution obtained is interpreted for the hyper-fast banker's problem.

Item Type:Article
Source:Copyright of this article belongs to Elsevier Science.
ID Code:56573
Deposited On:24 Aug 2011 10:57
Last Modified:24 Aug 2011 10:57

Repository Staff Only: item control page