DocumentCode
2053809
Title
Concurrent transmission and short loop latency protocol
Author
Xu, Mingcheng ; Herzog, Jomes H.
Author_Institution
Fibermux, Chatsworth, CA, USA
fYear
1988
fDate
10-12 Oct 1988
Firstpage
238
Lastpage
246
Abstract
A novel destination partial removal protocol, DRUID (destination removal without intermediate node delay) ring, is proposed for ring-type networks. In the DRUID ring, a node may initiate message transmission if its output link is free. Every node will relay the message immediately if it is idle when the message arrives. At the same time, the node also receives and buffers all incoming messages. Upon decoding the destination address, the destination node will truncate the message frame to a cut frame by eliminating the information field. This cut frame will continue to circulate around the ring until it arrives at a busy node where it is buffered, identified, and removed. The message frame will be completely removed by the destination node if it is busy when the message arrives. The protocol supports high concurrency while the loop latency is minimized
Keywords
protocols; DRUID; concurrent transmission; decoding; destination address; destination partial removal protocol; short loop latency protocol; Access protocols; Added delay; Computer networks; Concurrent computing; Decoding; Frame relay; Throughput; Token networks;
fLanguage
English
Publisher
ieee
Conference_Titel
Local Computer Networks, 1988., Proceedings of the 13th Conference on
Conference_Location
Minneapolis, MN
Print_ISBN
0-8186-0891-9
Type
conf
DOI
10.1109/LCN.1988.10234
Filename
10234
Link To Document