Abstract: The next generation Internet needs to support multiple diverse application contexts. In this paper, we present Internet 3.0, a diversified, multi-tier architecture for the next generation Internet. Unlike the current Internet, Internet 3.0 defines a new set of primitives that allows diverse applications to compose and optimize their specific contexts over resources belonging to multiple ownerships. The key design philosophy is to enable diversity through explicit representation, negotiation and enforcement of policies at the granularity of network infrastructure, compute resources, data and users. The basis of the Internet 3.0 architecture is a generalized three-tier object model. The bottom tier consists of a high-speed network infrastructure. The second tier consists of compute resources or hosts. The third tier consists of data and users. The “tiered ” organization of the entities in the object model depicts the natural dependency relationship between these entities in a communication context. All communication contexts, including the current Internet, may be represented as special cases within this generalized three-tier object model. The key contribution of this paper is a formal architectural representation of the Internet 3.0 architecture over the key primitive of the “Object Abstraction ” and a detailed discussion of the various design aspects of the architecture, including the design of the “Context Router- ” the key architectural element that powers an evolutionary deployment plan for the clean slate design ideas of

Peer-assisted content distribution matches user demand for content with available supply at other peers in the network. Inspired by this supply-and-demand interpretation of the nature of content sharing, we employ price theory to study peer-assisted content distribution. The market-clearing prices are those which align supply and demand, and the system is studied through the characterization of price equilibria. We discuss the efficiency and robustness gains of price-based multilateral exchange, and show that simply maintaining a single price per peer (even across multiple files) suffices to achieve these benefits. Our main contribution is a system design—PACE (Price-Assisted Content Exchange)—that effectively and practically realizes multilateral exchange. Its centerpiece is a marketbased mechanism for exchanging currency for desired content, with a single, decentralized price per peer. Honest users are completely shielded from any notion of prices, budgeting, allocation, or other market issues, yet strategic or malicious clients cannot unduly damage the system’s efficient operation. Our design encourages sharing of desirable content and network-friendly resource utilization. Bilateral barter-based systems such as BitTorrent have been attractive in large part because of their simplicity. Our research takes a significant step in understanding the efficiency and robustness gains possible with multilateral exchange. 1.

Many emerging scientific and industrial applications require transferring multiple Tbytes of data on a daily basis. Examples include pushing scientific data from particle accelerators/colliders to laboratories around the world, synchronizing data-centers across continents, and replicating collections of high definition videos from events taking place at different time-zones. A key property of all above applications is their ability to tolerate delivery delays ranging from a few hours to a few days. Such Delay Tolerant Bulk (DTB) data are currently being serviced mostly by the postal system using hard drives and DVDs, or by expensive dedicated networks. In this work we propose transmitting such data through commercial ISPs by taking advantage of already-paid-for off-peak bandwidth resulting from diurnal traffic patterns and percentile pricing. We show that between sender-receiver pairs with small time-zone difference, simple source scheduling policies are able to take advantage of most of the existing off-peak capacity. When the time-zone difference increases, taking advantage of the full capacity requires performing store-and-forward through intermediate storage nodes. We present an extensive evaluation of the two options based on traffic data from 200+ links of a large transit provider with PoPs at three continents. Our results indicate that there exists huge potential for performing multi Tbyte transfers on a daily basis at little or no additional cost.

Recent revelations that ISPs selectively manipulate P2P traffic have sparked much public discussion. Underlying this issue is the misalignment of interests between consumers on one hand who desire bulk transfers at flat rates, and ISPs on the other hand who are bound by budget and capacity constraints. Our thesis is that much of the tension can be alleviated by time-shifting traffic away from peak hours taking advantage of its Delay Tolerant (DT) nature. We propose two solutions for doing this. The first one offers incentives to end-users to shift their DT traffic and yet be compatible with flat-rate charging schemes. The second one posits augmenting the network with additional storage in the form of Internet Post Offices which can let ISPs perform store-and forward relaying of such DT traffic. 1.

Abstract — It has long been realized that the use of the Internet has moved away from its original end-host centric model. The vast majority of services and applications is nowadays focused on information itself rather on the end-points providing/consuming it. However, the underlying network architecture still focuses on enabling the communication between pairs of end-hosts, leading to a series of problems, such as the inefficient utilization of network resources, demonstrated by the proliferation of peer-topeer (P2P) and file sharing applications. In essence, the prevailing end-to-end nature of the current Internet architecture prohibits network operators from controlling the traffic carried by their networks, leaving this control entirely to end users and their applications. In this paper, we investigate the potential benefits of MultiCache, an overlay network architecture aiming at handing control back to network operators. In MultiCache proxy overlay routers enable the delivery of data either via direct multicast, or via multicast fed caches residing at the leaves of multicast delivery trees. We study crucial aspects of our architecture, paying special attention to the properties of our distributed caching scheme, and investigate the feasibility of a progressive deployment of the proposed functionality over the existing Internet. I.

