域间流量工程研究综述

作为主要的运行网络性能优化技术，流量工程（Traffic Engineering，TE）已经在由单个服务提供商ISP管理的Internet的自治域之内得到了实际和广泛的应用．但是如何在自治域之间应用流量工程技术以改善整个Internet的性能，目前还没有形成系统完整的解决方案和实施规范．本文全面综述了当前Internet域间流量工程技术的研究进展．首先简单介绍了域内流量工程的方案，总结了域问流量工程领域研究的主要难点问题．重点介绍了目前域间流量工程的主要解决方案，包括基于传统路由协议BGP的方案和基于MPLS的方案，讨论了这两种方案各自的优缺点．最后讨论了可能的进一步研究方向．     

可视化域间路由建模语言

提出一种可视化域间路由建模语言。该建模语言能够对大规模复杂自治系统内部域间路由的扩展结构、自治系统之间的关系以及域间路由策略进行可视化建模。可在不同层次上,从不同的角度对域间路由建立多种抽象粒度不同的模型,进而可使设计人员以及网络管理人员更好地理解大规模自治系统的结构和域间路由的行为特征。为高效地设计、实施以及管理自治系统的域间路由结构和路由策略配置,提供强有力的支持,也为域间路由管理的智能化、自动化打下了坚实的基础。     

域间路由策略的协同管理问题

互联网由多个自治域互联组成,自治域之间按照各自的域间路由策略交换路由信息和转发流量。由于管理自治域的ISP各自为政,独立配置和管理自己的路由策略,缺少协同机制,容易引起路由震荡、热土豆路由、异常路由等问题。本文提倡采用协同的方式管理域间路由策略,通过列举一些典型的域间路由策略问题,提出一套域间路由策略的多方协同控制与管理体系,并重点讨论了协同管理的基础性问题--安全比较协议。该协议可以被应用在互联网域间路由策略的管理中,对于分布式故障检测、分布式网络性能能测量等相关应用,也具有较好的参考价值。     

基于区块链的域间路由策略符合性验证方法

域间路由系统自治域(ASes)间具有不同的商业关系和路由策略.违反自治域间出站策略协定的路由传播可能引发路由泄露,进而导致网络中断、流量窃听、链路过载等严重后果.路由策略符合性验证对于保证域间路由系统安全性和稳定性至关重要.但自治域对本地路由策略自主配置与隐私保护的双重需求增加了验证路由策略符合性的难度,使其一直是域间路由安全领域尚未妥善解决的难点问题.提出一种基于区块链的域间路由策略符合性验证方法.该方法以区块链和密码学技术作为信任背书,使自治域能够以安全和隐私的方式发布、交互、验证和执行路由策略期望,通过生成对应路由更新的路由证明,保证路由传播过程的真实性,从而以多方协同的方式完成路由策略符合性验证.通过实现原型系统并基于真实路由数据开展实验与分析,结果表明该方法可以在不泄露自治域商业关系和本地路由策略的前提下针对路由传播出站策略符合性进行可追溯的验证,以合理的开销有效抑制策略违规路由传播,在局部部署情况下也具有显著的策略违规路由抑制能力.     

互联网自治域商业关系推测算法

随着互联网进入商业化发展阶段,不同管理机构的自治域通过商业合作关系来共同路由互联网中的流量.从工程上来看,获取全面准确的自治域商业关系可以指导有效的流量工程管理和资源部署从而均衡网络负载,提高服务可靠性,减少网络运营成本;从理论上来看,获取全面准确的自治域关系可以分析互联网的演进模型,指导设计新的路由协议和互联网架构.虽然互联网路由注册中心会记录自治域之间的商业关系,但是由于商业敏感以及注册中心缺乏维护更新,公开的自治域商业关系并不全面准确,因而通过推测算法获得更加全面准确的自治域商业关系成为了学术界与产业界关注的热点.文中系统地综述了现有的互联网自治域商业关系推测算法及其存在的问题,并对该领域有待进一步研究的问题和可能的解决方案给出了一些建议.     

一种非结构化对等网络短路效应解决方法

