Congestion avoidance in large supra-high-speed packet switching networks using neural arbiters

Khasnabish, Bhumip; Ahmadi, Majid; Shridhar, M.

doi:10.1109/glocom.1991.188372

Cited by 5 publications

(4 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…C ongestion is the network state where, because of mismanagement (e.g., improper access and routing), excessive requests, or faults, the demand for resources exceeds their availability [28]. When this happens, the queues at bottleneck nodes grow indefinitely and eventually exceed the available buffer space.…”

Section: Congestion Controlmentioning

confidence: 99%

“…With this approach, a slot traveling along a highway is relayed immediately. 28 The buffer associated with an outgoing link is examined whenever the slot to be relayed on the link turns out to be empty. In such a case, the first waiting slot is extracted from the buffer and relayed instead of the empty slot.…”

Section: Two-dimensional Toroidal Networkmentioning

confidence: 99%

“…1, 3 3,3 7,3 5,3 1,1 3,1 7,1 5,1 0,2 2,2 6,2 4,2 0,0 2,0 6,0 4,0 28 With the slight delay needed to examine the contents of its header. 29 Note that there are no arrows that would point strictly up or down.…”

Section: Two-dimensional Toroidal Networkmentioning

confidence: 99%

See 2 more Smart Citations

Routing in multihop packet switching networks: Gb/s challenge

1995

View full text Add to dashboard Cite

The authors survey networking solutions that have been proposed for high-speed packet-switched applications. Using these solutions as examples, they identify the specific problems resulting from very high transmission rates and explain how these problems influence the design of high-speed networks and protocols. They conclude that the solutions based on deflection routing are the most promising ones and suggest a number of directions for their evolution.

show abstract

Section: Congestion Controlmentioning

confidence: 99%

Section: Two-dimensional Toroidal Networkmentioning

confidence: 99%

See 1 more Smart Citation

Routing in multihop packet switching networks: Gb/s challenge

1995

View full text Add to dashboard Cite

show abstract

“…The priority category determination of the omnibuses of cells is performed using the threshold function shown in Fig.4. The reason for choosing this threshold function is to avoid network congestion [12]. Note that the traditional bridgebmuter based forwarding policies use flooding as the backup scheme [8].…”

Section: : the Proposed Forwarding And Learning Algorithmsmentioning

confidence: 99%

Neural brouter for network interconnections: MS-net interconnects DQDB-nets

Khasnabish

[1992] Proceedings 17th Conference on Local Computer Networks

Self Cite

View full text Add to dashboard Cite

Distributed-Queue Dual-Bus (DQDB) network is the recently adopted IEEE 802.6 standard for Media Access Control (MAC) in metropolitan area level networking environment [S, 6 and references therein, 16, 181. Manhattan Street Network (MSN} is a special kind of twoconnected regular mesh type di-graph (directed graph) proposed by Maxemchuk [ I S ] for local, metropolitan, and wide area networking. It is, however, expected [8-13, I S ] that the MSN will be more useful as a logical (or soft or virtual) backbone architecture interconnecting a large number of MSNs [ I S ] or FDDIs 191, or DQDBs [131, or a mix of each of them [I3]. Our concern in this paper is to investigate the performance of interconnected DQDBs, while the MSN is being used as the backbone architecture with neural brouters 1131 at its nodes. It is interesting to note that, since the MSN topology is logically equivalent to multi-channel ring network [13], it may be easily adapted to operate as a token ring -of course with multiple tokens -or token mesh network at heavy load conditions.Relevant performance measures using both analytical method and simularion are also included in this paper.

show abstract