RANDOM ACCESS PACKET SWITCHED LOCAL COMPUTER NETWORK WITH PRIORITY FUNCTION.

Ichiro Iida*, Mitsuru Ishizuka, Yasuhiko Yasuda, Morio Onoe

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingChapter

6 Citations (Scopus)

Abstract

A description is given of a local computer communication network called ″Priority Ethernet″ which modifies the original Ethernet to be capable of transmitting important information without much delay even when the channel is heavily loaded. This modification is realized by adding to a packet a preamble signal of which duration is proportional to its priority level. By incorporating this priority function, the highest priority packet of colliding ones is always successfully transmitted. Since this priority function is realized by a very little increase of hardware, the proposed system still keeps such key features of the original Ethenet as simplicity, reliability and extensibility. The principle of the scheme, the throughput-delay analysis and the brief description of a model system are presented.

Original languageEnglish
Title of host publicationNTC Conference Record - National Telecommunications Conference
Place of PublicationPiscataway, NJ
PublisherIEEE
Volume2
Publication statusPublished - 1980
Externally publishedYes
EventUnknown conference - Houston, TX, USA
Duration: 1980 Nov 301980 Dec 4

Other

OtherUnknown conference
CityHouston, TX, USA
Period80/11/3080/12/4

ASJC Scopus subject areas

  • Engineering(all)

Fingerprint

Dive into the research topics of 'RANDOM ACCESS PACKET SWITCHED LOCAL COMPUTER NETWORK WITH PRIORITY FUNCTION.'. Together they form a unique fingerprint.

Cite this