Research Task Force (IRTF) is currently discussing several architectural solutions to build an interdomain routing architecture that scales better than the existing one. The solutions family currently being discussed concerns the addresses separation into locators and identifiers, LISP being one of them. Such a separation provides opportunities in terms of traffic engineering. In this paper, we propose an open and flexible solution that allows an ISP using identifier/locator separation to engineer its interdomain traffic. Our solution relies on the utilization of a service that transparently ranks paths using cost functions. We implement a prototype server and demonstrate its benefits in a LISP testbed. I.

Peer-to-peer locality has recently raised a lot of interest in the community. Indeed, whereas peer-to-peer content distribution enables financial saving for the content providers who do not have to maintain a dedicated infrastructure, it dramatically increases the traffic on inter-ISP links. To solve this issue, the idea to keep a fraction of the peerto-peer traffic local to each ISP was introduced a few years ago. Since then, peer-to-peer solutions exploiting locality have been introduced. However, several fundamental issues on locality still need to be explored. For instance, how far can we push locality for a peer-to-peer distribution without impacting its robustness? In this paper, we perform extensive experiments on a controlled environment with up to 10 000 peers to evaluate the impact of locality on inter-ISP links traffic and peers download completion time. In particular, we show that high locality values enable up to two orders of magnitude saving on inter-ISP links without any significant impact on peers download completion time. 1.

Peer-assisted content distribution matches user demand for content with available supply at other peers in the network. Inspired by this supply-and-demand interpretation of the nature of content sharing, we employ price theory to study peer-assisted content distribution. In this approach, the market-clearing prices are those which exactly align supply and demand, and the system is studied through the characterization of price equilibria. Our work provides two separate steps forward. First, we rigorously analyze the efficiency and robustness gains that are enabled by price-based multilateral exchange. We show that multilateral exchanges satisfy several desirable efficiency and robustness properties that bilateral exchanges such as BitTorrent do not, particularly when considering multiple files. Second, we propose and evaluate a system design that realizes many of the benefits of a price-based multilateral exchange; our design encourages sharing of desirable content and network-friendly resource utilization. Bilateral barter-based systems such as BitTorrent have been attractive in large part because of their simplicity; however, little attention has been devoted to studying the efficiency and robustness lost in return for this simplicity. Our research takes a significant step in filling this gap, both through formal analysis and system design. 1

This article is an editorial note submitted to CCR. It has NOT been peer reviewed. Authors take full responsibility for this article’s technical content. Comments can be posted through CCR Online. This article summarises the presentations and discussions during a workshop on end-to-end protocols for the future Internet in June 2008. The aim of the workshop was to establish a dialogue at the interface between two otherwise fairly distinct communities working on future Internet protocols: those developing internetworking functions and those developing end-to-end transport protocols. The discussion established near-consensus on some of the open issues, such as the preferred placement of traffic engineering functionality, whereas other questions remained controversial. New research agenda items were also identified.

During the past ten years, we have seen the emergence of a set of applications requiring more and more quality of service (QoS). For instance, IPTV needs large bandwidth and delays as lows as possible. Further, while previously a content was located in a single place, it is, nowadays, frequent that the content is replicated among a set of servers located anywhere on five continents or even among users themselves. Perfect examples of this are peer-to-peer (P2P) applications and FTP mirrors. In addition, multihoming, i.e., the ability of having different connections to Internet potentially through different providers, is becoming more and more popular [1, 2]. Finally, network level protocols such as SHIM6 or LISP must often choose the best path among a list of highly disparate paths according to traffic engineering or policies considerations (see discussions on IETF mailing lists). This situation leads to more complexity in ensuring QoS to the user. We have now to maximize the QoS perceived by the user based on a set of highly disparate paths. In addition, in many new applications, path selection and QoS are ensured at the application layer resulting in an ineffective network level resources use. Today, although many of measurements techniques have been developed within the IPPM working group of the IETF, an application that needs to select a path or a server must implement its own measurement system to obtain data to perform its selection. Thus, several applications running on the same host or in the same campus will probably perform almost the same kind of measurements. Duplicating those measurements is not the appropriate solution. ∗ This work was partially supported by the Europeanfounded