首页> 外文学位 >Network Design in the Big-Data Age.
【24h】

Network Design in the Big-Data Age.

机译:大数据时代的网络设计。

获取原文
获取原文并翻译 | 示例

摘要

Today's computing systems are in the midst of a transformation driven by proliferation of big data. Explosive growth in data-driven applications is creating unprecedented demands on communication networks. From large data centers to smartphones and tablets, networking infrastructures are struggling to keep up with both the volume of data and the complexity of protocols needed for timely and reliable data delivery. Traditional approaches to network design and management allocate network resources in a static and long-term manner. They are simply unable to handle today's massive and dynamic traffic loads.;In this dissertation, we develop new methods to design networks capable of handling the volume and unpredictable dynamics of today's data traffic. We add aspects of flexibility into existing network designs so that each network entity can obtain resources on the fly based on current needs. Following this principle, we address several high-impact problems related to big data.;Our first research area is supporting distributed computing applications in data centers, which requires timely and reliable delivery of massive data across network entities. This is highly challenging in today's data centers that deploy wired networks with a fixed amount of fiber to each network rack. Once deployed, wired networks are extremely expensive and time consuming to modify or update. This static bandwidth provisioning falls short when dealing with massive, dynamic traffic, and leads to congestion losses and application downtime. We tackle this problem by using flexible wireless links to augment (or even replace) wired networks. We are the first to identify the fundamental challenges of using wireless links in data centers, and we overcome these challenges using a new wireless primitive called 3D beamforming (bouncing 60GHz beam off the ceiling). Our solution is simple, and yet highly effective. It significantly extends wireless transmission range while reducing interference footprint. Using 3D beamforming links, we demonstrate their efficacy by building robust data and control planes to handle massive and unpredictable traffic patterns.;Our second research area focuses on spectrum management in wireless networks. For all wireless transmissions to succeed, they must obtain an adequate amount of spectrum. Historical management policies regulate spectrum statically via long-term national auctions. These traditional auctions are unable to distribute spectrum for fine-grained use (local and short-term use). Therefore they lead to highly inefficient use of spectrum, and create an artificial spectrum scarcity problem. We address this problem by building a much more flexible auction format akin to the eBay marketplace. It dynamically distributes spectrum to users based on their current demands. We are the first to show that existing mechanism designs fail in dynamic spectrum auctions because of the presence of wireless interference. We overcome these challenges by designing new dynamic spectrum auctions that allocate spectrum efficiently while achieving desired economic properties, such as resistance to different types of bidder cheating and collusion.;Finally, our research also demonstrates how big data can be used to implement new network designs in practice. To deploy dynamic spectrum auctions, we need to characterize interference conditions accurately across a large number of bidders. Using extensive network measurements, we perform the first empirical study to evaluate the usability of conflict graphs, the most widely used interference model. We study key issues long considered by the wireless community to be serious limitations of this model, and propose techniques to overcome them. Our results validate the usability of conflict graphs for dynamic spectrum auctions as well as general wireless networks. Furthermore, our work offers an efficient online solution to construct conflict graphs on the fly, thus enabling real-time dynamic spectrum auctions across a large number of users.;In summary, our work demonstrates that to support massive and highly dynamic traffic in the big-data age, network design must embed flexibility as a key element. Our research has tackled important problems in data centers and wireless networks, and the same design principle is applicable to a wide range of networking systems.
机译:当今的计算系统正处于由大数据扩散驱动的转型之中。数据驱动的应用程序的爆炸性增长对通信网络提出了前所未有的要求。从大型数据中心到智能手机和平板电脑,网络基础设施都在努力跟上及时可靠数据交付所需的数据量和协议的复杂性。传统的网络设计和管理方法以静态和长期的方式分配网络资源。他们根本无法应付当今的庞大而动态的流量负载。本文中,我们开发了新的方法来设计能够处理当今数据流量的数量和不可预测的动态变化的网络。我们在现有的网络设计中增加了灵活性,以便每个网络实体都可以根据当前需求即时获取资源。遵循这一原则,我们解决了与大数据有关的几个高影响力问题。我们的第一个研究领域是支持数据中心中的分布式计算应用程序,这要求在网络实体之间及时可靠地交付海量数据。在当今的数据中心中,将固定数量的光纤部署到每个网络机架的有线网络具有很高的挑战性。部署后,有线网络非常昂贵,修改或更新非常耗时。当处理大量动态流量时,此静态带宽设置不足,并导致拥塞损失和应用程序停机。我们通过使用灵活的无线链接来扩展(甚至替换)有线网络来解决此问题。我们是第一个确定在数据中心中使用无线链路的基本挑战的人,并且我们使用一种称为3D波束成形(将60GHz波束从天花板反弹)的新无线原语来克服这些挑战。我们的解决方案很简单,但是非常有效。它显着扩展了无线传输范围,同时减少了干扰足迹。使用3D波束成形链接,我们通过构建健壮的数据和控制平面来处理庞大且不可预测的流量模式来证明其功效。我们的第二个研究领域集中在无线网络中的频谱管理。为了使所有无线传输成功,它们必须获得足够数量的频谱。历史管理政策通过长期的全国拍卖静态地调节频谱。这些传统拍卖无法分配频谱用于细粒度用途(本地和短期用途)。因此,它们导致频谱使用效率极低,并造成人为的频谱稀缺问题。我们通过建立类似于eBay市场的更加灵活的拍卖形式来解决此问题。它根据用户当前的需求向用户动态分配频谱。我们是第一个证明由于无线干扰的存在,现有机制设计在动态频谱拍卖中失败的例子。我们通过设计新的动态频谱拍卖来克服这些挑战,这些拍卖可以有效地分配频谱,同时实现所需的经济属性,例如抵抗不同类型的投标人作弊和串通。最后,我们的研究还证明了如何使用大数据来实现新的网络设计在实践中。要部署动态频谱拍卖,我们需要准确描述大量竞标者的干扰条件。通过广泛的网络测量,我们进行了第一项实证研究,以评估冲突图(使用最广泛的干扰模型)的可用性。我们研究了无线社区长期以来认为是该模型的严重局限性的关键问题,并提出了克服这些问题的技术。我们的结果验证了冲突图在动态频谱拍卖以及一般无线网络中的可用性。此外,我们的工作提供了一种有效的在线解决方案,可以动态地构建冲突图,从而可以在大量用户中进行实时动态频谱拍卖。总而言之,我们的工作表明,该技术可支持大型,大规模和高动态流量数据时代,网络设计必须将灵活性作为关键要素。我们的研究解决了数据中心和无线网络中的重要问题,并且相同的设计原理适用于广泛的网络系统。

著录项

  • 作者

    Zhou, Xia.;

  • 作者单位

    University of California, Santa Barbara.;

  • 授予单位 University of California, Santa Barbara.;
  • 学科 Computer Science.
  • 学位 Ph.D.
  • 年度 2013
  • 页码 273 p.
  • 总页数 273
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类
  • 关键词

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号