首页> 外文学位 >Characterization and control of network traffic: From hours to nanoseconds.
【24h】

Characterization and control of network traffic: From hours to nanoseconds.

机译:网络流量的表征和控制:从几小时到十亿分之一秒。

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

摘要

This thesis covers the challenges faced by network operators and network users either individually or jointly on different timescales. In the first part of the thesis, we investigate the interaction between traffic engineering and TCP. In the network layer, a network operator directly controls the traffic via traffic engineering and indirectly influences the user offered traffic via feedback signals. In the transport layer, users send traffic into the network using the TCP protocol, which adjusts offered traffic according to the received feedback. We investigate how current traffic engineering practice interact with congestion control under the network utility maximization framework. We show that the current interaction is stable, increases network utility, but does not necessarily improve the traffic engineering objective. To jointly optimize the non-convex congestion control and multipath routing problem, we note the mismatch in incentive and take on a more holistic view using game theory. With change of variables, we obtain an equivalent convex optimization problem and with suitable modification of the feedback, we show that the interaction converges to the globally optimal solution of the equivalent convex problem for users running either primal or dual algorithms. We further show that the results hold even when traffic engineering is performed at any irregular intervals. More generally, we show via heterogeneous feedback the same optimality result for a mix of users running primal and dual algorithms.;In the second part of the thesis, we first lay down the framework of network traffic dynamics by specifying the governing equations for the time evolutions, dynamics and associated delays of the network elements. We next specialize the framework to study how a centrally controlled network could reconfigure its routing as quickly as possible while not incurring any congestion. As switches may update at different times and update to different traffic flows take different times to propagate through the network, transient congestion could occur when links contain a mix of traffic flows following old and new routing configurations. Using propagation delay information from the framework and incorporating timing uncertainty, we figure out which congestion scenario could occur and how long it would take any update to properly propagate through the network. We formulate a mixed-integer linear program to find fast congestion-free routing reconfiguration using timing information. We explore how we could fasten the update process as we do not have to wait for an update to fully propagate through the network. For heavily congested network, we show a fast update solution by trading off the minimal amount of traffic demand. Experiments on Mininet verify our approach and show that it outperforms prior method with no timing information.;In the final part, we investigate router's inherent variation on packet processing time and its effect on interpacket delay and packet clustering. We propose a simple pipeline model incorporating the inherent variation, and two metrics, one to measure packet clustering and one to quantify inherent variation. To isolate the effect of the inherent variation, we begin our analysis with no cross traffic and step through setups where the input streams have different data rate, packet size and go through different number of hops. We show that a homogeneous input stream with a sufficiently large interpacket gap will emerge at the router's output with interpacket delays that are negatively correlated with adjacent values and have symmetrical distributions. For an input with smaller interpacket gap, the change in packet clustering is smaller while for a more clustered input, the change is also smaller and could actually go negative. We generalize our results by adding cross traffic and show how the understanding gained could be applied to engineer traffic with minimal jitter. The model analysis is validated with experiments using SoNIC, a highly precise instrument providing real-time access to the physical layer.
机译:本文涵盖了网络运营商和网络用户在不同时间尺度上单独或共同面临的挑战。在论文的第一部分,我们研究了流量工程和TCP之间的相互作用。在网络层中,网络运营商通过流量工程直接控制流量,并通过反馈信号间接影响用户提供的流量。在传输层中,用户使用TCP协议将流量发送到网络中,该协议根据收到的反馈调整提供的流量。我们调查当前的流量工程实践如何与网络实用程序最大化框架下的拥塞控制相互作用。我们表明,当前的交互是稳定的,可以增加网络实用性,但不一定能提高流量工程的目标。为了共同优化非凸拥塞控制和多径路由问题,我们注意到了激励的不匹配,并使用博弈论采取了更为整体的观点。随着变量的变化,我们获得了一个等价的凸优化问题,并且对反馈进行了适当的修改,我们表明对于运行原始算法或对偶算法的用户,交互作用收敛到该等价凸问题的全局最优解。我们进一步表明,即使以任何不规则间隔执行流量工程,结果仍然成立。更笼统地说,我们通过异构反馈显示了混合使用原始算法和双重算法的用户的相同最优结果。在本文的第二部分,我们首先通过指定时间的控制方程式来建立网络流量动态框架。网络元素的演进,动态和相关的延迟。接下来,我们将专门研究该框架,以研究集中控制的网络如何在不引起任何拥塞的情况下尽快重新配置其路由。由于交换机可能会在不同的时间进行更新,并且更新到不同的流量会花费不同的时间在网络中传播,因此当链路包含遵循新旧路由配置的流量混合时,可能会发生短暂的拥塞。使用来自框架的传播延迟信息并结合时序不确定性,我们可以确定可能发生哪种拥塞情况,以及任何更新需要多长时间才能正确地通过网络传播。我们制定了一个混合整数线性程序,以使用时序信息找到快速无拥塞的路由重新配置。我们探索了如何加快更新过程,因为我们不必等待更新完全通过网络传播。对于严重拥塞的网络,我们展示了一种通过权衡最小流量需求的快速更新解决方案。在Mininet上进行的实验验证了我们的方法,并证明了它在没有时序信息的情况下优于以前的方法。最后,我们研究了路由器对数据包处理时间的内在变化及其对数据包间延迟和数据包聚类的影响。我们提出了一个简单的流水线模型,其中包含固有变化和两个度量,一个度量度量数据包聚类,另一个度量量化固有变化。为了隔离固有变化的影响,我们从无交叉流量开始分析,并逐步进行设置,在这些设置中,输入流具有不同的数据速率,数据包大小并经过不同的跳数。我们表明,具有足够大的数据包间间隙的同质输入流将出现在路由器的输出处,而数据包间的延迟与相邻值负相关,并且具有对称的分布。对于数据包间间隙较小的输入,数据包群集的更改较小,而对于群集较大的输入,该更改也较小,并且实际上可能为负。我们通过添加交叉流量来概括我们的结果,并说明如何将获得的理解应用于抖动最小的工程流量。该模型分析已通过使用SoNIC(一种提供对物理层的实时访问的高精度仪器)的实验进行了验证。

著录项

  • 作者

    Lim, Chiun Lin.;

  • 作者单位

    Cornell University.;

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

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号