Demo abstract: A testbed for TCP in heterogeneous wired/wireless networks

Title in PDF: 'Demo Abstract: A Testbed for TCP in Heterogeneous Wired/Wireless Networks' (Accepted to IEEE INFOCOM 2010 Demo Session). Author's updates on 15 February 2010: "We will demonstrate our testbed in IEEE INFOCOM'10 demo session".Demo abstractTransmission Control Protocol (TCP) design in heterogeneous wired/wireless networks is challenging due to packet reordering and error-prone channels. We have implemented a testbed for evaluating the performance of TCP variants under packet reordering, congestive loss, and non-congestive loss. Our demonstration shows the flexibility of our testbed to accommodate channels of different characteristics. This facilitates the experimental study of TCP over heterogeneous networks. It also demonstrates the feature of TCP-NCL as a unified solution for effective congestion control, sequencing control, and loss recovery in heterogeneous networks.postprintThe 29th IEEE International Conference on Computer Communications (IEEE INFOCOM 2010), San Diego, CA., 14-19 March 2010

Distributed algorithms for green IP networks2012 Proceedings IEEE INFOCOM Workshops

We propose a novel distributed approach to exploit sleep mode capabilities of links in an Internet Service Provider network. Differently from other works, neither a central controller, nor the knowledge of the current traffic matrix is assumed, favoring a major step towards making sleep mode enabled networks practical in the current Internet architecture. Our algorithms are able to automatically adapt the state of network links to the actual traffic in the network. Moreover, the required input parameters are intuitive and easy to set. Extensive simulations that consider a real network and traffic demand prove that our algorithms are able to follow the daily variation of traffic, reducing energy consumption up to 70% during off peak time, with little overheads and while guaranteeing Quality of Service constraint

Path computation in multi-layer networks: Complexity and algorithms

Carrier-grade networks comprise several layers where different protocols coexist. Nowadays, most of these networks have different control planes to manage routing on different layers, leading to a suboptimal use of the network resources and additional operational costs. However, some routers are able to encapsulate, decapsulate and convert protocols and act as a liaison between these layers. A unified control plane would be useful to optimize the use of the network resources and automate the routing configurations. Software-Defined Networking (SDN) based architectures, such as OpenFlow, offer a chance to design such a control plane. One of the most important problems to deal with in this design is the path computation process. Classical path computation algorithms cannot resolve the problem as they do not take into account encapsulations and conversions of protocols. In this paper, we propose algorithms to solve this problem and study several cases: Path computation without bandwidth constraint, under bandwidth constraint and under other Quality of Service constraints. We study the complexity and the scalability of our algorithms and evaluate their performances on real topologies. The results show that they outperform the previous ones proposed in the literature.Comment: IEEE INFOCOM 2016, Apr 2016, San Francisco, United States. To be published in IEEE INFOCOM 2016, \<http://infocom2016.ieee-infocom.org/\&g

Optimal Elephant Flow Detection

Monitoring the traffic volumes of elephant flows, including the total byte count per flow, is a fundamental capability for online network measurements. We present an asymptotically optimal algorithm for solving this problem in terms of both space and time complexity. This improves on previous approaches, which can only count the number of packets in constant time. We evaluate our work on real packet traces, demonstrating an up to X2.5 speedup compared to the best alternative.Comment: Accepted to IEEE INFOCOM 201

MIX-crowds, an anonymity scheme for file retrieval systems

In this paper, we propose an anonymous scheme for file retrieval systems, MIX-Crowds, in which it is harder for an attacker to identify the requester of the file by making use of the idea of MIX [7] and Crowds [20] to establish a path from the requester to the file holder. Result shows that predecessor attack [26] is much more difficult to succeed compared with Crowds [20]. We are able to reduce the estimated number of rounds needed for successful predecessor attack for MIX-Crowds. We also propose a file transfer strategy according to file size. With such strategy, requests for small size files can be completed faster while the downloading time of large size files only increases slightly. © 2009 IEEE.published_or_final_versionThe 28th International Conference on Computer Communications (IEEE INFOCOM 2009), Rio de Janeiro, Brazil, 19-25 April 2009. In Proceedings of the IEEE Infocom, 2009, p. 1170-117

A unified approach to the performance analysis of caching systems

We propose a unified methodology to analyse the performance of caches (both isolated and interconnected), by extending and generalizing a decoupling technique originally known as Che's approximation, which provides very accurate results at low computational cost. We consider several caching policies, taking into account the effects of temporal locality. In the case of interconnected caches, our approach allows us to do better than the Poisson approximation commonly adopted in prior work. Our results, validated against simulations and trace-driven experiments, provide interesting insights into the performance of caching systems.Comment: in ACM TOMPECS 20016. Preliminary version published at IEEE Infocom 201