Skip to main content
SpringerLink
Log in

A virtually nonblocking self-routing permutation network which routes packets in O(log2 N) time

  • Published:
Telecommunication Systems Aims and scope Submit manuscript

Abstract

Asymptotically nonblocking networks are O(log2 N) depth self-routing permutation devices in which blocking probability vanishes when N (the number of network inputs) increases. This behavior does not guarantee, also for very large N, that all information always and simultaneously reaches its destination (and consequently that a whole permutation passes through the device) which is a requirement of the PRAM machine. In this work the conditions for which an asymptotically nonblocking network becomes asymptotically permutation nonblocking are studied, finally a virtually nonblocking device is obtained by a retransmission procedure which guarantees that all permutations always pass through this permutation device.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. K.E. Batcher, Sorting networks and their application, in: Proc. of Spring Joint Computer Conference (1968) pp. 307-314.

  2. R.L. Cruz, The statistical data fork: A class of broad-band multichannel switches, IEEE Transactions on Communications 40 (1992) 1625-1634.

    Article  Google Scholar 

  3. G.A. De Biase, C. Ferrone and A. Massini, A quasi-nonblocking self-routing network which routes packets in log2 N time, in: Proc. of the IEEE INFOCOM '93 (1993) pp. 1375-1381.

  4. G.A. De Biase, C. Ferrone and A. Massini, An O(log2 N) depth asymptotically nonblocking self-routing permutation network, IEEE Transactions on Computers 44 (1995) 1047-1050.

    Article  Google Scholar 

  5. D.V. Huntsberger, Statistical Inference (Allyn and Bacon Inc., Boston, 1967).

    Google Scholar 

  6. D.M. Koppelman and A.Y. Orucç, A self-routing permutation network, Journal of Parallel and Distributed Computing 10 (1990) 140-151.

    Article  Google Scholar 

  7. T.H. Szymansky and V.C. Hamacher, On the permutation capability of multistage interconnection networks, IEEE Transactions on Computers 36 (1987) 810-822.

    Google Scholar 

  8. T.H. Szymansky and V.C. Hamacher, On the universality of multipath multistage interconnection networks, Journal of Parallel and Distributed Computing 7 (1989) 541-569.

    Article  Google Scholar 

  9. T.H. Szymansky and C. Fang, Randomized routing of virtual connections in essentially nonblocking log N depth networks, IEEE Transactions on Communications 43 (1995) 2521-2531.

    Article  Google Scholar 

Download references

Authors
  1. G.A. De Biase
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. A. Massini
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

De Biase, G., Massini, A. A virtually nonblocking self-routing permutation network which routes packets in O(log2 N) time. Telecommunication Systems 10, 135–147 (1998). https://doi.org/10.1023/A:1019110915479

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1019110915479

Keywords

Search

Navigation