Please use this identifier to cite or link to this item:
Full metadata record
DC FieldValueLanguage
dc.contributor.authorTuruk, A K-
dc.contributor.authorKumar, R-
dc.contributor.authorRamamurthy, B-
dc.identifier.citation5th International Workshop on Distributed Computing, IWDC 2003, P 340-349, LNCS 2918en
dc.descriptionCopyright for this article belongs to Springer Verlag (LNCS) DOI: 10.1007/b94926en
dc.description.abstractIn this paper we propose a token based algorithm to access the shared medium in an optical ring network. The algorithm is based on reservation scheme. However, unlike other reservation schemes, which operate on three stages viz. reserve, transmit and release, the proposed scheme operates in two stages and does not explicitly release the resources. The proposed algorithm selects the earliest available datachannel for reservation hence we call it Earliest Available Channel (EAC) algorithm. The EAC algorithm operates in a distributed manner. Each node in the network maintains three modules: send, receive and token processing modules. The algorithm has the capability of handling channel collision and destination con icts. We study the performance of the algorithm by simulation for bursty tra c modeled by M/Pareto distribution.en
dc.format.extent150399 bytes-
dc.publisherSpringer Verlagen
dc.subjectRing networken
dc.subjectMAC protocolen
dc.titleA Token Based Distributed Algorithm for Medium Access in an Optical Ring Networken
Appears in Collections:Conference Papers

Files in This Item:
File Description SizeFormat 
Iwdc2003.pdf396.91 kBAdobe PDFView/Open

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.