Network


Latest external collaboration on country level. Dive into details by clicking on the dots.

Hotspot


Dive into the research topics where Andrea Detti is active.

Publication


Featured researches published by Andrea Detti.


international conference on computer communications | 2002

Impact of segments aggregation on TCP Reno flows in optical burst switching networks

Andrea Detti; Marco Listanti

We study the optical burst switching (OBS) paradigm for the support of the TCP flows in an all optical network (AON). We analyze the TCP send rate, i.e. the amount of data sent per time unit, taking into account of: (i) the burst assembly mechanism, called burstification process; (ii) the burst loss events inside the OBS network. The goals of the paper are to investigate the effect of the variation of the burstification period and to derive some general guidelines about the dimensioning of the burstification period. With respect to the case in which any assembly mechanism is missing, the results show that an accurate dimensioning of the burstification period yields negligible penalties with regard to the low speed sources and significant benefits with regard to the high speed sources.


Journal of Lightwave Technology | 2002

Performance evaluation of a new technique for IP support in a WDM optical network: optical composite burst switching (OCBS)

Andrea Detti; Vincenzo Eramo; Marco Listanti

The optical composite burst switching (OCBS) technique is proposed to be implemented in an all-optical backbone network to support Internet protocol (LP) traffic. The OCBS is based on two main features. First, several IP packets are assembled in a single macropacket, called burst. Second, the burst contention in an optical switch is handled by means of two techniques, the wavelength dimension and the burst-dropping (BD) technique. Different from traditional optical burst switching, where an entire burst is discarded when all of the output wavelengths are engaged at the arrival instant of the burst, a switch adopting the BD technique discards only the initial part of a burst finding all of the engaged output wavelengths while forwarding the final part of the burst, beginning at the instant in which one wavelength becomes free. The OCBS allows an increase in the switch throughput in terms of number of accepted IP packets because a burst contains a given number of IP packets. We introduce the analytical model that allows us to evaluate the effectiveness of the technique and, in particular, the obtained saving; furthermore, a sensitivity analysis of the saving, with respect to both the optical burst switch parameters and the traffic load, is carried out.


Computer Networks | 2012

Supporting the Web with an information centric network that routes by name

Andrea Detti; Matteo Pomposini; Nicola Blefari-Melazzi; Stefano Salsano

Information Centric Networking (ICN) is a new paradigm in which the network layer provides users with content, instead of providing communication channels between hosts, and is aware of the name (or identifiers) of the contents. A fundamental ICN operation is the routing of content requests towards a node that is able to provide the requested content. To meet this goal, different routing architectures have been proposed so far. In this paper, we consider a network that uses a routing-by-name architecture, i.e. content requests are routed on the base of the content name by using a name-based routing table. We focus on the scenario of fetching Web contents, assuming to use ICN in place of traditional TCP/IP means. In this scenario we need to handle tens of billions of name-based routes, due to the high numbers of Web contents and to the limited aggregability of their names. Consequently, re-using the existing architecture of an IP router would result in two severe problems. First, the current Forwarding Information Base (FIB) technology is unable to contain all name-based routes. Second, implementing a so large Routing Information Base (RIB) requires a very costly hardware. In order to overcome these problems, we propose a routing-by-name architecture, named Lookup-and-Cache, where the FIB is used as a cache of routes, while the RIB is stored in a remote and centralized routing engine. By analyzing real Internet traces, we prove the effectiveness of the proposed architecture, which we also show to be feasible with current technology. In fact, our ICN nodes require to have only a limited set of routes in their FIB, even when supporting a high number of traffic flows. We have implemented our proposed Lookup-and-Cache solution within the CCNx software framework and we used this implementation to assess system performance, such as download delay, lookup rate and fairness. The paper is completed with a discussion on how ICN can be used not only to fetch Web contents but also for other scenarios.


Computer Networks | 2013

Information centric networking over SDN and OpenFlow: Architectural aspects and experiments on the OFELIA testbed

Stefano Salsano; Nicola Blefari-Melazzi; Andrea Detti; Giacomo Morabito; Luca Veltri

