Traffic Localization Research Articles

Design and Evaluation of Low-Latency and Shortest-Path Routing Algorithm for Triplet-Based Hierarchical Interconnection Network

Abstract Routing is one of the key factors that determine how much of the ideal performance of the network-on-chip is realized. A well-designed routing algorithm can extend much benefit through the implementation of this potential. Existing routing algorithms for a triplet-based hierarchical interconnection network (THIN) can be applied for a balanced THIN but are not suitable for a non-balanced THIN. This paper proposes the shortest path routing algorithm for THIN, called SPORT, which can be applied to both the balanced and non-balanced THINs. Based on the THIN features, SPORT computes the shortest path at the source node and constructs the output port list to minimize the computation time at the intermediate node. The simulation results show that SPORT can obtain lower traffic latency than existing routing algorithms. We also compare THIN with the 2D mesh in terms of traffic locality. The simulation results show that THIN is more suitable than the 2D mesh for these high-locality traffic workloads.

The performance and locality tradeoff in bittorrent-like file sharing systems

In recent years, the surge of large-scale peer-to-peer (P2P) applications has brought huge amounts of P2P traffic, which has significantly changed the Internet traffic pattern and increased the traffic-relay cost at the Internet Service Providers (ISPs). To alleviate the stress on networks, methods of localized peer selection have been proposed that advocate neighbor selection within the same network (AS or ISP) to reduce the cross-ISP traffic. Nevertheless, localized peer selection may potentially lead to the downgrade of download speed at the peers, rendering a non-negligible tradeoff between the download performance and traffic localization in the P2P system. Aiming at effective peer selection strategies that achieve any desired Pareto optimum in face of the tradeoff, our contributions in this paper are three-fold: (1) We characterize the performance and locality tradeoff as a multi-objective $b$ -matching optimization problem. In particular, we first present a generic weighted $b$ -matching model that characterizes the tit-for-tat in BitTorrent-like peer selection. We then introduce multiple optimization objectives into the model, which effectively characterize the performance and locality tradeoff using simultaneous objectives to optimize. (2) We design fully distributed peer selection algorithms that can effectively approximate any desired Pareto optimum of the global multi-objective optimization problem, which represents a desired tradeoff point between performance and locality in the entire system. (3) Taking network dynamics into consideration, we further propose practical protocols that allow each peer to dynamically adjust its peer selection preference on download performance or traffic locality, in order to adapt to the current quality of peering connections, while guaranteeing that the desired tradeoff is still achieved over its entire download process. To support our models and protocols, we have conducted rigorous analysis, extensive simulations, and prototype experiments under various practical settings extracted from real-world traces.

P2P Traffic Localization by Forcing Packet Loss

Recently, peer-to-peer (P2P) traffic is increasing rapidly in volume day by day. One of the main causes is that most of P2P applications including file sharing and streaming applications often form overlay networks for exchanging data that are oblivious to the underlay network topology. As a result, they generate a large amount of inter-domain traffic causing higher cost for Internet service providers (ISPs). This raises a problem of traffic localization. To optimize the cross-ISP/AS traffic, existing approaches focus on solving the problem on the application layer where each P2P application must be equipped with an additional protocol to obtain underlay network information from an “Oracle” server or an additional locality-aware procedure to estimate location by itself. Therefore some modifications of application software are required for these approaches. In this paper, we propose a novel solution for addressing the problem, called PLS, forcing packet loss to each P2P packet based on geographical location of each destination at the network layer. Since PLS is implemented at a network router, no software modification is required. This proposal can be applied to all types of P2P applications in order to localize the traffic. The experiment in this study evaluated on popular P2P streaming applications show that our proposed method significantly improves the performance of traffic localization problem.

An Approximated Selection Algorithm for Combinations of Content with Virtual Local Server for Traffic Localization in Peer-Assisted Content Delivery Networks

An Approximated Selection Algorithm for Combinations of Content with Virtual Local Server for Traffic Localization in Peer-Assisted Content Delivery Networks

