東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Cross-layer resource allocation algo...

Birand, Berk.

FindBook

Google Book

Amazon

博客來

Cross-layer resource allocation algorithms in wireless and optical networks.

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Cross-layer resource allocation algorithms in wireless and optical networks./
作者:	Birand, Berk.
面頁冊數:	180 p.
附註:	Source: Dissertation Abstracts International, Volume: 76-08(E), Section: B.
Contained By:	Dissertation Abstracts International76-08B(E).
標題:	Computer Science. -
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3688032
ISBN:	9781321661507

Cross-layer resource allocation algorithms in wireless and optical networks.
Birand, Berk.

Cross-layer resource allocation algorithms in wireless and optical networks. - 180 p.

Source: Dissertation Abstracts International, Volume: 76-08(E), Section: B.

Thesis (Ph.D.)--Columbia University, 2015.

This item must not be sold to any third party vendors.

The success of the Internet can be largely attributed to its modular architecture and its high level of abstraction. As a result, the Internet is an extremely heterogeneous network in which a multitude of wireless, electronic, and optical devices coexist. Yet, wireless and optical technologies are approaching their capacity limits. In this thesis, we study cross-layer and cross-domain optimizations in wireless and optical networks to improve the scalability of heterogeneous networks. Specifically, we investigate the benefits in capacity improvement and energy efficiency of improved interaction between different layers, as well as different domains.

ISBN: 9781321661507Subjects--Topical Terms:

626642
Computer Science.

Cross-layer resource allocation algorithms in wireless and optical networks.
LDR:03647nmm a2200349 4500 001 2057425
005 20150610074918.5
008 170521s2015 ||||||||||||||||| ||eng d
020 $a 9781321661507
035 $a (MiAaPQ)AAI3688032
035 $a AAI3688032
040 $a MiAaPQ $c MiAaPQ
100 1 $a Birand, Berk. $3 3171264
245 1 0 $a Cross-layer resource allocation algorithms in wireless and optical networks.
300 $a 180 p.
500 $a Source: Dissertation Abstracts International, Volume: 76-08(E), Section: B.
500 $a Adviser: Gil Zussman.
502 $a Thesis (Ph.D.)--Columbia University, 2015.
506 $a This item must not be sold to any third party vendors.
520 $a The success of the Internet can be largely attributed to its modular architecture and its high level of abstraction. As a result, the Internet is an extremely heterogeneous network in which a multitude of wireless, electronic, and optical devices coexist. Yet, wireless and optical technologies are approaching their capacity limits. In this thesis, we study cross-layer and cross-domain optimizations in wireless and optical networks to improve the scalability of heterogeneous networks. Specifically, we investigate the benefits in capacity improvement and energy efficiency of improved interaction between different layers, as well as different domains.
520 $a First, we use the Local Pooling (LoP) conditions to identify all the network graphs under primary interference constraints in which Greedy Maximal Scheduling (GMS) achieves 100% throughput. In addition, we show that in all bipartite graphs of size up to 7 x n, GMS is guaranteed to achieve 66% throughput. Finally, we study the performance of GMS in interference graphs and show that it can perform arbitrarily bad.
520 $a We study the properties of evolving graphs of networks whose structure changes due to node mobility. We present several graph metrics that quantify change in an evolving graph sequence and apply these metrics to several sources of mobility. We relate our results on the effect of the rate of graph change to the performance of higher-layer network algorithms in dynamic networks.
520 $a We then consider optical networks, and formulate a global optimization problem that captures the QoT constraints in future dynamic optical networks. We design a power control algorithm for solving this problem by using feedback from Optical Performance Monitors (OPMs). We evaluate this algorithm via extensive simulations on a network-scale optical network simulator, as well as experiments with commercial optical network equipment.
520 $a Finally, we consider a cellular network with Coordinated Multi-Point (CoMP) Joint Transmission (JT) capabilities that allow multiple BSs to transmit simultaneously to a single user. We formulate the OFDMA Joint Scheduling (OJS) problem of determining a subframe schedule and deciding if to use JT, and we prove hardness results for this problem. Based on a decomposition framework, we develop efficient scheduling algorithms for bipartite and series-parallel planar graphs, and approximation algorithms for general graphs. We then consider a queueing model that evolves over time, and prove that solving the OJS problem with a specific queue-based utility function (in every subframe) achieves maximum throughput in CoMP-enabled networks.
590 $a School code: 0054.
650 4 $a Computer Science. $3 626642
650 4 $a Information Technology. $3 1030799
650 4 $a Engineering, Electronics and Electrical. $3 626636
690 $a 0984
690 $a 0489
690 $a 0544
710 2 $a Columbia University. $b Electrical Engineering. $3 1675652
773 0 $t Dissertation Abstracts International $g 76-08B(E).
790 $a 0054
791 $a Ph.D.
792 $a 2015
793 $a English
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3688032