東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Improving telecommunications network...

Southern Methodist University., Engineering Management, Information and Systems.

FindBook

Google Book

Amazon

博客來

Improving telecommunications network throughput by incremental demand routing.

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Improving telecommunications network throughput by incremental demand routing./
作者:	Rahman M., Tauhid.
面頁冊數:	145 p.
附註:	Adviser: Eli V. Olinick.
Contained By:	Dissertation Abstracts International69-03B.
標題:	Engineering, General. -
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3303952
ISBN:	9780549513322

Improving telecommunications network throughput by incremental demand routing.
Rahman M., Tauhid.

Improving telecommunications network throughput by incremental demand routing. - 145 p.

Adviser: Eli V. Olinick.

Thesis (D.E.)--Southern Methodist University, 2008.

This investigation addresses an important and difficult combinatorial optimization problem in the design and management of telecommunication systems known as the path assignment problem. In this problem, one is given a network with fixed link capacities and a list of point-to-point demands (origin-destination pairs), each with a set of candidate routing paths. A path assignment is said to be feasible if it meets the following two criteria. First, all traffic for a given origin-destination pair must be routed along (assigned to) exactly one of the paths available for that pair. Second, the total volume of traffic routed over any particular link must be within the given capacity limit. Given a network and a path assignment, the problem of interest is to maximize the available bandwidth (throughput) for a new demand. Network managers are concerned with the quality of service provided by their networks, and so they are reluctant to make major changes to an operating network that may inadvertently result in service disruptions for numerous clients simultaneously. Therefore, the objective of this investigation is to develop and test solution procedures that produce a series of throughput-improving modifications to the original path assignment. This allows network managers to implement the improved routing in stages with minimal changes to the overall routing plan between any two consecutive stages. Although the procedure may only reroute a few demands at each stage, the routing after the last stage should be as close as possible to an optimal routing. That is, it must maximize the throughput for the new demand. This investigation took three different approaches: path based models, node-arc models, and min-max path assignment models and all of them will optimize the network throughput. We present integer programming models and associated solution algorithms to maximize the throughput with a sequence of incremental path modifications. The different methodologies in this investigation were implemented with the AMPL modeling language and the CPLEX ILP solver, and tested on a family of five different data sets based on a European network widely studied in the literature. Empirical results show that the incremental approach finds near-optimal results within reasonable limits on CPU time.

ISBN: 9780549513322Subjects--Topical Terms:

1020744
Engineering, General.

Improving telecommunications network throughput by incremental demand routing.
LDR:03463nam 2200337 a 45 001 856740
005 20100709
008 100709s2008 ||||||||||||||||| ||eng d
020 $a 9780549513322
035 $a (UMI)AAI3303952
035 $a AAI3303952
040 $a UMI $c UMI
100 1 $a Rahman M., Tauhid. $3 1023598
245 1 0 $a Improving telecommunications network throughput by incremental demand routing.
300 $a 145 p.
500 $a Adviser: Eli V. Olinick.
500 $a Source: Dissertation Abstracts International, Volume: 69-03, Section: B, page: 1933.
502 $a Thesis (D.E.)--Southern Methodist University, 2008.
520 $a This investigation addresses an important and difficult combinatorial optimization problem in the design and management of telecommunication systems known as the path assignment problem. In this problem, one is given a network with fixed link capacities and a list of point-to-point demands (origin-destination pairs), each with a set of candidate routing paths. A path assignment is said to be feasible if it meets the following two criteria. First, all traffic for a given origin-destination pair must be routed along (assigned to) exactly one of the paths available for that pair. Second, the total volume of traffic routed over any particular link must be within the given capacity limit. Given a network and a path assignment, the problem of interest is to maximize the available bandwidth (throughput) for a new demand. Network managers are concerned with the quality of service provided by their networks, and so they are reluctant to make major changes to an operating network that may inadvertently result in service disruptions for numerous clients simultaneously. Therefore, the objective of this investigation is to develop and test solution procedures that produce a series of throughput-improving modifications to the original path assignment. This allows network managers to implement the improved routing in stages with minimal changes to the overall routing plan between any two consecutive stages. Although the procedure may only reroute a few demands at each stage, the routing after the last stage should be as close as possible to an optimal routing. That is, it must maximize the throughput for the new demand. This investigation took three different approaches: path based models, node-arc models, and min-max path assignment models and all of them will optimize the network throughput. We present integer programming models and associated solution algorithms to maximize the throughput with a sequence of incremental path modifications. The different methodologies in this investigation were implemented with the AMPL modeling language and the CPLEX ILP solver, and tested on a family of five different data sets based on a European network widely studied in the literature. Empirical results show that the incremental approach finds near-optimal results within reasonable limits on CPU time.
590 $a School code: 0210.
650 4 $a Engineering, General. $3 1020744
650 4 $a Operations Research. $3 626629
690 $a 0537
690 $a 0796
710 2 $a Southern Methodist University. $b Engineering Management, Information and Systems. $3 1023597
773 0 $t Dissertation Abstracts International $g 69-03B.
790 $a 0210
790 1 0 $a Allen, J. D. $e committee member
790 1 0 $a Barr, Richard S. $e committee member
790 1 0 $a Helgason, Richard V. $e committee member
790 1 0 $a Kennington, Jeffery L. $e committee member
790 1 0 $a Olinick, Eli V. $e committee member
790 1 0 $a Olinick, Eli V., $e advisor
791 $a D.E.
792 $a 2008
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3303952