H. Pan, I.Y. Wang, The bandwidth allocation of ATM through Genetic Algorithm, Globecom'91, vol. 1, pp. 125-129, 1991.  Home/Search   Document Not in Database   Summary   Related Articles   Check

.... that natural evolution, as reported, can provide an attractive paradigm for implementing general nonlinear searches [13] 14] Due to the broad applicability of GA techniques, a broad application domain exists in solving Telecommunication network problems [15] 16] Application examples include [17], 18] 19] 20] 21] 22] 23] 24] 25] Elbaum et al. [24] use a GA to design the topology of Local Area Networks (LANs) and Ko et al. [25] design Mesh Networks. Shimamoto et al. [18] consider call blocking probability as a network constraint and apply GAs for network routing. Not many ....

....the topology of Local Area Networks (LANs) and Ko et al. [25] design Mesh Networks. Shimamoto et al. [18] consider call blocking probability as a network constraint and apply GAs for network routing. Not many studies address aggregated bandwidth allocation. Some notable examples follow. Pan and Wang [17] code the traffic distribution to represent each chromosome, and use the average delay, derived from an M M 1 queueing model, as an optimisation constraint to maximise bandwidth allocation. Taterdtid et al. [19] 20] address the network configuration problem (i.e obtain best path for each ....

H. Pan, I.Y. Wang, The bandwidth allocation of ATM through Genetic Algorithm, Globecom'91, vol. 1, pp. 125-129, 1991.

....is on providing survivability for a military network. 2 EC for telecommunications routing Over the years, more than 30 papers have been published on the application of evolutionary computation (EC) to telecommunications routing. Four of the earliest papers are by Cox et al. 1, 2] Pan Wang [3] and Sinclair [4] In 1991, Cox et al. 1] used a permutation based GA for the bandwidthpacking component of an heuristic for dynamic anticipatory routing in circuit switched networks. Two years later, almost the same group of authors [2] tackled both minimumcost link capacity assignment and ....

....and routing in a network subject to a reliability constraint. They employed a hybrid GA, with three part chromosomes representing both link capacities and routing permutations, a chromosome repair mechanism, a stochastic Lamarckian replacement technique and problem specific operators. Pan Wang [3], also in 1991, used a GA for minimum delay bandwidth allocation, i.e. link capacity assignment and routing, in an ATM network. Their GA encodes individuals as a string of indices into a combined look up table of both link capacities and routes. Then Sinclair [4] in 1993, applied a bit string ....

Pan, H. & Wang, I.Y. The bandwidth allocation of ATM through genetic algorithms, IEEE Global Telecom. Conf. (GLOBECOM'91), 1:125--129, 1991.

No context found.

H. Pan, I.Y. Wang, The bandwidth allocation of ATM through Genetic Algorithm, Globecom'91, vol. 1, pp. 125-129, 1991.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC