Please use this identifier to cite or link to this item:
http://hdl.handle.net/1942/4656
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | JANSSENS, Gerrit K. | - |
dc.date.accessioned | 2007-12-20T15:51:27Z | - |
dc.date.available | 2007-12-20T15:51:27Z | - |
dc.date.issued | 1997 | - |
dc.identifier.citation | IEEE transactions on communications, 45(3). p. 360-364 | - |
dc.identifier.uri | http://hdl.handle.net/1942/4656 | - |
dc.description.abstract | A performance model is developed and validated for a local area network (LAN) with a star topology. A collision-avoidance network access protocol, as implemented in Hubnet, is considered. The model is based on a single server queueing system with finite sources and with a single buffer. Packets arriving at a full buffer retry their access after a fixed time period. Results for an eight-node network are presented and validated by means of earlier obtained simulation results. | - |
dc.language.iso | en | - |
dc.subject.other | Access protocols; Computer communications; Computer network performance; Local area networks (LAN's); Protocols, access; Queuing analysis; Traffic control (communication) | - |
dc.title | The quasi-random input queueing system with repeated attempts as a model for a collision avoidance star local area network | - |
dc.type | Journal Contribution | - |
dc.identifier.epage | 364 | - |
dc.identifier.issue | 3 | - |
dc.identifier.spage | 360 | - |
dc.identifier.volume | 45 | - |
dc.bibliographicCitation.oldjcat | - | |
dc.identifier.url | http://dl.comsoc.org/cocoon/comsoc/servlets/GetPublication?id=148760 | - |
item.accessRights | Closed Access | - |
item.fullcitation | JANSSENS, Gerrit K. (1997) The quasi-random input queueing system with repeated attempts as a model for a collision avoidance star local area network. In: IEEE transactions on communications, 45(3). p. 360-364. | - |
item.fulltext | No Fulltext | - |
item.contributor | JANSSENS, Gerrit K. | - |
Appears in Collections: | Research publications |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.