非结构化对等网络Gnutella存在短路效应，这会严重影响消息的到达率，造成网络查询效率低下。利用Gnutella网络拓扑的分布呈现典型的幂规律和小世界特性，将少量度很大的节点提升为超级结点，并以超级节点为中心，将兴趣相同或相似的节点进行聚类，从而形成若干自治域小世界，这样Gnutella网络模型被抽象层次化，自治域内查询请求由本域的超级节点直接处理，自治域间查询请求在超级节点间进行转发。研究表明，这种方法可以有效解决短路效应问题。     

区分自治系统关系的域间路由体系研究

BGP-4是Internet采用的惟一域间路由协议，但它并不能确保路由收敛，复杂的网络结构加剧了路由潜在振荡的危险性．为此，提出了一种自约束的域间选路机制，在不违反传统流量工程原则和自治系统间结算原则的前提下，通过抑制违背自治系统间关系的路由通告和路由选择，达到维护全系统路由稳定的目的；对昕提方案的技术可行性进行论证，给出了新的选路机制原型系统的定义和关键算法的实现．区分自治系统关系的域间路由体系有效回避了路由策略一致性全局检测这一NP-complete问题．     

Hidra:一个分级域间路由架构

Internet域间路由系统的扩展性面临着严峻挑战.主要表现在全球路由表膨胀和路由更新频繁.分析发现造成全球路由表膨胀的根本原因是标识自治系统位置的IP前缀数目不可控,造成路由更新频繁的根本原因是扁平的域间路由结构.基于此,文中提出了一个分级域间路由架构Hidra(Hierarchical inter-domain routing architec-ture).Hidra的核心思想是隔离网络边界与核心:"相对稳定"的核心网络位于高阶路由层,运行高阶域间路由协议,以维持核心网络的可达性;在"变化相对剧烈"的边界,引入一个低阶映射层和相应的映射服务,以维持边界网络与核心网络之间的可达性.因为与不稳定的边界网络隔离,核心网络路由的稳定性增强.Hidra引入一个标识传送自治系统位置的域间路由标识(Routing IDentity,RID).它由传送自治系统及其提供商自治系统唯一确定,显著降低了全球路由表的规模.     

复杂域间路由体系中自治系统间关系的分类

总结归纳了复杂域间路由体系中自治系统间的互联关系及其行为模式,指出peer-peer和customer-provider关系是当前域间路由的基础,并由此衍生出若干种复杂关系。分析了备种关系的成因,讨论它们的不同实现技术和当前存在的一些技术瓶颈,进一步给出了一种能够识别自治系统关系并自动约束域间路由行为的增强算法。算法兼容RFC1771系列域间路由规范。     

域间路由协同管理机制及其应用

域间路由系统是互联网的核心基础设施,由多个独立配置和管理路由策略的自治系统互联而成.这种缺乏协同的管理模式会引起诸多控制和管理问题,例如:路由震荡、路由安全及流量工程违背等.为了消除路由策略冲突,自治系统之间需要协同.出于竞争目的,运营商需要对外隐藏自己的秘密信息,例如:路由策略、网络拓扑等等.这种行为阻碍了自治系统的协同.由于缺乏有效的协同信息访问机制,跨域路由策略管理难以实施.为了加强运营商的协同能力,基于离散对数假设提出一种面向多自治系统协同的路由策略一致性检查方法,该方法能够在不透露自治系统路由策略的前提下完成策略冲突检测.与基于加同态公钥密码算法的解决方案相比,不需要引入茫然第三方,具有更小的计算和通信开销.不需要修改BGP协议,易于实现和实施,支持可渐进部署,能够用于域间路由策略冲突检测、路由有效性验证、路由监测和协同入侵检测等多个领域.     

Characterization of community based-P2P systems and implications for traffic localization

In this paper, we present one of the first and most extensive characterizations of closed community-based P2P systems. Such systems are organic groups of peer-to-peer (P2P) clients, which can be joined only by users belonging to a certain network (e.g., connected to a given Internet Service Provider (ISP)). A number of factors motivate the growth of these communities, such as quality of content, anonymity of transfers, and the potential for better performance that enhances user experience. Our study is conducted in two contrasting environments—a campus network and a national ISP—located in different continents. In both cases, large-scale closed communities have been found to be the predominant P2P systems in use. We shed light both on the factors motivating the growth of such communities, and present results characterizing the extensiveness of their usage, the performance achievable by the systems, and the implications of such communities for network providers. While our findings are interesting in their own right, they also offer important lessons for ongoing research that seeks to localize traffic within ISP boundaries. In particular, our results suggest that (i) in ISPs with heterogeneous access technologies, the performance benefits to users on localizing P2P traffic is largely dependent on the degree of seed-like behavior of peers behind high-bandwidth access technologies; and (ii) while localization can reduce the traffic on Internet peering links, it has the potential to cause a significant increase in traffic on internal links of providers, potentially requiring upgrades of network links.     

