The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
The Low Extra Delay Background Transport (LEDBAT) protocol is a recently standardized protocol that aims to offer a scavenger service (i.e. the goal is to exploit the remaining and unused capacity of a link). LEDBAT is a delay-based protocol mainly defined by two parameters: a target queuing delay and a gain. The RFC 6817 provides guidelines to configure both parameters that strongly impact on the...
Multipath TCP is an experimental transport protocol with remarkable recent past and non-negligible future potential. It has been standardized recently, however the evaluation studies focus only on a limited set of isolated use-cases and a comprehensive analysis or a feasible path of Internet-wide adoption is still missing. This is mostly because in the current networking practice it is unusual to...
To study Internet's routing behavior on the granularity of Autonomous Systems (ASes), one needs to understand inter-domain routing policy. Routing policy changes over time, and may cause route oscillation, network congestion, and other problems. However, there are few works on routing policy changes and their impact on BGP's routing behaviors. In this paper, we model inter-domain routing policy as...
It has become a common practice that enterprises outsource their networks to the cloud by renting multiple virtual machines (VMs) in cloud datacenters. Due to the multi-tenant nature of cloud datacenter, how to efficiently share the network resources becomes an important issue. Recent studies, e.g., SecondNet and Oktopus, have taken network bandwidth into consideration when allocating VMs. However,...
The scalability of the global routing system is critical for the evolution of the Internet, and consequently, BGP scalability has been part of the Internet research agenda from long ago. The original concern was the growth of the routing table size, and more recently, the research community has also been considering the growth of the BGP churn, i.e. the number of messages that are generated by the...
Botnets are a well recognized global cyber-security threat as they enable attack communities to command large collections of compromised computers (bots) on-demand. Peer to-peer (P2P) distributed hash tables (DHT) have become particularly attractive botnet command and control (C & C) solutions due to the high level resiliency gained via the diffused random graph overlays they produce. The...
The ability to extract topology information from the network is important for many applications and enables more informed resource selection. The challenge for topology exposure is to provide a compact representation that is sufficiently accurate and complies to topology hiding policies. This paper presents a topology abstraction system that can expose large-scale service provider network maps with...
Scalable routing schemes for large-scale networks, especially future Internet, are required. Geometric routing scheme is a promising candidate to solve the scalability issue of routing tables in conventional IP routing based on longest prefix matching. In this scheme, network nodes are assigned virtual coordinates and packets are forwarded towards their intended destination following a distance-decreasing...
An algorithm on automatic topology discovery in OpenFlow supported software defined networks is proposed. The proposed algorithm utilizing link layer discovery protocol allows to obtain the whole network topology by the network controller. We have validated the successful operation of our algorithm through simulation and real network tests seperately, and shown that it scales linearly.
In this paper, we report our development experience and experimentation studies of two multicast routing schemes for the Internet, namely, PIM-SSM and GCMR. We detail their implementation over the Quagga open source routing suite, as well as their experimentation tests over a large-scale topology that reproduces the Internet characteristics.
Originally defined in the 90s, multicast is nowadays (re)gaining interest given the increasing popularity of multimedia streaming/content traffic and the explosion of cloud services. In fact, multicast yields bandwidth savings complementing cached content distribution techniques and its potential benefits have been verified by studies several times since then (see e.g. [1]). By multicast routing,...
The deployment and operation of global network architectures can exhibit complex, dynamic behavior and the comprehensive validation of their properties, without actually building and running the systems, can only be achieved with the help of simulations. Packet-level models are not feasible in the Internet scale, but we are still interested in the phenomena that emerge when the systems are run in...
Content delivery networks (CDNs) deploy globally distributed systems of caches in a large number of autonomous systems (ASes). It is important for a CDN operator to satisfy the performance requirements of end users, while minimizing the cache deployment cost. In this paper, we study the cache deployment optimization (CaDeOp) problem of determining how much server, energy, and bandwidth resources to...
We propose a model for network optimization in a non-cooperative game setting with specific reference to the Internet connectivity. We refer to the general model shown in internal report [1], where Autonomous Systems (AS) decisions on link creation and traffic routing are strategically based on realistic interconnection costs, keeping into account the peering/transit dichotomy. Equilibria existence...
Media webcasting and conferencing that involve many geographically distributed participants contribute significantly to congestion in the Internet. The current usage-based data pricing model does not take into account the hidden cost imposed by media streaming in the Internet core, including the network cost of replicating and relaying traffic in video multicast, and could potentially exacerbate congestion...
This paper describes SeSaMe, an RDF-enriched self-adaptive middleware for highly dynamic and autonomic complex systems. Semantic technologies make components of a system mutually interoperable and enable them to exchange information even when they are developed and deployed on different platforms. SeSaMe uses semantics to achieve dynamic component discovery and self-configurability in the network...
The objective of this work is to suggest the self-organizing algorithm by communication nodes with topological information. This paper describes the noble concept of future Internet architecture, graph contraction based self-organizing networks and the topology-aware address. The proposed network principle abstracts logical layers from large-scale physical networks with topological characteristic...
As the Internet takes an increasingly central role in day to day communications infrastructure, the slow convergence of routing protocols after a network failure becomes a growing problem. To assure fast recovery from link and node failures in IP networks, it presents a new recovery scheme called Multiple Routing Configurations (MRC). The proposed scheme guarantees recovery in all single failure scenarios,...
Information centric networking is proposed to deal with the inefficiency of content distributions in traditional networks. It replaces the current host-centric communication paradigm with the content-centric one, so all the network devices can identify and cache the contents passed by.
Named Data Networking (NDN) is a clean slate Internet paradigm that embeds some security primitives in its original design, which is being considered as one of the promising candidates for next-generation Internet architecture. However, it may suffer from some emerging threats such as Interest Flooding Attacks (IFA), which means corresponding security management mechanisms need to be designed to improve...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.