National Changhua University of Education Institutional Repository : Item 987654321/9936

English | 正體中文 | 简体中文 | Items with full text/Total items : 6507/11669
Visitors : 29933680 Online Users : 427

RC Version 3.2 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.

Scope Adv. Search

Login ‧ Upload ‧ Help ‧ About ‧ Administer

NCUEIR > College of Engineering > Department and Graduate Institute of Computer Science and Information Engineering > Periodical Articles > Item 987654321/9936

Please use this identifier to cite or link to this item: http://ir.ncue.edu.tw/ir/handle/987654321/9936

Title:	A Heuristic Algorithm for Solving Network Expanded Problem on Wireless ATM Environment
Authors:	Din, Der-Rong
Contributors:	資訊工程系
Keywords:	Heuristic algorithm;Wireless ATM;Network expanded problem;Cell assignment problem;Cell splitting
Date:	2007-08
Issue Date:	2012-04-30T04:32:28Z
Publisher:	Springer-Verlag Berlin, Heidelberg
Abstract:	In this paper, the network expanded problem (NEP) which optimally assigns new adding and splitting cells in PCS (Personal Communication Service) network to switches in an ATM (Asynchronous Transfer Mode) network is studied. In NEP, the locations of all cells (or Base Station, BS) in PCS network are fixed and known, but new switches should be installed to ATM network and the topology of the backbone network may be changed. Given some potential sites of new switches, the problem is to determine how many switches should be added to the backbone network, the locations of new switches, the topology of the new backbone network, and the assignments of new adding and splitting cells in the PCS to switches on the new ATM backbone network in an optimum manner. The goal is to do the expansion in as attempt to minimize the total communication cost under budget and capacity constraints. The NEP is modeled as a complex integer programming problem and finding an optimal solution to this problem is NP-hard. A heuristic algorithm is proposed to solve this problem. The proposed heuristic algorithm consists of four phases: Remaining Capacities Pre-assigning Phase (RCPP), Cell Clustering Phase (CCP), Switch Selection Phase (SSP), and Backbone Design Phase (BDP). Experimental results indicate that the proposed algorithm can find good solution.
Relation:	Lecture Notes in Computer Science (LNCS) , 4705: 846-859
Appears in Collections:	[Department and Graduate Institute of Computer Science and Information Engineering] Periodical Articles

Files in This Item:

File	Size	Format
2050400110008.pdf.pdf	13Kb	Adobe PDF	468	View/Open

Loading...