BGP最优路径选择中的瓶颈区域的研究

基于流量需求的BGP最优路径选择是域间流量工程研究的一个问题.其中瓶颈区域的判定可为域间流量工程的决策过程提供重要的启发信息.然而,瓶颈区域的判定是NP难问题.在同时考虑域内链路和域间链路的前提下,提出多项式时间的基于流量需求的瓶颈区域的预测算法.在此基础上,系统地研究了流量、拓扑结构与瓶颈区域间的关系.模拟实验表明,预测算法的准确性超过90%,研究结果表明,拓扑结构是决定瓶颈区域的重要因素.     

New Internet Economics Might Not Make It to the Edge

Numerous network analysts think the Internet has entered a new era in which those who provide content and those who provide customers are creating new exchange and peering architectures that could effectively cut out entities that provide neither. One report shows tremendous consolidation of traffic origin and a change in the type of organizations behind that traffic. However, while such consolidation and increased negotiating and peering power have resulted in a new economic and engineering topology in the network core, some are concerned this new topology's future could be greatly affected by the net neutrality issue. Additionally, how reengineering the network's peering architecture will benefit the last mile remains a vexing issue.     

未来骨干网路由协议－－BGP

边界网关协议在自治系统之间提供无路径的路由。通常ＢＧＰ在许多ＩＳＰ之间运行。详细介绍ＢＧＰ协议基本框架及如何工作的。     

Analysis and modelling of traffic produced by adaptive HTTP-based video

The increase of HTTP-based video popularity causes that broadband and Internet service providers’ links transmit mainly multimedia content. Network planning, traffic engineering or congestion control requires an understanding of the statistical properties of network traffic; therefore, it is desirable to investigate the characteristic of traffic traces generated by systems which employ adaptive bit-rate streaming. Our first contribution is an investigation of traffic originating from 120 client-server pairs, situated in an emulated content distribution network, and multiplexed onto a single network link. We show that the structure of the traffic is distinct from the structure generated by the first and second generation of HTTP video systems, and furthermore, not similar to the structure of general Internet traffic. The obtained traffic exhibits negative and positive correlations, anti-persistence, and its distribution function is skewed to the right. Our second contribution is an approximation of the traffic by ARIMA/FARIMA processes blue and artificial neural networks. As we show, the obtained traffic models are able to enhance the performance of an adaptive streaming algorithm.     

The EMI Registry: Discovering Services in a Federated World

The Distributed Computing Infrastructure (DCI) has become an indispensable tool for scientific research. Such infrastructures are composed of many independent services that are managed by autonomous service providers. The discovery of services is therefore a primary function, which is a precursor for enabling efficient workflows that utilise multiple cooperating services. As DCIs, such as the European Grid Initiative (EGI), are based on a federated model of cooperating yet autonomous service providers, a federated approach to service discovery is required that seamlessly fits into the operational and management procedures of the infrastructure. Many existing approaches rely on a centralised service registry, which is not suited to a federated deployment and operational model. A federated service registry is therefore required that is capable of scaling to handle the number of services and discovery requests found in a production DCI. In this paper we present the EMI Registry (EMIR), a decentralised architecture that supports both hierarchical and peering topologies, enabling autonomous domains to collaborate in a federated infrastructure. An EMIR pilot service is used in order to evaluate a prototype of this architecture under real-world conditions with a geographically-dispersed deployment. The results of this initial deployment are provided along with a few performance measurements.     

Interaction of ISPs: Distributed Resource Allocation and Revenue Maximization