ISP-Driven Delay Insertion for P2P Traffic Localization

ISP-Driven Delay Insertion for P2P Traffic Localization

Routing Discovery Algorithm Using Parallel Chase Packet

On demand routing protocols for ad hoc networks such as Ad Hoc On Demand Distance Vector (AODV) initiate a route discovery process when a route is needed by flooding the network with a route request packet. The route discovery process in such protocols depends on a simple flooding as a broadcast technique due to its simplicity. Simple flooding results in packet congestion, route request overhead and excessive collisions, namely broadcast storm problem. A number of routing techniques have been proposed to control the simple flooding technique. Ideally, the broadcast of route request or the route discovery process must be stopped as soon as the destination node is found. This will free the network from many redundant packets that may cause network collision and contention. In this paper, chasing packet technique is used with standard AODV routing protocol to end the fulfilled route requests. The chase packet is initiated by the source node and is broadcasted in parallel with route request packet. As soon as the destination is found the chase packet starts its work by trying to catch and discard the route request in early stages before it broadcasts further in the network. Performance evaluation is conducted using simulation to investigate the performance of the proposed scheme against the existing approach that uses chase packet technique such as Traffic Locality Route Discovery Algorithm with Chase (TLRDA-C). Results reveal that the proposed scheme minimizes end-to-end packet delays and achieves low routing request overhead.

The Internet-Wide Impact of P2P Traffic Localization on ISP Profitability

We conduct a detailed simulation study to examine how localizing P2P traffic within network boundaries impacts the profitability of an ISP. A distinguishing aspect of our work is the focus on Internet-wide implications, i.e., how adoption of localization within an ISP affects both itself and other ISPs. Our simulations are based on detailed models that estimate inter-autonomous system (AS) P2P traffic and inter-AS routing, localization models that predict the extent to which P2P traffic is reduced, and pricing models that predict the impact of changes in traffic on the profit of an ISP. We evaluate our models by using a large-scale crawl of BitTorrent containing over 138 million users sharing 2.75 million files. Our results show that the benefits of localization must not be taken for granted. Some of our key findings include: 1) residential ISPs can actually lose money when localization is employed, and some of them will not see increased profitability until other ISPs employ localization; 2) the reduction in costs due to localization will be limited for small ISPs and tends to grow only logarithmically with client population; and 3) some ISPs can better increase profitability through alternate strategies to localization by taking advantage of the business relationships they have with other ISPs.

Understand traffic locality of peer-to-peer video file swarming

Peer-to-peer (P2P) file sharing systems, most notably BitTorrent (BT), have achieved tremendous success among Internet users. Although this communication paradigm does not need a dedicated server infrastructure, it is putting unprecedented traffic pressure to Internet Service Providers (ISPs) over inter-ISP links.P2P locality has therefore been examined to address this challenge. Such an approach explores the access to local resources to optimize the inter-ISP traffic. However, most of these approaches have focused on a global strategy, and attempted to change the peer selection mechanism, which potentially affect the random topology of BT and thus reduces its robustness. The content and the peer diversities are seldom discussed, particularly the video file swarms of distinct characteristics.In this paper, we for the first time examine the different BT contents and peer properties in regards to the locality issues through a large-scale measurement. We demonstrate the distinct characteristics of video file swarms, and find that the distribution of the AS clusters (a set of peers belonging to the same AS) follows the Mandelbrot–Zipf law. Our results also suggest that the peer in few ASes are more likely to form large AS clusters and most ASes on the Internet do not have enough potential for locality. Therefore, a global locality approach may not be our best choice. We then address the problem through a selective locality approach based on a novel peer prediction method.

Design and Implementation of a Locality-Aware P2P System

