An application of genetic algorithm to hierarchical configuration of ATM internetworking domain with a special constraint for scalable broadcasting

Authors:
Dohoon Kim
Affiliations:
School of Business, Kyung Hee University, Dongdaemoon-gu Seoul, Korea
Venue:
IEA/AIE'2003 Proceedings of the 16th international conference on Developments in applied artificial intelligence
Year:
2003

Citing 7
Cited 0

The partition problem

Mathematical Programming: Series A and B
Min-cut clustering

Mathematical Programming: Series A and B
The node capacitated graph partitioning problem: a computational study

Mathematical Programming: Series A and B - Special issue on computational integer programming
Practical genetic algorithms

Practical genetic algorithms
ATM Theory and Applications

ATM Theory and Applications
Genetic Algorithm and Graph Partitioning

IEEE Transactions on Computers
ATM LAN emulation

IEEE Communications Magazine

Quantified Score

Hi-index	0.00

Visualization

Abstract

Presented is a Genetic Algorithm(GA) for dynamic partitioning of an ATM internetworking domain such as LANE(LAN Emulation) that provides guaranteed quality of service for mid-size campus or enterprise networks. There are few researches on the efficient LANE network operations to deal with scalability issues arising from multi-media broadcasting, limiting its potential in multimedia applications. To cope with the scalability issue here, proposed is a decision model named LANE Partitioning Problem(LPP) which aims at partitioning the entire LANE network into multiple virtual LANs. We also demonstrate with some experiments that compared with the current rule-of-thumb practice, the suggested LPP decision model and GA-based solution method significantly enhances performance, thereby providing good scalability in a large internetworking environment such as ATM LANE and mobile ATM LAN.