• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文学位 >Cross-layer resource allocation algorithms in wireless and optical networks.
【24h】

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

机译：无线和光网络中的跨层资源分配算法。

获取原文
获取原文并翻译 | 示例
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

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.;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.;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.;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.;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.
机译：互联网的成功很大程度上可以归功于其模块化架构和高度的抽象性。结果，互联网是一种极其异构的网络，其中大量的无线，电子和光学设备共存。然而，无线和光学技术正在接近其容量极限。本文研究无线和光网络中的跨层和跨域优化，以提高异构网络的可扩展性。具体来说，我们调查了不同层之间以及不同域之间改进的交互在容量提高和能源效率方面的好处。首先，我们使用本地池（LoP）条件来识别主要干扰约束下所有网络图，其中贪婪最大调度（GMS）可实现100％的吞吐量。此外，我们证明，在所有尺寸最大为7 x n的二部图中，GMS都可以保证实现66％的吞吐量。最后，我们在干涉图中研究了GMS的性能，并证明了它的性能是任意的。；我们研究了由于节点移动性而导致结构变化的网络演化图的性质。我们提出了几种图形指标，这些指标可以量化不断变化的图形序列中的变化，并将这些指标应用于多种移动性来源。我们将结果对图变化率的影响与动态网络中更高层网络算法的性能联系起来;然后考虑光网络，并提出一个全局优化问题，以捕获未来动态光网络中的QoT约束。我们设计了一种功率控制算法，用于通过使用光学性能监视器（OPM）的反馈来解决此问题。我们通过在网络规模的光网络仿真器上进行广泛的仿真以及商用光网络设备的实验来评估该算法。最后，我们考虑具有协作多点（CoMP）联合传输（JT）功能的蜂窝网络多个BS同时发送给单个用户。我们提出了确定子帧调度并决定是否使用JT的OFDMA联合调度（OJS）问题，并证明了该问题的硬度结果。在分解框架的基础上，我们开发了针对二部和串并联平面图的高效调度算法，以及针对一般图的近似算法。然后，我们考虑一个随时间演变的排队模型，并证明使用特定的基于队列的实用程序功能（在每个子帧中）解决OJS问题可在启用CoMP的网络中实现最大吞吐量。

著录项

  • 作者

    Birand, Berk.;

  • 作者单位

    Columbia University.;

  • 授予单位 Columbia University.;
  • 学科 Computer Science.;Information Technology.;Engineering Electronics and Electrical.
  • 学位 Ph.D.
  • 年度 2015
  • 页码 180 p.
  • 总页数 180
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类
  • 关键词

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号