One of the most relevant problem for an Internet Service Provider is the large bandwidth usage on international links, mainly due to peer-to-peer applications adopted for file-sharing. The Collaborative Locality-aware Overlay SERvice (CLOSER) technology has been recently proposed to solve this issue by properly modifying the behavior of peer-to-peer application. The technology is also covered in two recent patent applications. This paper presents possible design guidelines to actually implement CLOSER in a DHT-based peer-to-peer system and describe a real implementation based on the popular aMule application. Keywords: Peer-to-peer, File-sharing, traffic locality, DHT, ISPs, P2P system, CDN, ASN, IANA, biological peptides, CBQ, Criticality index, CSearchManager, CKademlia, CPrefs, CRoutingZone, CIndexed

CLOSER: A Collaborative Locality-Aware Overlay SERvice

Current Peer-to-Peer (P2P) file sharing systems make use of a considerable percentage of Internet Service Providers (ISPs) bandwidth. This paper presents the Collaborative Locality-aware Overlay SERvice (CLOSER), an architecture that aims at lessening the usage of expensive international links by exploiting traffic locality (i.e., a resource is downloaded from the inside of the ISP whenever possible). The paper proves the effectiveness of CLOSER by analysis and simulation, also comparing this architecture with existing solutions for traffic locality in P2P systems. While savings on international links can be attractive for ISPs, it is necessary to offer some features that can be of interest for users to favor a wide adoption of the application. For this reason, CLOSER also introduces a privacy module that may arouse the users' interest and encourage them to switch to the new architecture.

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.

P2P Traffic Localization Based on Peer-List Caching

P2P Traffic Localization Based on Peer-List Caching

Characterizing Locality-aware P2P Streaming

Peer-to-peer (P2P) live streaming systems have been increasingly popular and successful in today's Internet, which provide large collections of video channels to millions of users at low server costs. The large volumes of P2P streaming traffic are exceeding those incurred by BitTorrent-like file sharing applications, threatening huge traffic relay cost to the Internet service providers (ISPs). There have recently emerged proposals advocating locality-aware P2P streaming protocol design, which aim to constrain streaming traffic within ISP boundaries and to alleviate traffic relay cost to the Internet Service Providers (ISPs). Nevertheless, there is a lack of in-depth understanding on the impact of such a locality-aware design on P2P streaming performance. Taking an analytical approach, we model the relation between streaming performance and traffic locality in P2P live streaming systems, in order to acquire useful insights for designing high-performance locality-aware real-world systems. We use end-to-end streaming delays as the performance metric for live streaming, and the number of copies of the live streams imported into an ISP to evaluate the volume of inter-ISP traffic. Considering multiple ISPs at different bandwidth levels, we characterize the generic relationship between the volume of inter-ISP traffic and the streaming performance; we then analyze the traffic volume when the best streaming performance is achieved and the streaming performance when minimum inter-ISP traffic is incurred. Our models and analyses provide intriguing insights on the design of effective locality-aware peer selection protocols and server deployment strategies across multiple ISPs. We also evaluate our models and theoretical results with large-scale simulations under realistic settings.

ISP-friendly P2P live streaming

Peer-to-Peer (P2P) applications generate large amounts of Internet network traffic. The wide-reaching connectivity of P2P systems is creating resource inefficiencies for network providers. Recent studies have demonstrated that localizing cross-ISP (Internet service provider) traffic can mitigate this challenge. However, bandwidth sensitivity and display quality requirements complicate the ISP-friendly design for live streaming systems. To this date, although some prior techniques focusing on live streaming systems exist, the correlation between traffic localization and streaming quality guarantee has not been well explored. Additionally, the proposed solutions are often not easy to apply in practice. In our presented work, we demonstrate that the cross-ISP traffic of P2P live streaming systems can be significantly reduced with little impact on the streaming quality. First, we analytically investigate and quantify the tradeoff between traffic localization and streaming quality guarantee, determining the lower bound of the inter-AS (autonomous system) streaming rate below which streaming quality cannot be preserved. Based on the analysis, we further propose a practical ISP-friendly solution, termed IFPS , which requires only minor changes to the peer selection mechanism and can easily be integrated into both new and existing systems. Additionally, the significant opportunity for localizing traffic is underscored by our collected traces from PPLive, which also enabled us to derive realistic parameters to guide our simulations. The experimental results demonstrate that IFPS reduces cross-ISP traffic from 81% up to 98% while keeping streaming quality virtually unaffected.

