Analysis of a Finite Number of Deflections in Fully and Uniformly Loaded Regular Networks

  • Ireneusz Szcześniak
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3042)


This paper presents an analytical methodology to obtain steady state throughput of a uniformly and fully loaded regular network. The network operates using deflection routing under the condition that a data packet is allowed to experience a finite number of deflections. Unlike the published analytical methods, the proposed method allows the analysis of a final number of deflections a packet can experience by means of harnessing polynomials in a novel way. The analytical results of the network throughput agree with the simulation results with relative error of 1% on average. The analysis is presented in the context of the shufflenet with the node connectivity of two. The largest network considered in the article has 896 nodes.


Deflection routing performance evaluation simulations. 


  1. 1.
    P. Green, “Progress in Optical Networking,” IEEE Commun. Mag., pp. 54–61, Jan. 2001.Google Scholar
  2. 2.
    L. Xu, H. G. Perros, G. Rouskas, “Techniques for Optical Packet Switching and Optical Burst Switching,” IEEE Commun. Mag., pp. 136–142, Jan. 2001.Google Scholar
  3. 3.
    J. T. Brassil, R. L. Cruz, “Bounds on Maximum Delay in Networks with Deflection Routing,” IEEE Transactions on Parallel and Distributed Systems, vol. 6, no. 7, pp. 724–732, July 1995.CrossRefGoogle Scholar
  4. 4.
    D. Barth, P. Berthomé, T. Czachórski, J. M. Fourneau, C. Laforest, S. Vial, “Mixed Deflection and Convergence Routing Algorithm: Design and Performance,” in Proc. Euro-Par 2002, pp. 767–774, Aug. 2002.CrossRefGoogle Scholar
  5. 5.
    A. S. Acampora, S. I. A. Shah, “Multihop Lightwave Networks: A Comparison of Store-and-Forward and Hot-Potato Routing,” IEEE Trans. Commun., vol. 40, pp. 1082–1090, June 1992.CrossRefGoogle Scholar
  6. 6.
    A. Bononi, P. R. Prucnal, “Analytical Evaluation of Improved Access Techniques in Deflection Routing Networks,” IEEE/ACM Trans. Networking, vol. 4, no. 5, pp. 726–730, Oct. 1996.CrossRefGoogle Scholar
  7. 7.
    A. Varga, “The OMNeT++ Discrete Event Simulation System,” in Proc. European Simulation Multiconference (ESM’2001), Prague, Czech Republic, June 2001.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Ireneusz Szcześniak
    • 1
  1. 1.Institute of Theoretical and Applied InformaticsPolish Academy of SciencesGliwicePoland

Personalised recommendations