Information Centric Networking (ICN) is a new networking paradigm in which the network provides users with content instead of communication channels between hosts. Software Defined Networking (SDN) is an approach that promises to enable the continuous evolution of networking architectures. In this paper we propose and discuss solutions to support ICN by using SDN concepts. We focus on an ICN framework called CONET, which grounds its roots in the CCN/NDN architecture and can interwork with its implementation (CCNx). Although some details of our solution have been specifically designed for the CONET architecture, its general ideas and concepts are applicable to a class of recent ICN proposals, which follow the basic mode of operation of CCN/NDN. We approach the problem in two complementary ways. First we discuss a general and long term solution based on SDN concepts without taking into account specific limitations of SDN standards and equipment. Then we focus on an experiment to support ICN functionality over a large scale SDN testbed based on OpenFlow, developed in the context of the OFELIA European research project. The current OFELIA testbed is based on OpenFlow 1.0 equipment from a variety of vendors, therefore we had to design the experiment taking into account the features that are currently available on off-the-shelf OpenFlow equipment.


international conference on networking | 2012

Transport-layer issues in information centric networks

Stefano Salsano; Andrea Detti; Matteo Cancellieri; Matteo Pomposini; Nicola Blefari-Melazzi

Content to be transported over an Information Centric Networking (ICN) infrastructure can be very variable in size, from few bytes to hundreds of gigabytes. Therefore it needs to be segmented in smaller size data units, typically called chunks, in order to be handled by ICN nodes. A chunk is the basic data unit to which caching and security (e.g. encryption and signature) functions are applied. If we consider the overhead and the number of cryptographic operations to be performed by nodes, a good choice for the chunk size would be from hundreds of KBs up to few MBs. However, if the chunk size is bigger than the Maximum Transfer Unit of a link, chunks will be fragmented. We show that if we have more than 3-4 fragments per chunk, and congestion and reliability functions are executed on a chunk by chunk basis, the efficiency of the congestion control algorithm drastically decreases. On the other side, a small chunk size would increase overhead and rate of signature checks. The contribution of this paper is twofold: 1) we propose to segment content in two levels: at the first level the content is segmented in chunks, at the second level the chunks are segmented into smaller data units, handled by an ICN specific Transport Protocol (ICTP), performing reliability and congestion control functions; 2) we propose to adopt a receiver-driven transport protocol, in which the receiver adjusts the sending rate to control congestion, we describe an implementation of this protocol, and evaluate its performance.


international conference on communications | 2012

Supporting information-centric functionality in software defined networks

Luca Veltri; Giacomo Morabito; Stefano Salsano; Nicola Blefari-Melazzi; Andrea Detti

The Information-Centric Networking (ICN) paradigm is expected to be one of the major innovation of the Future Internet An ICN can be characterized by some key components like: (i) the content-centric request/reply paradigm for data distribution, (ii) route-by-name operations, and (iii) in-network caching. In this paper we focus on a framework for ICN called CONET (COntent NETwork) and in particular on a solution devised under this framework called coCONET. coCONET characteristics make it suitable for deployment in accordance to the Software Defined Networks (SDN) philosophy. In this paper, we will describe how coCONET can be implemented over an OpenFlow (the most popular SDN instantiation, to date) network and how OpenFlow should be modified to better suit the operations of coCONET and, more in general, of ICN solutions.


world of wireless mobile and multimedia networks | 2012

Offloading cellular networks with Information-Centric Networking: The case of video streaming

Andrea Detti; Matteo Pomposini; Nicola Blefari-Melazzi; Stefano Salsano; Andrea Bragagnini

In this paper we present a cooperative video streaming application running on top of an “Information Centric Network” (ICN). The application could be used on mobile devices to offload the cellular radio interface. We demonstrate our application in a test-bed exploiting the CCNx software implementation of an ICN, the VideoLan tool and the Apple HTTP Live Streaming format.


IEEE Transactions on Wireless Communications | 2007

TCP Fairness Issues in IEEE 802.11 Networks: Problem Analysis and Solutions Based on Rate Control

Nicola Blefari-Melazzi; Andrea Detti; Ibrahim W. Habib; Alessandro Ordine; Stefano Salsano

