Pii: S0140-3664(98)00238-2
نویسندگان
چکیده
This article presents a systemic method to generate and map an optimal virtual topology onto a certain physical wide area optical fiber network so as to maximize the scaleup which provides an estimate of the network throughput. The problem is to find the best possible virtual topology over a given wavelength-routed all-optical physical topology for wide area coverage. The physical topology consists of wavelength-routing nodes interconnected by fiber links in the network. The virtual topology consists of a set of lightpaths. For a given physical topology and traffic matrix, our objective is to maximize the throughput as well as to minimize the delay. We have also studied the scalability of various parameters, such as queuing delay, propagation delay and average-hop-distance, with increase in throughput. We present a heuristic algorithm for embedding a virtual topology to the given physical fiber network when the number of wavelength channels supported on each fiber is limited. A number of feasible virtual topologies are generated randomly using Prufer number method, and the optimum one is selected. The problem being computationally intractable, we use genetic algorithm (GA)for optimization. As GAs are expected to converge to globally optimal solutions, the proposed approach yields better solutions than previous ones. As a result of immense practical importance of the issues addressed in this work, the algorithms are expected to be significant for practitioners. q 1999 Elsevier Science B.V. All rights reserved.
منابع مشابه
IPv6 over ATM flow-handling
This paper explores the ways to obtain high capacity allocation in the backbone network. IPv6 offers new possibilities for IP over ATM signalling.
متن کاملEvolutionary approach to optimize the assignment of cells to switches in personal communication networks
This paper proposes an evolutionary approach to solve the problem of assigning cells to switches in the planning phase of mobile cellular networks. Well-known in the literature as an NP-hard combinatorial optimization problem, this problem requires the recourse to heuristic methods, which can practically lead to good feasible solutions, not necessarily optimal, the objective being rather to red...
متن کاملThe impact of routing on multicast error recovery
We investigate the relationship between multicast routing algorithms and reliable multicast communication. To capture the impact of the multicast tree topology onto reliable multicast, we consider two performance measures, namely the probability mass function of successful receptions and the expected number of retransmissions needed to successfully deliver a packet from the source to all receiv...
متن کاملA new distributed routing algorithm for supporting delay-sensitive applications
We propose a new distributed delay-constrained unicast routing algorithm which can always nd a delay-constrained path with small message complexity if such a path exists. At each network node, limited information about the network state is needed and only a small amount of computation is required. Simulation results show that the proposed algorithm has much better cost performance than the leas...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999