Fast topological design with simulated annealing for multicast networks

This paper investigates topological designs for multicast networks using simulated annealing (SA) and proposes a new method for finding an effective initial solution to the problem of reducing the computational time of SA. Multicast communications can decrease network traffic due to branch connections. Accordingly, multicast services will be predominant in future traffic. Since the characteristics of multicast communications are quite different from those of unicast communications, it is necessary to find a suitable topology for future networks that accommodates both multicast and unicast services. Finding the optimal topology is generally known as an NP-hard problem, and so heuristic algorithms have been used in many cases. This paper optimizes the multicast network topology by simulated annealing, a well-known powerful heuristic. Even if SA were employed, however, more additional inventions would be required to compute and find the solution with the smallest possible number of iterations. Therefore, this paper proposes a method for finding an effective initial solution for SA. The results show that the computational time needed to reach the final solution becomes shorter if our proposed method is applied.

[1]  Takumi Miyoshi,et al.  Application of delta-star topology to multicast network , 2000 .

[2]  Walid Dabbous,et al.  Multipoint Communication: A Survey of Protocols, Functions, and Mechanisms , 1997, IEEE J. Sel. Areas Commun..

[3]  Yoshiaki Tanaka,et al.  Hierarchical structure of telecommunication network with independent transversal trunks , 1981 .

[4]  Deep Medhi.  Multi-hour, multi-traffic class network design for virtual path-based dynamically reconfigurable wide-area ATM networks , 1995, TNET.

[5]  O. J. Wasem,et al.  Forecasting broadband demand between geographic areas , 1995 .

[6]  Takumi Miyoshi,et al.  Optimal Topology Design of the Integrated Telecommunication and Broadcast Network , 1997 .

[7]  M. Niva,et al.  A multi-faceted approach to forecasting broadband demand and traffic , 1995, IEEE Commun. Mag..

[8]  Hwa-Chun Lin,et al.  VTDM-a dynamic multicast routing algorithm , 1998, Proceedings. IEEE INFOCOM '98, the Conference on Computer Communications. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Gateway to the 21st Century (Cat. No.98.

[9]  Takumi Miyoshi,et al.  Topological design comparison for multicast network , 1999, Seamless Interconnection for Universal Services. Global Telecommunications Conference. GLOBECOM'99. (Cat. No.99CH37042).

[10]  James P. G. Sterbenz,et al.  Networking Requirements for Interactive Video on Demand , 1995, IEEE J. Sel. Areas Commun..

[11]  K. Stordahl,et al.  Forecasting long-term demand for services in the residential market , 1995, IEEE Commun. Mag..

[12]  Takumi Miyoshi,et al.  Multicast routing in ATM network , 2000 .

[13]  Mario Gerla,et al.  Topology design and bandwidth allocation in ATM nets , 1989, IEEE J. Sel. Areas Commun..

[14]  Parviz Kermani,et al.  MENTOR: an algorithm for mesh network topological optimization and routing , 1991, IEEE Trans. Commun..

[15]  Yoshiaki Tanaka,et al.  Fast dynamic algorithm for storage allocation in telecommunication networks , 1995 .

[16]  Yoshiaki Tanaka,et al.  Constitution of wide area telephone network using optical fiber communication , 1986 .

[17]  Takumi Miyoshi,et al.  Optimal hierarchical structure of broadcast network , 1999 .

[18]  Moshe Sidi,et al.  Topological design of local area networks using genetic algorithms , 1995, Proceedings of INFOCOM'95.

[19]  Shivendra S. Panwar,et al.  Topological design of interconnected LAN-MAN networks , 1992, [Proceedings] IEEE INFOCOM '92: The Conference on Computer Communications.