Power Consumption Evaluation of Distributed Computing Network Considering Traffic Locality

Power Consumption Evaluation of Distributed Computing Network Considering Traffic Locality

Traffic Engineering of Peer-Assisted Content Delivery Network with Content-Oriented Incentive Mechanism

In content services where people purchase and download large-volume contents, minimizing network traffic is crucial for the service provider and the network operator since they want to lower the cost charged for bandwidth and the cost for network infrastructure, respectively. Traffic localization is an effective way of reducing network traffic. Network traffic is localized when a client can obtain the requested content files from other a near-by altruistic client instead of the source servers. The concept of the peer-assisted content distribution network (CDN) can reduce the overall traffic with this mechanism and enable service providers to minimize traffic without deploying or borrowing distributed storage. To localize traffic effectively, content files that are likely to be requested by many clients should be cached locally. This paper presents a novel traffic engineering scheme for peer-assisted CDN models. Its key idea is to control the behavior of clients by using content-oriented incentive mechanism. This approach enables us to optimize traffic flows by letting altruistic clients download content files that are most likely contributed to localizing traffic among clients. In order to let altruistic clients request the desired files, we combine content files while keeping the price equal to the one for a single content. This paper presents a solution for optimizing the selection of content files to be combined so that cross traffic in a network is minimized. We also give a model for analyzing the upper-bound performance and the numerical results.

The Design and Implementation of a Hierarchical Networkon-Chip

Network-on-Chip (NoC) architectures represent the most viable solution for on-chip communication issues of future chip multi-processor systems. To meet performance, power and reliability requirements, which characterize future ambient intelligent applications, several NoC architectures were proposed recently. TriBA is an object-oriented chip multi-processor that supports truly parallel execution of objects from hardware. In this paper we design and implement a new router architecture for TriBA network-on-chip. The hardware architecture of the router is detailed and a new routing algorithm is described. We present the packet latency results under different traffic pattern of a 27 core TriBA-NoC model. The results show that TriBA-NoC benefits greatly from traffic locality.

A Feasibility Study of P2P Traffic Localization through Network Delay Insertion

A Feasibility Study of P2P Traffic Localization through Network Delay Insertion

Traffic Sign Recognition and Localization for Databases of Traffic Signs

Traffic Sign Recognition and Localization for Databases of Traffic Signs

LANC: Locality-aware network coding for better P2P traffic localization

As ISPs begin to cooperate to expose their network locality information as services, e.g., P4P, solutions based on locality information provision for P2P traffic localization will soon approach their capability limits. A natural question is: can we do any better provided that no further locality information improvement can be made? This paper shows how the utility of locality information could be limited by conventional P2P data scheduling algorithms. Even sophisticated data scheduling algorithms such as the local rarest first could not take full advantage of the locality information. Network coding’s simplified data scheduling makes it competent for improving P2P application’s throughput. However, its potential for P2P traffic reduction has not been fully recognized. This paper proposes the locality-aware network coding (LANC) that uses locality information in both the topology construction and downloading decision, and demonstrates its exceptional ability for inter-domain P2P traffic reduction. The randomization introduced by network coding enhances the chance for a peer to find innovative blocks in its neighborhood. Aided by proper locality-awareness, the probability for a peer to get innovative blocks from its proximity will increase as well, resulting in more efficient use of network resources. Extensive simulation results show that LANC can significantly reduce inter-domain P2P traffic without sacrificing application-level performance. Aided by the same locality knowledge, the inter-domain traffic of LANC in most cases are less than 50% of the current best approach that does not use network coding. We also show that this property holds when the tit-for-tat incentive mechanism is introduced or the overlay topology changes dynamically.