Skip to main content
Log in

A traffic partition algorithm for switched LANs and its performance analysis

  • Published:
Journal of Computer Science and Technology Aims and scope Submit manuscript

Abstract

An algorithm is proposed which can be used for the topology design of switched LAN with heavy traffic and multi-segments. The main principle of the algorithm is to split the whole traffic to segments as even as possible. The algorithm consists of binary division and ordinary division. When the number of segments equals to powers of 2, binary division is used; ordinary division is based on binary division but suitable to more common cases. Both correctness and time complexity of the algorithm are discussed in detail, and a comparison of the algorithm with the best result is given at the same time.

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

Access this article

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. Robert Mandeville. Ethernet switched evaluated.DATA COMMUNICATION, McGRAW-HILL’S NETWORKING TECHNOLOGY MAGAZINE, March 1994.

  2. Bradley F Shimmin. Comparing three methods of ethernets switching.LAN TIMES, McGRAW-HILL’S INFORMATION SOURCE FOR NETWORK COMPUTING, 1994, 11(1).

  3. Kuratowski K, Mostowski A. Set Theory. North-Holland, New York, 1976.

    MATH  Google Scholar 

  4. Leblane L J, Narasimhan S. Topological expansion of metropolitan area network.Computer Network and ISDN System, 1994, 26(9): 1235–1284.

    Article  Google Scholar 

  5. Saito H, Asaka T. Traffic aspect of personal telecommunications in intelligent network.Computer Networks and ISDN Systems, 26(9): 1089–1100.

Download references

Author information

Authors and Affiliations

Authors

Additional information

The work is supported by the Jiangsu provincial key laboratory of Computer Network Technology.

Ding Wei is an Associate Professor. She received her Ph.D. degree from the Department of Computer Science and Engineering, Southeast University in 1995. Now, her research work concentrates on the topology design of computer network and information discovery in largescale network.

Gong Jian received his Ph.D. degree from the Department of Computer Science and Engineering, Southeast University in 1995. He has been a Profesor of Computer Science and Engineering Department, Southeast University since 1996, member of Technical Board of CERNET since 1994. His research interests include network management, network security, network engineering.

Yu Xiao received her degree fo Bachelor from the Department of Computer Science and Engineering of Southeast University in 1995. Her research centers on network information service.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Wei, D., Jian, G. & Xiao, Y. A traffic partition algorithm for switched LANs and its performance analysis. J. of Comput. Sci. & Technol. 13, 261–267 (1998). https://doi.org/10.1007/BF02943194

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02943194

Keywords

Navigation