The Internet is a hierarchical architecture comprising heterogeneous entities of privately owned infrastructures, where higher level Internet service providers (ISPs) supply connectivity to the local ISPs and charge the local ISPs for the transit services. One of the challenging problems facing service providers today is how the profitability can be increased while maintaining good service qualities as the network scales up. In this work, we seek to understand the fundamental issues on the "interplay" (or interaction) between ISPs at different tiers. Although the local ISPs (which we term peers) can communicate with each other by purchasing the connectivity from transit ISPs, there stands an opportunity for them to set up private peering relationships. Under this competitive framework, we explore the issues on 1) the impact of peering relationship; 2) resource distribution; 3) revenue maximization; and 4) condition for network upgrade. First, a generalized model is presented to characterize the behaviors of peers and the transit ISP, in which their economic interests are reflected. We study how a peer can distributively determine its optimal peering strategy. Furthermore, we show how a transit ISP is able to utilize the available information to infer its optimal pricing strategy, under which a revenue maximization is achieved. Two distributed algorithms are proposed to help ISPs to provide a fair and efficient bandwidth allocation to peers, avoiding a resource monopolization of the market. Last, we investigate the above issues in a "many-peers region," that is, when we scale up the network. We provide insightful evidence to show that the ISPs can still gain profits as they upgrade the network infrastructures. Extensive simulations are carried out to support our theoretical claims.     

A P4P-integrated data-driven P2P system for the live multimedia streaming service

The Proactive network Provider Participation for the P2P (P4P) architecture deploys central servers, which perceives network status and provides peering suggestions to P2P systems in order to achieve better network resource utilization while supporting best possible application performance. However, P4P alone may not be able to make appropriate peering suggestions for live multimedia streaming since it does not include mechanisms to reflect some of the parameters that are important to the QoS of live multimedia streaming such as upload bandwidth and stability of a peer as a stream deliverer. Furthermore, peer synchronization and parent replacement in the middle of a session, which are critical issues to the QoS of live multimedia streaming, are also left as the matters to be dealt with by the P2P systems alone. Most of the existing data-driven P2P systems leverage periodic information exchanges among neighboring peers in order to cope with these problems, which may incur long delay and high control overhead. In this paper, we proposed P4P-integrated data-driven P2P system for live multimedia streaming service. The proposed system includes not only the peering suggestion mechanism appropriate for live multimedia streaming but also the peer synchronization and parent replacement mechanisms, which exploit the centralized P4P framework and do not require periodic control information exchanges. We implemented the system in NS-2 simulator and compared its performance to the P4P and existing data-driven P2P systems. The results from experiments show that the proposed system enhances QoS compared to the existing data-driven P2P systems while maintaining the same level of network efficiency of the original P4P.     

A game–theoretic analysis of the implications of overlay network traffic on ISP peering

Inter-ISP traffic flow determines the settlement between ISPs and affects the perceived performance of ISP services. In today’s Internet, the inter-ISP traffic flow patterns are controlled not only by ISPs’ policy-based routing configuration and traffic engineering, but also by application layer routing. The goal of this paper is to study the economic implications of this shift in Internet traffic control assuming rational ISPs and subscribers. For this purpose, we build a general traffic model that predicts traffic patterns based on subscriber distribution and abstract traffic controls such as caching functions and performance sensitivity functions. We also build a game–theoretic model of subscribers picking ISPs, and ISPs making provisioning and peering decisions. In particular, we apply this to a local market where two ISPs compete for market share of subscribers under two traffic patterns: “Web” and “P2P overlay”, that typifies the transition the current Internet is going through. Our methodology can be used to quantitatively demonstrate that (1) while economy of scale is the predominant property of the competitive ISP market, P2P traffic may introduce unfair distribution of peering benefit (i.e. free-riding); (2) the large ISP can restore more fairness by reducing its private capacity (bandwidth throttling), which has the drawback of hurting business growth; and (3) ISPs can reduce the level of peering (e.g. by reducing peering bandwidth) to restore more fairness, but this has the side-effect of also reducing the ISPs’ collective bargaining power towards subscribers.     

网络行为仿真综述

网络行为描述了网络上各类元素对象动态交互过程.它以各类网络服务协议及应用为运行载体,形成不断变化的丰富多样的网络行为,反映出网络拓扑结构给定时间内网络上的场景特点.网络行为仿真主要包括运行框架、背景流仿真、前景流仿真,将生产网络环境下网络行为按需映射到测试网络环境,提供一种按需灵活定制仿真再现能力.网络仿真应用场景不断...