A lower bound for the average number of hops in communication networks with circulant topologies of arbitrary degree

• Autorzy: Bziuk W.
• Języki publikacji: EN

Abstrakty

EN

A fast computable analytical lower bound for the average number of hops (ANH) in circulant topologies is presented. Assuming uniform traffic, it only depends on the node degree and number of nodes and is applicable to the design of networks utilizing paths of minimum number of hops. The case where the traffic volume depends on the shortest number of hops between a pair of nodes is also considered. Numerical results show that circulants do have a great variation in their ANH and that the lower bound is almost exact or close to the minimum ANH.

Słowa kluczowe

EN

topological design; circulants; average number of hops

• Wydawca: Oficyna Wydawnicza Politechniki Wrocławskiej
• Czasopismo: Systems Science
• Rocznik: 2006
• Tom: Vol. 32, no 3
• Strony: 97--101
• Opis fizyczny: Bibliogr. 6 poz., wykr.

Twórcy

autor

Bziuk W.

• Institute of Computer and Communication Network Engineering, Technical University of Braunschweig, Hans-Sommer Srasse 66, 38106 Braunschweig, Germany,

Bibliografia

• [1] Boesch F.T., Wang J., Reliable Circulant Networks with Minimum Transmission Delay. IEEE Tans. Circuits and Systems, Vol. 32, 1972, pp. 1286-1291.
• [2] Buckley F., Harary P., Distance in Graphs, Addison-Wesley. New York, 1990.
• [3] Hartmann H.L., High Throughput Transport Networks: Past Operational Engineering and Routing of Facility Rings. Proc. 8th Int. Telecom. Network Planning Symp., Sorrento, October 1998, pp. 353-358.
• [4] Herzberg M. et. al., Optimal Resource Allocation for Path Restoration in Mesh-Type Self-Healing Networks, ITC 15, 1997, pp. 351-360.
• [5] Kleinrock L., Communication Nets - Stochastic Message Flow and Delay. Dover Publication, New York, 1972.
• [6] Riordan J., Combinatorial Identities, John Wiley, New York, 1968.