An analysis of deflection routing in multi-dimensional regular mesh networks

Fang, Chien; Szymański, Tomasz

doi:10.1109/infcom.1991.147595

Cited by 15 publications

(6 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For instance, the network get saturated for a much smaller offered load (roughly 0.3 rather than 0.45). Thus, as observed in [12], a sequential rather than simultaneous treatment of the packets does not allow to reduce the number of deflections locally, and the throughput decreases: the throughput of greedy slotted routing is roughly the same as the throughput of unslotted routing. Moreover, as shown in [10], the distribution of the number of deflections for greedy slotted networks and for unslotted networks offers roughly the same shape (same median, same standard deviation, etc.).…”

Section: Comparison Between Slotted and Unslotted Networkmentioning

confidence: 96%

Unslotted deflection routing: a practical and efficient protocol for multihop optical networks

Chich

Cohen

Fraigniaud

2001

IEEE/ACM Trans. Networking

View full text Add to dashboard Cite

This paper is concerned with all-optical networks using deflection routing and time division multiplexing. Slotted networks make use of the synchronous arrival of the packets to the routers to minimize locally the number of deflections. In this paper, we show that the difference in performances between slotted and unslotted networks is mainly due to the fact that unslotted networks cannot easily perform such local optimization. We also show that minimizing locally the number of deflections in unslotted networks gives rise to an NP-complete problem. To overcome this problem, we have designed a heuristic whose aim is to limit locally the number of deflections. We experimentally demonstrate that this heuristic enhances unslotted routing almost at the same performance level as slotted routing. As a consequence, we have shown that unslotted deflection routing can be implemented is a way which makes it a competitive alternative to slotted deflection routing for optical time division multiplexing deflection networks.

show abstract

Section: Comparison Between Slotted and Unslotted Networkmentioning

confidence: 96%

Unslotted deflection routing: a practical and efficient protocol for multihop optical networks

Chich

Cohen

Fraigniaud

2001

IEEE/ACM Trans. Networking

View full text Add to dashboard Cite

show abstract

“…On the other hand, their implementation calls for a hardware that produces substantial signal degradation [6]. Additionally, the slotting of these networks does not allow the adaptation of packet sizes to the specific demands of different applications.…”

Section: Introductionmentioning

confidence: 99%

Performance Analysis of an Optical Switched Manhattan Street Network

et al. 2005

View full text Add to dashboard Cite

Manhattan Street Networks (MSN) are bidimensional linear node sets arranged as the avenues and streets of Manhattan. Deflection routing is performed-either in the synchronous or in the asynchronous mode-by conveying incoming packets towards one of the two outputs. The simulation and analysis of all-optical MS networks is the central target of this paper. In order to avoid using complex electronics and/or optical domain buffers, the deflection routing and the asynchronism are taken into account in the analysis. The obtained results are compared and discussed with respect to some previously described analytic methodologies.

show abstract

“…(Optical networks can use hot-potato or deflection routing to avoid losing packets and avoid acknowledgements; see [9,26,27]. )…”

Section: Fiber Optic Crossbarmentioning

confidence: 99%

A fiber optic hypermesh for SIMD/MIMD machines

Szymanski

Proceedings SUPERCOMPUTING '90

Self Cite

View full text Add to dashboard Cite

A fiber optic multidimensional mesh-based network for SIMD and MIMD multiprocessors is proposed. For the basic building block, a novel distributed optical switch is proposed; The switch requires 50 % fewer lasers/receivers than previous WDM optical crossbars and uses a novel random-access scheme which supports prioritized traffic. To implement very large networks using lasers with limited tunability (or electronic crossbars of small degree) we propose arranging switches into a novel n-dimensional network which we call a "hypermesh'. The hypermesh is unique in that it matches the 0 (ZogN) delay for random communications in dynamic multistage networks and the O(1) delay for permutations over nearest neighbors in a hypercube. A hypermesh also uses far fewer lasers/receivers than hypercubes of similar size, has many more nearest neighbors and has a much smaller diameter, all very attractive features. The hypermesh can be modelled as a hypergraph, and when d 2 k its size exceeds the Moore bound (which applies to graphs rather than hyper raphs). It is proved that the hypermesh can realize all R and R-passable permutations "in one pass" and in minimum distance, like the hypercube. Therefore, by doubling the number of lasedreceivers in each node the hypermesh is rearrangeably nonblocking. The hypermesh is recursively partitionable into smaller hypermeshes, each of which can be independently operated as a message-passing or circuit-switched network for MIMD machines or a permutation network for SIMD machines. An electronic hypermesh seems particularly well suited for interconnecting T800 Transputer type nodes with small bounded degree. f

show abstract

An analysis of deflection routing in multi-dimensional regular mesh networks

Cited by 15 publications

References 9 publications

Unslotted deflection routing: a practical and efficient protocol for multihop optical networks

Unslotted deflection routing: a practical and efficient protocol for multihop optical networks

Performance Analysis of an Optical Switched Manhattan Street Network

A fiber optic hypermesh for SIMD/MIMD machines

Contact Info

Product

Resources

About