In this paper, we study the problem of maintaining fairness for TCP connections in wireless local area networks (WLANs) based upon the IEEE 802.11 standard. Current implementations of 802.11 use the so-called distributed coordination function (DCF), which provides similar medium access priority to all stations. Although this mode of operation ensures fair access to the medium at the MAC level, it does not provide any provisions for ensuring fairness among the TCP connections. TCP unfairness may result in significant degradation of performance leading to users perceiving unsatisfactory quality of service. We propose and analyze two solutions that are capable of enabling TCP fairness with minimal additional complexity. The proposed solutions are based on utilizing a rate-control mechanism in two modes: static or adaptive. They do not require modifying existing standards at the MAC or network layers. Hence, they are fully compatible with existing devices. Our performance analysis results prove the efficaciousness of our proposed solutions in achieving TCP fairness compared to existing approaches. We have, also, implemented the proposed solutions in an ad-hoc experimental test-bed, and performed measurements to demonstrate the validity of our approach and results


wireless and mobile computing, networking and communications | 2013

Wireless Mesh Software Defined Networks (wmSDN)

Andrea Detti; Claudio Pisa; Stefano Salsano; Nicola Blefari-Melazzi

In this paper we propose to integrate Software Defined Networking (SDN) principles in Wireless Mesh Networks (WMN) formed by OpenFlow switches. The use of a centralized network controller and the ability to setup arbitrary paths for data flows make SDN a handy tool to deploy fine-grained traffic engineering algorithms in WMNs. However, centralized control may be harmful in multi-hop radio networks formed by commodity devices (e.g. Wireless Community Networks), in which node isolation and network fragmentation are not rare events. To exploit the pros and mitigate the cons, our framework uses the traditional OpenFlow centralized controller to engineer the routing of data traffic, while it uses a distributed controller based on OLSR to route: i) OpenFlow control traffic, ii) data traffic, in case of central controller failure. We implemented and tested our Wireless Mesh Software Defined Network (wmSDN) showing its applicability to a traffic engineering use-case, in which the controller logic balances outgoing traffic among the Internet gateways of the mesh. Albeit simple, this use case allows showing a possible usage of SDN that improves user performance with respect to the case of a traditional mesh with IP forwarding and OLSR routing. The wmSDN software toolkit is formed by Open vSwitch, POX controller, OLSR daemon and our own Bash and Python scripts. The tests have been carried out in an emulation environment based on Linux Containers, NS3 and CORE tools.


acm special interest group on data communication | 2013

Check before storing: what is the performance price of content integrity verification in LRU caching?

Giuseppe Bianchi; Andrea Detti; Alberto Caponi; Nicola Blefari Melazzi

In some network and application scenarios, it is useful to cache content in network nodes on the fly, at line rate. Resilience of in-network caches can be improved by guaranteeing that all content therein stored is valid. Digital signatures could be indeed used to verify content integrity and provenance. However, their operation may be much slower than the line rate, thus limiting caching of cryptographically verified objects to a small subset of the forwarded ones. How this affects caching performance? To answer such a question, we devise a simple analytical approach which permits to assess performance of an LRU caching strategy storing a randomly sampled subset of requests. A key feature of our model is the ability to handle traffic beyond the traditional Independent Reference Model, thus permitting us to understand how performance vary in different temporal locality conditions. Results, also verified on real world traces, show that content integrity verification does not necessarily bring about a performance penalty; rather, in some specific (but practical) conditions, performance may even improve.

Collaboration


Dive into the Andrea Detti's collaboration.

Top Co-Authors

Avatar

Nicola Blefari-Melazzi

University of Rome Tor Vergata

View shared research outputs
Top Co-Authors

Avatar

Stefano Salsano

University of Rome Tor Vergata

View shared research outputs
Top Co-Authors

Avatar

Nicola Blefari Melazzi

University of Rome Tor Vergata

View shared research outputs
Top Co-Authors

Avatar

Pierpaolo Loreti

University of Rome Tor Vergata

View shared research outputs
Top Co-Authors

Avatar

Giuseppe Bianchi

University of Rome Tor Vergata

View shared research outputs
Top Co-Authors

Avatar

Claudio Pisa

University of Rome Tor Vergata

View shared research outputs
Top Co-Authors

Avatar

Lorenzo Bracciale

University of Rome Tor Vergata

View shared research outputs
Top Co-Authors

Avatar

Francesco Vatalaro

University of Rome Tor Vergata

View shared research outputs
Top Co-Authors

Avatar

Marco Listanti

Sapienza University of Rome

View shared research outputs
Top Co-Authors

Avatar

Matteo Pomposini

University of Rome Tor Vergata

View shared research outputs
Researchain Logo
Decentralizing Knowledge