@conference{11572_148129,
author = {{ Segata Michele and Lo Cigno Renato and Tsai H M M and Dressler Falko }},
title = {On platooning control using IEEE 802.11p in conjunction with visible light communications},
year = {2016},
publisher = {IFIP/IEEE},
address = {IEEE Operations Center, 445 Hoes Lane, Piscataway, NJ 08854, USA},
booktitle = {12th Annual IFIP/IEEE Conference on Wireless On-demand Network Systems and Services (WONS)},
abstract = {The control of a platoon using IEEE 802.11p is an active research challenge in the field of vehicular networking and cooperative automated vehicles. IEEE 802.11p is a promising technology for direct vehicle to vehicle communication, but there are concerns about its usage for the control of platoons as it suffers packet losses due to congestion in highly dense scenarios. On the other hand, Visible Light Communication (VLC) recently gained attention as a short range technology for vehicular applications. VLC could be used to support or backup IEEE 802.11p, increasing reliability and scalability, and hence the safety of platooning systems. In this paper, we perform a large-scale simulation campaign using VLC integrated with IEEE 802.11p for platooning. We particularly demonstrate the benefits, but also the limitations, of such heterogeneous networking.},
url = {http://2016.wons-conference.org/},
pages = {1--4}
}
@conference{11572_144853,
author = { Baldesi Luca and Maccari Leonardo and Lo Cigno Renato },
title = {Optimized Cooperative Streaming in Wireless Mesh Networks},
year = {2016},
publisher = {IFIP},
address = {Vienna},
booktitle = {15th International IFIP TC6 Networking Conference},
abstract = {Peer-to-peer video streaming is a valuable technique to reduce the overhead produced by centralized and unicast-based video streaming. Key to the efficiency of a peer-topeer approach is the optimization of the logical distribution topology (the overlay with respect to the underlying network, the underlay). This work studies peer-to-peer streaming in wireless mesh networks for which the underlay is known. We propose an optimized, cross-layer approach to build the peer-to-peer distribution overlay minimizing the impact on the underlay. We design an optimal strategy, which is proven to be NP-complete, and thus not solvable with a distributed, light weight protocol. The optimal strategy is relaxed exploiting the knowledge of the betweenness centrality of the underlay nodes, obtaining two easily implementable solutions applicable to any link-state routing protocol. Simulation and emulation results (experimenting with real applications on a network emulated with the Mininet framework) support the theoretical findings, showing that the relaxed implementations are reasonably close to the optimal solution, and provide vast gains compared to the traditional overlay topology based on Erdös-Rényi models that a peer-to-peer application would build.},
pages = {350--358}
}
@conference{11572_148189,
author = { Maccari Leonardo and Lo Cigno Renato },
title = {Pop-routing: Centrality-based tuning of control messages for faster route convergence},
year = {2016},
publisher = {IEEE},
address = {IEEE Operations Center, 445 Hoes Lane, Piscataway, NJ 08854, USA},
booktitle = {35th Annual IEEE International Conference on Computer Communications (INFOCOM)},
abstract = {Fast and efficient recovery from node failure, with minimal disruption of routes and the consequent traffic loss is of the utmost importance for any routing protocol. Link-state protocols, albeit preferred to distance vector ones because of faster convergence, still suffer from a trade-off between control message overhead and performance. This work formalizes the routes' disruption following a node failure as an optimization problem depending on the nodes' centrality in the topology, constrained to a constant signaling overhead. Next, it shows that the solution can be found using Lagrange Multipliers. The solution complexity is low enough to be computed on-line on the network routers, thus obtaining the optimal setting of control message timers that minimize the traffic loss following a node failure. The gain obtained is quantified in power-law synthetic topologies, and it is also tested on real network topologies extending the OLSR protocol to use the modified timers, showing that the inevitable approximations introduced in the analysis do not hamper the very good results achievable through this novel approach. The technique can be applied to any link state protocol, including OSPF, and improves route convergence not only upon failures but on every topology modification.},
url = {http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=7524407},
doi = {10.1109/INFOCOM.2016.7524407},
pages = {1--9}
}
@conference{11572_119005,
author = { Santini S and Salvi A and Valente A S and Pescapè A and Segata M and Lo Cigno R },
title = {A Consensus-based Approach for Platooning with Inter-Vehicular Communications},
year = {2015},
publisher = {IEEE},
address = {Piscattaway, NJ, USA},
booktitle = {34th IEEE Conference on Computer Communications (INFOCOM 2015)},
abstract = {Automated and coordinated vehicles' driving (platooning) is gaining more and more attention today and it represents a challenging scenario heavily relying on wireless Inter-Vehicular Communication (IVC). In this paper, we propose a novel controller for vehicle platooning based on consensus. Opposed to current approaches where the logical control topology is fixed a priori and the control law designed consequently, we design a system whose control topology can be reconfigured depending on the actual network status. Moreover, the controller does not require the vehicles to be radar equipped and automatically compensates outdated information caused by network delays. We define the control law and analyze it in both analytical and simulative way, showing its robustness in different network scenarios. We consider three different wireless network settings: uncorrelated Bernoullian losses, correlated losses using a Gilbert-Elliott channel, and a realistic traffic scenario with interferences caused by other vehicles. Finally, we compare our strategy with another state of the art controller. The results show the ability of the proposed approach to maintain a stable string of vehicles even in the presence of strong interference, delays, and fading conditions, providing higher comfort and safety for platoon drivers.},
url = {http://infocom2015.ieee-infocom.org/},
doi = {10.1109/INFOCOM.2015.7218490},
pages = {1158--1166}
}
@article{11572_98037,
author = { Leonardo Maccari and Renato Lo Cigno },
title = {A week in the life of three large Wireless Community Networks},
year = {2015},
journal = {AD HOC NETWORKS},
volume = {24},
abstract = {Wireless Community Networks (WCNs) are created and managed by a local community with the goal of sharing Internet connection and offering local services. This paper analyses the data collected on three large WCNs, ranging from 131 to 226 nodes, and used daily by thousands of people. We first analyse the topologies to get insights in the fundamental properties, next we concentrate on two crucial aspects: (i) the routing layer and (ii) metrics on the centrality of nodes and the network robustness. All the networks use the Optimized Link State Routing (OLSR) protocol extended with the Expected Transmission Count (ETX) metric. We analyse the quality of the routes and two different techniques to select the Multi-Point Relay (MPR) nodes. The centrality and robustness analysis shows that, in spite of being fully decentralized networks, an adversary that can control a small fraction of carefully chosen nodes can intercept up to 90% of the traffic. The collected data-sets are available as Open Data, so that they can be easily accessed by any interested researcher, and new studies on different topics can be performed. In fact, WCN are just an example of large wireless mesh networks, so our methodology can be applied to any other large mesh network, including commercial ISP networks. © 2014 Elsevier B.V. All rights reserved.},
url = {http://www.sciencedirect.com/science/article/pii/S1570870514001474},
doi = {10.1016/j.adhoc.2014.07.016},
pages = {175--190}
}
@article{11572_126555,
author = { Stefan Joerer and Bastian Bloessl and Michele Segata and Christoph Sommer and Renato Lo Cigno and Abbas Jamalipour and Falko Dressler },
title = {Enabling Situation Awareness at Intersections for IVC Congestion Control Mechanisms},
year = {2015},
journal = {IEEE TRANSACTIONS ON MOBILE COMPUTING},
volume = {PP (pre-print on-line)},
abstract = {IAS aim to assist road users in avoiding collisions at intersections, either by warning the driver or by triggering automated actions. Such a system can be realized based on passive scanning only (e.g., using LiDAR) or supported by active IVC. The main reason to use IVC is its ability to provide situation awareness even when a possible crash candidate is not yet in visual range. The IVC research community has identified beaconing, i.e., one-hop broadcast, as the primary communication primitive for vehicular safety applications. Recently, adaptive beaconing approaches have been studied and different congestion control mechanisms have been proposed to cope with the diverse demands of vehicular networks. In this paper, we show that current state-of-the-art congestion control mechanisms are not able to support IAS adequately. Specifically, current approaches fail due to their inherent fairness postulation, i.e., they lack fine grained prioritization. We propose a solution that extends congestion control mechanisms by allowing temporary exceptions for vehicles in dangerous situations, that is, situation-based rate adaptation. We show the applicability for two state-of-the-art congestion control mechanisms, namely TRC and DynB, in two different vehicular environments, rural and downtown.},
keywords = {Congestion Control; Inter-Vehicle Communication; Intersection Assistance System; Vehicular Ad Hoc Network; Acceleration; Computer aided manufacturing; Safety; Vehicle crash testing},
url = {http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=7229341},
doi = {10.1109/TMC.2015.2474370},
pages = {1--12}
}
@article{11572_124861,
author = { Pederzolli Federico and Siracusa Domenico and Lo Cigno Renato and Salvadori Elio },
title = {Energy Saving Through Traffic Profiling in Self-Optimizing Optical Networks},
year = {2015},
journal = {IEEE SYSTEMS JOURNAL},
volume = {PP},
abstract = {An increasing fraction of the electrical energy produced in western countries is being consumed by Internet infrastructure; reducing its energy footprint is therefore of utmost importance for the scalability of the Internet. We address optical transport backbones and propose a novel method to reduce the energy consumed by dynamically adjusting the number of active optical carriers to support the short-term load of the network with a small and controllable margin. This is achieved in a nondisruptive manner that does not interact with routing strategies and does not rely on any specific control plane, but exploits automated traffic profiling and prediction of the well-known circadian traffic cycle. The proposed approach works with both fixed and flexible grid optical networks. We describe a method to automatically learn these patterns and multiple techniques to predict incoming traffic. Furthermore, we present an algorithm that tunes the parameters of the proposed system in order to achieve a target a posteriori probability of causing traffic losses. The behavior of the system is studied, using simulations, under a variety of conditions. Results show that the proposed prediction algorithms can significantly reduce the number of active optical carriers, even in nonoptimal scenarios, while guaranteeing low traffic losses.},
url = {http://ieeexplore.ieee.org/xpl/articleDetails.jsp?reload=true&arnumber=7274675},
doi = {10.1109/JSYST.2015.2476559},
pages = {1--14}
}
@article{11572_126549,
author = { Luca Baldesi and Leonardo Maccari and Renato Lo Cigno },
title = {Improving P2P streaming in Wireless Community Networks},
year = {2015},
journal = {COMPUTER NETWORKS},
volume = {93, Part 2},
abstract = {Abstract Wireless Community Networks (WCNs) are bottom-up broadband networks empowering people with their on-line communication means. Too often, however, services tailored for their characteristics are missing, with the consequence that they have worse performance than what they could. We present here an adaptation of an Open Source P2P live streaming platform that works efficiently, and with good application-level quality, over WCNs. \WCNs links are normally symmetric (unlike standard ADSL access), and a WCN topology is local and normally flat (contrary to the global Internet), so that the P2P overlay used for video distribution can be adapted to the underlaying network characteristics. We exploit this observation to derive overlay building strategies that make use of cross-layer information to reduce the impact of the P2P streaming on the WCN while maintaining good application performance. We experiment with a real application in real WCN nodes, both in the Community-Lab provided by the CONFINE EU Project and within an emulation framework based on Mininet, where we can build larger topologies and interact more efficiently with the mesh underlay, which is unfortunately not accessible in Community-Lab. The results show that, with the overlay building strategies proposed, the P2P streaming applications can reduce the load on the WCN to about one half, also equalizing the load on links. At the same time the delivery rate and delay of video chunks are practically unaffected.},
keywords = {Wireless Community Networks; P2P live streaming; Video streaming; Topology optimization; Cross-layer design; Performance evaluation},
url = {http://www.sciencedirect.com/science/article/pii/S1389128615003448},
doi = {http://dx.doi.org/10.1016/j.comnet.2015.09.024},
pages = {389--403}
}
@conference{11572_126553,
author = { Michele Segata and Falko Dressler and Renato Lo Cigno },
title = {Jerk Beaconing: A Dynamic Approach to Platooning},
year = {2015},
publisher = {IEEE},
address = {Piscattaway, NJ, USA},
booktitle = {7th IEEE Vehicular Networking Conference (VNC 2015)},
abstract = {Automated car following, or platooning, is a promising Inter-Vehicle Communication (IVC) application which has the potential of reducing traffic jams, improving safety, and decreasing fuel consumption by forming groups of vehicles which autonomously follow a common leader. The application works by sharing vehicles' data through high frequency periodic beaconing which, due to channel congestion, might not work in highly dense scenarios. To address this issue, in this paper we propose a dynamic approach called Jerk Beaconing which exploits vehicle dynamics to share data only when needed. The results, compared to a commonly assumed 10Hz beaconing, show huge benefits in term of network resource saving. Moreover, our approach outperforms static beaconing in terms of safety as well, as it is able to keep inter-vehicle distance closer to the desired gap even in highly demanding scenarios.},
url = {http://www.ieee-vnc.org/},
pages = {1--8}
}
@conference{11572_124720,
author = { Maccari Leonardo and Baldesi Luca and Lo Cigno Renato and Forconi Jacopo and Caiazza Alessio },
title = {Live Video Streaming for Community Networks, Experimenting with PeerStreamer on the Ninux Community},
year = {2015},
publisher = {ACM},
address = {New York, NY, USA},
booktitle = {Proceedings of the 2015 Workshop on Do-it-yourself Networking: An Interdisciplinary Approach (DIYNetworking '15)},
abstract = {Networks, due to the affinity to both technical and social characteristics of such networks. It can help binding together communities, it provides a good means for inclusion of people as well to deliver information and local events. Video streaming in community networks is still problematic; this work describes a project for the adaptation of PeerStreamer, an open source peer-to-peer video streaming platform, to an existing Community Network in the city of Florence, Italy. The paper exposes the motivations that make PeerStreamer a perfect match with the philosophy and the technical features of a community network and describes how the community network of Florence can be a very good testbed given the mixture of technical and social skills that animate it. The proposed adaptation and implementation exploits a so-far underused feature of PeerStreamer: the possibility of separating the streaming engine from the play-out part on different hosts. This feature makes it possible to install the streaming engine, which is very efficient and has a very small memory footprint, directly on the community network routing nodes, so that the streaming topology can be adapted to the community network topology by directly accessing routing information. On the other hand, the player can run on standard PCs and use standard streaming protocols to access the stream.},
keywords = {community networks, p2p video streaming, wireless mesh networks},
url = {http://www.sigmobile.org/mobisys/2015/},
doi = {10.1145/2753488.2753491},
pages = {1--6}
}
@misc{11572_108894,
author = { Ferdous Raihana and Cigno Renato Lo and Zorat Alessandro },
title = {Message Level SIP Anomaly Detection: Configuration and Measures Setup},
year = {2015},
publisher = {University of Trento},
address = {Trento},
abstract = {A message level SIP anomaly detection architecture that analyses SIP messages to classify them as “good” or “bad” depending on their structure and content is proposed in [1, 2]. Though these papers contain a detailed discussion on the motivation of the work and development of the architecture, technical details of the system architecture are discussed very briefly. This report fills that gap and contains discussions of several technical aspects, such as, feature selection and dataset preparation, which are fundamental for the efficient and precise classification. It also includes download links of our developed applications and sample data, which are freely available for the community. Moreover, guidelines to configure the application and to perform experiments with the developed applications are included.},
pages = {1--24}
}
@article{11572_124850,
author = { Stefano Traverso and Luca Abeni and Robert Birke and Csaba Kiraly and Emilio Leonardi Lo Cigno Renato and Marco Mellia },
title = {Neighborhood Filtering Strategies for Overlay Construction in P2P-TV Systems: Design and Experimental Comparison},
year = {2015},
journal = {IEEE-ACM TRANSACTIONS ON NETWORKING},
volume = {23},
abstract = {Peer-to-peer live-streaming (P2P-TV) systems' goal is disseminating real-time video content using peer-to-peer technology. Their performance is driven by the overlay topology, i.e., the virtual topology that peers use to exchange video chunks. Several proposals have been made in the past to optimize it, yet few experimental studies have corroborated results. The aim of this paper is to provide a comprehensive experimental comparison based on PeerStreamer in order to benchmark different strategies for the construction and maintenance of the overlay topology in P2P-TV systems. We present only experimental results in which fully distributed strategies are evaluated in both controlled experiments and the Internet using thousands of peers. Results confirm that the topological properties of the overlay have a deep impact on both user quality of experience and network load. Strategies based solely on random peer selection are greatly outperformed by smart yet simple and actually implementable strategies. The most performing strategy we devise guarantees to deliver almost all chunks to all peers with a playout delay as low as 6 s even when system load approaches 1, and in almost adversarial network scenarios. PeerStreamer is open-source to make results reproducible and allow further research by the community.},
keywords = {overlay networks;peer-to-peer computing;telecommunication network topology;television broadcasting;video streaming;Internet;P2P-TV systems;Peer Streamer;design comparison;experimental comparison;neighborhood filtering strategies;overlay construction;overlay topology;peer-to-peer live-streaming;peer-to-peer technology;topological properties;video chunks;video content;virtual topology;Bandwidth;Benchmark testing;Measurement;Network topology;Peer-to-peer computing;Streaming media;Topology;Overlay networks;peer-to-peer computing;streaming media},
url = {http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6766806},
doi = {10.1109/TNET.2014.2307157},
pages = {741--754}
}
@article{11572_98041,
author = { S Joerer and M Segata and B Bloessl and R Lo Cigno and C Sommer and F Dressler },
title = {A Vehicular Networking Perspective on Estimating Vehicle Collision Probability at Intersections},
year = {2014},
journal = {IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY},
volume = {63},
abstract = {Finding viable metrics to assess the effectiveness of Intelligent Transportation Systems (ITS) in terms of ‘safety’ is one of the major challenges in vehicular networking research. We aim to provide a metric, an estimation of the vehicle collision probability at intersections, that can be used for evaluating Inter- Vehicle Communication (IVC) concepts. In the last years, the vehicular networking community reported in several studies that safety enhancing protocols and applications cannot be evaluated based only on networking metrics like delays and packet loss rates. We present an evaluation scheme that addresses this need by quantifying the probability of a future crash, depending on the situation in which a vehicle is receiving a beacon message (e.g., a CAM or a BSM). Thus, our criticality metric also allows for fully distributed situation assessment. We investigate the impact of safety messaging between cars approaching an intersection using a modified road traffic simulator that allows selected vehicles to disregard traffic rules. As direct result we show that simple beaconing is not as effective as anticipated in suburban environments. More profoundly, however, our simulation results reveal more details about the timeliness (regarding the criticality assessment) of beacon messages, and as such, can be used to develop more sophisticated beaconing solutions.},
doi = {10.1109/TVT.2013.2287343},
pages = {1802--1812}
}
@article{11572_67217,
author = { L Maccari and R Lo Cigno },
title = {Betweenness estimation in OLSR-based multi-hop networks for distributed filtering},
year = {2014},
journal = {JOURNAL OF COMPUTER AND SYSTEM SCIENCES},
volume = {80},
abstract = {In traditional networks special efforts are put to secure the perimeter with firewalls: particular routers that analyze and filter the traffic to separate zones with different levels of trust. In wireless multi-hop networks the perimeter is a concept extremely hard to identify, thus, it is much more effective to enforce control on the nodes that will route more traffic. But traffic filtering and traffic analysis are costly activities for the limited resources of mesh nodes, so a trade-off must be reached limiting the number of nodes that enforce them. This work shows how, using the OLSR protocol, the centrality of groups of nodes with reference to traffic can be estimated with high accuracy independently of the network topology or size. We also show how this approach greatly limits the impact of an attack to the network using a number of firewalls that is only a fraction of the available nodes.},
url = {http://www.sciencedirect.com/science/article/pii/S002200001300127X},
doi = {10.1016/j.jcss.2013.06.018},
pages = {670--685}
}
@conference{11572_98031,
author = { D Siracusa and F Pederzolli and R Lo Cigno and E Salvadori },
title = {Energy Saving Through Traffic Profiling and Prediction in Self-Optimizing Optical Networks},
year = {2014},
publisher = {Optical Society of America},
address = {San Francisco, CA, US},
booktitle = {Optical Fiber Communication Conference and Exposition (OFC)},
abstract = {A method that automatically learns and predicts the traffic behavior to save energy by adjusting the number of active optical carriers is presented. Simulations prove it provides large savings and ensures low traffic loss probability.},
keywords = {Networks, Networks; network optimization},
url = {http://www.opticsinfobase.org/abstract.cfm?URI=OFC-2014-W4H.1},
doi = {10.1364/OFC.2014.W4H.1}
}
@conference{11572_98039,
author = { S Joerer and B Bloessl and M Segata and C Sommer and R Lo Cigno and F Dressler },
title = {Fairness Kills Safety: A Comparative Study for Intersection Assistance Applications},
year = {2014},
publisher = {IEEE},
address = {USA},
booktitle = {25th IEEE International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC 2014)},
url = {http://www.ieee-pimrc.org/2014/`},
pages = {1442--1447}
}
@article{11572_101496,
author = { C Sommer and S Joerer and M Segata and O K Tonguz and R Lo Cigno and F Dressler },
title = {How Shadowing Hurts Vehicular Communications and How Dynamic Beaconing Can Help},
year = {2014},
journal = {IEEE TRANSACTIONS ON MOBILE COMPUTING},
volume = {pp},
abstract = {We study the effect of radio signal shadowing dynamics, caused by vehicles and by buildings, on the performance of beaconing protocols in Inter-Vehicular Communication (IVC). Recent research indicates that beaconing, i.e., one hop message broadcast, shows excellent characteristics and can outperform other communication approaches for both safety and efficiency applications, which require low latency and wide area information dissemination, respectively. To mitigate the broadcast storm problem, adaptive beaconing solutions have been proposed and designed. We show how shadowing dynamics of moving obstacles hurt IVC, reducing the performance of beaconing protocols. To the best of our knowledge, this is one of the first studies on identifying the problem and the underlying challenges and proposing the opportunities presented by such challenges. Shadowing also limits the risk of overloading the wireless channel. We demonstrate how these challenges and opportunities can be taken into account and outline a novel approach to dynamic beaconing. It provides low-latency communication (i.e., very short beaconing intervals), while ensuring not to overload the wireless channel. The presented simulation results substantiate our theoretical considerations.},
url = {http://ieeexplore.ieee.org/xpl/articleDetails.jsp?tp=&arnumber=6920079&queryText%3D10.1109%2FTMC.2014.2362752},
doi = {10.1109/TMC.2014.2362752},
pages = {1--12}
}
@conference{11572_98030,
author = { L Baldesi and L Maccari and R Lo Cigno },
title = {Improving P2P Streaming in Community-Lab Through Local Strategies},
year = {2014},
publisher = {IEEE},
address = {Larnaca, Cyprus},
booktitle = {10th IEEE International Conference on Wireless and Mobile Computing, Networking and Communications},
abstract = {Distributing live streaming in Wireless Community Networks (WCNs) is a service with a high added value; however, cloud-based streaming, as commonly used in the Internet, does not fit well the architecture of WCNs, which often have restricted access to the Internet. Modern WCNs, instead, can have a good internal connectivity with high bandwidth. A P2P approach is thus well matched for streaming in WCNs. This paper presents experimental results obtained with PeerStreamer running on top of Community-Lab, a test-bed realized by the CONFINE EU Project for the experimentation of novel protocols in community networks. The experiments highlight relevant differences between a WCN and the Internet, and we propose strategies that can be implemented on all the peers or even only locally on the source to improve the streaming quality. These strategies are based on simple heuristics and can be activated dynamically when the streaming quality degrades below a given threshold.},
url = {http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6962146},
url = {http://research.ac.upc.edu/CNBuB2014/},
doi = {10.1109/WiMOB.2014.6962146},
pages = {33--39}
}
@conference{11572_98036,
author = { L Baldesi and L Maccari and R Lo Cigno },
title = {Live P2P streaming in CommunityLab: Experience and Insights},
year = {2014},
publisher = {IEEE},
address = {USA},
booktitle = {13th IEEE Annual Mediterranean Ad Hoc Networking Workshop (MED-HOC-NET)},
abstract = {Wireless Community Networks (WCNs) are flourishing as a means of providing Internet access, but most of all as an alternative, bottom-up approach to reduce the digital divide and empower the users with control on their network. Video streaming and conferencing are among the most resource hungry and critical networked applications, and their support on WCNs is fundamental, but difficult as Wireless Community Network (WCN) environments are normally less resource-rich than the traditional Internet. This work presents an initial analysis of an experimental activity with Peer Streamer, a P2P video streaming platform, on the Community-Lab, the WCN testbed of the EU FIRE project CONFINE. The results we present shed light on several different aspects, some good, some other less, of video streaming on WCNs. The experiments highlight the feasibility of P2P video streaming, but they also show that the streaming platform must be tailored ad-hoc for the WCN itself to be able to fully adapt and exploit its features and overcome its limitations. On the other hand, the experiments also show that Community-Lab is not yet fully representative of a WCN, and specifically of those that participate in CONFINE.},
url = {http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6849101},
doi = {10.1109/MedHocNet.2014.6849101},
pages = {23--30}
}
@article{11572_98033,
author = { S Traverso and L Abeni and R Birke and C Kiraly and E Leonardi and R Lo Cigno and M Mellia },
title = {Neighborhood Filtering Strategies for Overlay Construction in P2P-TV Systems: Design and Experimental Comparison},
year = {2014},
journal = {IEEE-ACM TRANSACTIONS ON NETWORKING},
volume = {online first},
abstract = {Peer-to-peer live-streaming (P2P-TV) systems' goal is disseminating real-time video content using peer-to-peer technology. Their performance is driven by the overlay topology, i.e., the virtual topology that peers use to exchange video chunks. Several proposals have been made in the past to optimize it, yet few experimental studies have corroborated results. The aim of this paper is to provide a comprehensive experimental comparison based on PeerStreamer in order to benchmark different strategies for the construction and maintenance of the overlay topology in P2P-TV systems. We present only experimental results in which fully distributed strategies are evaluated in both controlled experiments and the Internet using thousands of peers. Results confirm that the topological properties of the overlay have a deep impact on both user quality of experience and network load. Strategies based solely on random peer selection are greatly outperformed by smart yet simple and actually implementable strategies. The most performing strategy we devise guarantees to deliver almost all chunks to all peers with a playout delay as low as 6 s even when system load approaches 1, and in almost adversarial network scenarios. PeerStreamer is open-source to make results reproducible and allow further research by the community.},
keywords = {Bandwidth; Benchmark testing; Measurement; Network topology; Peer-to-peer computing; Streaming media; Topology; Overlay networks},
url = {http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6766806},
doi = {10.1109/TNET.2014.2307157},
pages = {1--14}
}
@conference{11572_101495,
author = { M Segata and S Joerer and B Bloessl and C Sommer and F Dressler and R Lo Cigno },
title = {PLEXE: A Platooning Extension for Veins},
year = {2014},
publisher = {IEEE},
address = {USA},
booktitle = {6th IEEE Vehicular Networking Conference (VNC 2014)},
abstract = {Cooperative driving in general and Cooperative Adaptive Cruise Control (CACC) or platooning in particular require blending control theory, communications and networking, as well as mechanics and physics. Given the lack of an integrated modeling framework and theory as well as the prohibitively high costs of using prototypes for what-if studies, simulation remains the fundamental instrument to evaluate entire cooperative driving systems. This work presents Plexe, an Open Source extension to Veins that offers researchers a simulation environment able to run experiments in realistic scenarios, taking into account physics and mechanics of the vehicles, communications and networking impairments, and Inter-Vehicle Communication (IVC) protocol stacks. Plexe is easily extensible and already implements protocols to support platooning and cooperative driving applications and several state of the art cruise control models. We describe the structure of the simulator and the control algorithms that Plexe implements and provide two use cases which show the potential of our framework as a powerful research tool for cooperative driving systems.},
url = {http://ieeexplore.ieee.org/xpl/login.jsp?tp=&arnumber=7013309&url=http%3A%2F%2Fieeexplore.ieee.org%2Fiel7%2F6999007%2F7013298%2F07013309.pdf%3Farnumber%3D7013309},
doi = {10.1109/VNC.2014.7013309},
pages = {53--60}
}
@conference{11572_101514,
author = { D Siracusa and F Pederzolli and E Salvadori and R Lo Cigno and I T Monroy },
title = {Proactive restoration of slow-failures in optical networks},
year = {2014},
publisher = {IEEE},
address = {USA},
booktitle = {16th International Conference on Transparent Optical Networks (ICTON)},
abstract = {Current optical networks, while offering outstanding reliability, still suffer from occasional failures. A resource-efficient procedure to handle these failures in un-protected scenarios is to perform restoration, i.e., to dynamically setup a backup lightpath after the primary one stops working, which leads to traffic losses while such operation completes. In this paper we propose a technique, applicable to optical networks with centralized control, to better handle failures with slow transients. The idea is to proactively perform the backup lightpath's setup, triggered by either a fixed or an adaptive threshold. The latter is chosen so as to balance the need of offsetting the setup time with the need of preventing unnecessary setups. Simulations show that the adaptive threshold provides better performance than the fixed one, in terms of both timely restorations and unnecessary setup operations.},
url = {http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6876450},
doi = {10.1109/ICTON.2014.6876450},
pages = {1--4}
}
@conference{11572_98032,
author = { A Kandalintsev and Renato Lo Cigno and D Kliazovich and P Bouvry },
title = {Profiling Cloud Applications with Hardware Performance Counters},
year = {2014},
publisher = {IEEE},
address = {USA},
booktitle = {KIISE/IEEE 28th International Conference on Information Networking},
abstract = {Virtualization is a key enabler technology for cloud computing. It allows applications to share computing, memory, storage, and network resources. However, physical resources are not standalone and the server infrastructure is not homogeneous. The CPU cores are commonly connected to the shared memory, caches, and computational units. As a result, the performance of cloud applications can be greatly affected if, while being executed at different computing cores, they compete for the same shared cache or network resource. The performance degradation can be as high as 50%. In this work we present a methodology which predicts the performance problems of cloud applications during their concurrent execution by looking at the hardware performance counters collected during their standalone execution. The proposed methodology fosters design of novel solutions for efficient resource allocation and scheduling.},
url = {http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6799664},
doi = {10.1109/ICOIN.2014.6799664},
pages = {52--57}
}
@conference{11572_98034,
author = { M Segata and B Bloessl and S Joerer and F Dressler and R Lo Cigno },
title = {Supporting platooning maneuvers through IVC: An initial protocol analysis for the JOIN maneuver},
year = {2014},
publisher = {IEEE},
address = {USA},
booktitle = {11th IEEE/IFIP Conference on Wireless On-demand Network Systems and Services (WONS)},
abstract = {Driving vehicles in platoons has the potential to improve traffic efficiency, increase safety, reduce fuel consumption, and make driving experience more enjoyable. A lot of effort is being spent in the development of technologies, like radars, enabling automated cruise control following and ensuring emergency braking if the driver does not react in time; but these technologies alone do not empower real platooning. The initial idea of building dedicated infrastructures for platoons, has been set aside favouring the philosophy that foresees scenarios, where automated vehicles share the road with human-driven ones. This arises interesting new questions regarding the interactions between the two categories of vehicles. In this paper we focus on the analysis of interferences caused by non-automated vehicles during a JOIN maneuver. We define the application layer protocol to support the maneuver, together with situations that can prevent successful termination, and describe how they can be detected. The validity of the approach is proven by means of simulations, showing either that the maneuver can successfully be performed, or safely be aborted. Finally, we analyze the impact of the Packet Error Rate (PER) on the failure rate of the maneuver, showing that packet losses mainly affect the maneuver from a coordination point of view, rather than stability of the system, i.e., even at high loss rates, cars never violated a minimum safety distance.},
url = {http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6814733},
doi = {10.1109/WONS.2014.6814733},
pages = {130--137}
}
@conference{11572_101494,
author = { M Segata and B Bloessl and S Joerer and C Sommer and M Gerla and R Lo Cigno and F Dressler },
title = {Towards Inter-Vehicle Communication Strategies for Platooning Support},
year = {2014},
publisher = {IEEE},
address = {USA},
booktitle = {7th IFIP/IEEE International Workshop on Communication Technologies for Vehicles (Nets4Cars 2014-Fall)},
abstract = {Platooning, the idea of cars autonomously following their leaders to form a road train, has huge potentials to improve traffic flow efficiency and, most importantly, road traffic safety. Wireless communication is a fundamental building block - it is needed to manage and to maintain the platoons. To keep the system stable, strict constraints in terms of update frequency and reliability must be met. We developed communication strategies by explicitly taking into account the requirements of the controller, exploiting synchronized communication slots as well as transmit power adaptation. The proposed approaches are compared to two state of the art adaptive beaconing protocols that have been designed for generic message dissemination. Our simulation models have been parametrized and validated by means of real-world experiments. We clearly show how taking into account specific requirements can be extremely beneficial even in very crowded freeway scenarios.},
url = {http://ieeexplore.ieee.org/xpl/login.jsp?tp=&arnumber=7000903&url=http%3A%2F%2Fieeexplore.ieee.org%2Fxpls%2Fabs_all.jsp%3Farnumber%3D7000903},
doi = {10.1109/Nets4CarsFall.2014.7000903},
pages = {1--6}
}
@conference{11572_98038,
author = { Renato Lo Cigno and Leonardo Maccari },
title = {Urban Wireless Community Networks: Challenges and Solutions for Smart City Communications},
year = {2014},
publisher = {IEEE},
address = {USA},
booktitle = {ACM International Workshop on Wireless and Mobile Technologies for Smart Cities (WiMobCity '14), part of MobiHoc 2014},
abstract = {s a different (from the global Internet and Cellular Networks) model for urban communications and networking conceivable? Can Community Networks, now flourishing in many parts of Europe and the world, be the next 'big thing' in networking, for once considering the needs of people and urban evolution as a key element, and not as a side effect of technology or business? This paper discusses recent evolutions of Community Networks in Urban Areas, blending the technical analysis of their topology and evolution, together with grand challenges ahead and the need for a novel, trans-disciplinary science that can guide the design of the future communication space for smart cities and beyond.},
url = {http://dl.acm.org/citation.cfm?id=2633669},
url = {http://doi.acm.org/10.1145/2633661.2633669},
doi = {10.1145/2633661.2633669},
pages = {49--54}
}
@article{11572_101512,
author = { C S Kang and T D Nguyen and J Kim and R Lo Cigno },
title = {A Downlink Load Control Scheme with a Dynamic Load Threshold and Virtual Coverage Management for Two-Tier Femtocell Networks},
year = {2013},
journal = {TRANSACTIONS ON INTERNET AND INFORMATION SYSTEMS},
volume = {7},
abstract = {This paper proposes a dynamic downlink load control scheme that jointly employs dynamic load threshold management and virtual coverage management schemes to reduce the degree of performance degradation due to traffic overload in two-tier femtocell networks. With the proposed scheme, the downlink load in a serving macrocell is controlled with a load threshold which is adjusted dynamically depending on the varying downlink load conditions of neighboring macrocells. In addition, traffic overloading is alleviated by virtually adjusting the coverage of the overloaded serving macrocell, based on the adjusted load threshold of the serving macrocell. Simulation results show that the proposed scheme improves the performance of two-tier femtocell networks in terms of the outage probability and sum throughput. This improvement is significantly increased with appropriate values of load thresholds and with an intermediate-level adjustment of the virtual coverage area (i.e., handover hysteresis margin: HOM). Furthermore, the proposed scheme outperforms both a previously proposed load control scheme with a static load threshold and the LTE system without a HOM adjustment.},
url = {http://dx.doi.org/10.3837/tiis.2013.11.003},
doi = {10.3837/tiis.2013.11.003},
pages = {2597--2615}
}
@article{11572_67221,
author = { Michele Segata and Renato Lo Cigno },
title = {Automatic Emergency Braking: Realistic Analysis of Car Dynamics and Network Performance},
year = {2013},
journal = {IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY},
volume = {62},
abstract = {Safety applications are among the key drivers in VANET research, and their true performance can be assessed only if the application and the communication network are jointly considered. This work presents a simulation study of an emergency braking application accomplished by embedding mobility, cars’ dynamic, and drivers’ behavior models into a detailed networking simulator (ns-3). The overall system allows capturing the interactions of the communications with the car’s automated braking mechanism and the driver’s behavior. At the same time yields very detailed information on the communication level. Besides the integrated tool, the paper presents a novel and simple message aggregation mechanism to empower message re-propagation while controlling the network congestion during the peak load due to the emergency braking. Next it discusses the effectiveness of such applications as a function of the market penetration rate, showing that even cars that are not equipped with communication devices benefit from the smoother and earlier reaction of the cars that can communicate. Fading phenomena and sensitivity to the radio transmitted power are analyzed, while fine grained dynamics of cars’ collisions as taking into account different masses and different elastic coefficients are introduced to evaluate the severity of impacts.},
keywords = {Acceleration; Accidents; Protocols; Safety; Vehicle dynamics; Vehicles; Vehicular ad hoc networks; VANET; automated braking system; emergency braking control; ns-3 simulation; rebroadcast schemes; vehicular networks},
url = {http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6576926},
doi = {10.1109/TVT.2013.2277802},
pages = {4150--4161}
}
@conference{11572_67216,
author = { C Sommer and S Joerer and M Segata and Ozan K Tonguz and R Lo Cigno and F Dressler },
title = {How Shadowing Hurts Vehicular Communications and How Dynamic Beaconing Can Help},
year = {2013},
publisher = {IEEE},
address = {Turin, Italy},
booktitle = {32nd IEEE Conference on Computer Communications (INFOCOM 2013)},
abstract = {We study the effect of radio signal shadowing dynamics, caused by vehicles and by buildings, on the performance of beaconing protocols in Inter-Vehicular Communication (IVC). Recent research indicates that beaconing, i.e., one hop message broadcast, shows excellent characteristics and can outperform other communication approaches for both safety and efficiency applications, which require low latency and wide area information dissemination, respectively. We show how shadowing dynamics of moving obstacles hurt IVC, reducing the performance of beaconing protocols. At the same time, shadowing also limits the risk of overloading the wireless channel. To the best of our knowledge, this is the first study identifying the problems and resulting possibilities of such dynamic radio shadowing. We demonstrate how these challenges and opportunities can be taken into account and outline a novel approach to dynamic beaconing. It provides low-latency communication (i.e., very short beaconing intervals), while ensuring not to overload the wireless channel. The presented simulation results substantiate our theoretical considerations.},
url = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=6556116},
doi = {10.1109/INFCOM.2013.6566745},
pages = {110--114}
}
@conference{11572_67214,
author = { A Russo and R Lo Cigno and I Rubin },
title = {Protocol Independent Multicast: From Wired to Wireless Networks},
year = {2013},
publisher = {IEEE},
address = {San Diego, CA, USA},
booktitle = {International Conference on Computing, Networking and Communications (ICNC 2013)},
abstract = {Multicast operations across wireless networks have received much attention, involving network architectures that range from ad-hoc networks to structured multi-hop meshes layouts.
The use for this purpose of the standard Protocol Independent Multicast (PIM) protocol suite has been dismissed as non practical, or non feasible, noting that its straightforward application across wireless networks does not function properly. In this work, we analyze the reasons why PIM standard based implementations improperly interact when employed across wireless networks.
We propose simple fixes that do not require modifications of the standard, but entail only minor modifications of the underlying implementation.
We evaluate the Dense Mode version of PIM through its implementation in a network that is modeled by using the ns-3 simulation program.
We present performance results that confirm the effective operation of the protocol, as well as identify the involved overhead levels, in mesh networks that employ fixed mesh routers and both fixed and mobile end-user/clients.},
keywords = {ad hoc networks; multicast protocols; PIM standard-based implementations; dense mode version; fixed end-user client; mobile end-user client; multicast operations; ns-3 simulation program; overhead levels; standard PIM protocol; standard protocol independent multicast protocol; structured multihop mesh layout; wireless networks; Routing protocols},
url = {http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6504156},
url = {http://www.conf-icnc.org/2013/},
doi = {10.1109/ICCNC.2013.6504156},
pages = {610--615}
}
@conference{11572_67215,
author = { A Russo and R Lo Cigno },
title = {PullCast: Peer-assisted Video Multicasting for Wireless Mesh Networks},
year = {2013},
publisher = {IEEE},
address = {Banff, AB, CA},
booktitle = {2013 10th Annual Conference on Wireless On-demand Network Systems and Services (WONS)},
abstract = {Multicast video streaming is experiencing a signifi- cant growth in wireless networks thanks to the resources provided by 4G/LTE and WiFi services. However, wireless communications are affected by attenuation, shadowing, fading, and unpredictable interference, that make multicast services extremely difficult (no ARQ). Nodes close to the streaming source (e.g., a node or an AP), however, always experience better signal quality than those farther away, so that some nodes can be expected to receive most of the stream, while others will not. In this paper we present PULLCAST, a cooperative protocol for multicast systems, where nodes receive video chunks via multicast from a streaming point, and cooperate at the application level, by building a local, lightweight, P2P overlay that support unicast recovery of chunks not correctly received via multicast. PULLCAST send 1-hop hello messages to build a local neighborhood where chunks can be retrieved sending unicast messages to “pull” a chunk form a neighbor that has it. We show that our solution improves the system performances both in scenarios where the mesh is highly structured, so that recovery of chunks is limited to the equivalent of an 802.11 BSS and in more complex scenarios where the mesh nodes offer connectivity to clients in a seamless network using a single radio channel.},
keywords = {cooperative communication; multicast protocols; overlay networks; peer-to-peer computing; radio receivers; video streaming; wireless channels; wireless mesh networks; 1-hop hello message; 4G-LTE service; IEEE 802.11 BSS; P2P overlay; PULLCAST; WiFi service; attenuation; cooperative protocol; fading; peer-assisted video streaming multicasting; seamless network; sending unicast message retrieval; shadowing; single radio channel; unicast recovery; unpredictable interference; video chunk receiver; wireless communication; wireless mesh network; IEEE 802.11 Standards; Protocols; Signal to noise ratio; Streaming media; Unicast; Routing protocols; Wireless networks},
url = {http://2013.wons-conference.org/},
url = {http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6578322},
doi = {10.1109/WONS.2013.6578322},
pages = {60--67}
}
@conference{11572_67219,
author = { M Arumaithurai and J Seedorf and M Dusi and E Monticelli and R Lo Cigno },
title = {Quality-of-Experience Driven Acceleration of Thin Client Connections},
year = {2013},
publisher = {IEEE},
address = {Cambridge, MA, US},
booktitle = {12th IEEE International Symposium on Network Computing and Applications (NCA 2013)},
keywords = {client-server systems; quality of experience; scheduling; QoE-driven scheduling; application-dependent QoE threshold; client session; delay-sensitive applications; dynamically-changing bandwidth requirements; dynamically-changing delay requirements; dynamically-changing inner applications; hybrid scheduling scheme; persistent thin-client traffic flow prioritization; preferential thin-client flow treatment; quality-of-experience; remote data-centers; statistical mechanisms; thin-client connections; thin-client deployments; thin-client protocols; traffic encryption; virtual PC; Bandwidth; Middleboxes; Protocols; Prototypes; Servers; Streaming media; CLoud Service Acceleration; Thin Client Acceleration},
url = {http://ieeexplore.ieee.org/xpl/login.jsp?tp=&arnumber=6623664&url=http%3A%2F%2Fieeexplore.ieee.org%2Fxpls%2Fabs_all.jsp%3Farnumber%3D6623664},
url = {http://www.ieee-nca.org/},
doi = {10.1109/NCA.2013.26},
pages = {203--210}
}
@conference{11572_67222,
author = { M Segata and B Bloessl and S Joerer and C Sommer and R Lo Cigno and F Dressler },
title = {Vehicle Shadowing Distribution Depends on Vehicle Type: Results of an Experimental Study},
year = {2013},
publisher = {IEEE},
address = {Boston, MA, USA},
booktitle = {5th IEEE Vehicular Networking Conference (VNC 2013)},
abstract = {Simulations play a fundamental role for the eval- uation of vehicular network communication strategies and ap- plications’ effectiveness. Therefore, the vehicular networking community is continuously seeking more realistic channel and reception models to provide more reliable results, yet maintaining scalability in terms of computational effort. We investigate the effects of vehicle shadowing on IEEE 802.11p based communica- tion. In particular, we perform a set of real world measurements on a freeway and study the impact of different obstructing vehicles on the received signal power distribution. Different vehicle types not only affect the average received power, but also its distribution, suggesting that the attenuation characteristics of the simulation model need to be tailored to the type of vehicle that is obstructs the communication path. Based on these observations, we propose a novel way to compose shadowing and fading models to reproduce the observed effects.},
url = {http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6737623},
url = {http://www.ieee-vnc.org/},
doi = {10.1109/VNC.2013.6737623},
pages = {242--245}
}
@article{11572_67218,
author = { Leonardo Maccari and Renato Lo Cigno },
title = {Waterwall: a cooperative, distributed firewall for wireless mesh networks},
year = {2013},
journal = {EURASIP JOURNAL ON WIRELESS COMMUNICATIONS AND NETWORKING},
volume = {2013},
abstract = {Firewalls are network devices dedicated to analyzing and filtering the traffic in order to separate network segments with different levels of trust. Generally, they are placed on the network perimeter and are used to separate the intranet from the Internet. Firewalls are used to forbid some protocols, to shape the bandwidth resources, and to perform deep packet inspection in order to spot malicious or unauthorized contents passing through the network. In a wireless multihop network, the concept of perimeter is hard to identify and the firewall function must be implemented on every node together with routing. But when the network size grows, the rule-set used to configure the firewall may grow accordingly and introduce latencies and instabilities for the low-power mesh nodes. We propose a novel concept of firewall in which every node filters the traffic only with a portion of the whole rule-set in order to reduce its computational burden. Even if at each hop we commit some errors, we show that the filtering efficiency measured for the whole network can achieve the desired precision, with a positive effect on the available network resources. This approach is different from the protection of a space behind a wall: we use the term waterwall to indicate a distributed and homogeneous filtering function spread among all the nodes in the network.},
url = {http://dx.doi.org/10.1186/1687-1499-2013-225},
url = {http://jwcn.eurasipjournals.com/content/2013/1/225},
doi = {10.1186/1687-1499-2013-225},
pages = {1--12}
}
@conference{11572_94573,
author = { A Kandalintsev and R Lo Cigno },
title = {A Behavioral First Order CPU Performance Model for Clouds’ Management},
year = {2012},
publisher = {IEEE},
address = {USA},
booktitle = {4th International Congress on Ultramodern Telecommunications and Control Systems},
abstract = {Cloud computing is a popular way to address the scalability and efficiency issues of data centers. While the level of development of cloud technologies is already high-enough to easily beat old static cluster configurations, there is still a lot of room for improvement. One of these areas is in the way resource management tools predict the CPU and tasks performance. Normally, resource managers assume that the tasks do not affect each other, and assign resources under this assumption. With a simple experiment this paper shows that this assumption is grossly wrong, leading to overestimation of task performance that can approach 50%. Next, the paper presents a behavioral model that efficiently addresses these issues. Preliminary results obtained for three different hardware platforms demonstrate the benefits of our model in performance prediction.},
url = {http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6459701},
url = {http://www.icumt.org/2012/},
doi = {10.1109/ICUMT.2012.6459701},
pages = {40--48}
}
@article{11572_67220,
author = { M Segata and F Dressler and R Lo Cigno and M Gerla },
title = {A Simulation Tool for Automated Platooning in Mixed Highway Scenarios},
year = {2012},
journal = {MOBILE COMPUTING AND COMMUNICATIONS REVIEW},
volume = {16},
abstract = {Automated platooning is one of the most challenging fields in the domain of ITS. Conceptually, platooning means creating clusters of vehicles which closely follow each other autonomously without action of the driver, neither for accelerating, nor for braking.
This leads to several important benefits from substantially improved road throughput to increased safety. The control of such platoons depends on two components: First, radar is typically to be used to control the distance between the vehicles, and secondly, IVC helps managing the entire platoon allowing cars to join or to leave the group whenever necessary. Platooning systems have been mostly investigated in controlled environments such as dedicated highways with centralized management. However, platooning-enabled cars will be deployed gradually and might have to travel on highways together with other non-automated vehicles. We developed a combined traffic and network simulator for studying strategies and protocols needed for managing platoons in such mixed scenarios. We show the models needed and present first results using a simple IVC-based platoon management as a proof of concept.},
url = {http://dl.acm.org/citation.cfm?id=2436218},
doi = {10.1145/2436196.2436218},
pages = {46--49}
}
@conference{11572_95010,
author = { M Segata and F Dressler and R Lo Cigno and M Gerla },
title = {A simulation tool for automated platooning in mixed highway scenarios},
year = {2012},
publisher = {ACM},
address = {New York, NY, USA},
booktitle = {Proceedings of the 18th International Conference on Mobile Computing and Networking},
doi = {10.1145/2348543.2348591},
pages = {389--392}
}
@conference{11572_94995,
author = { Ferdous R and Lo Cigno R and Zorat A },
title = {Classification of SIP Messages by a Syntax Filter and SVMs},
year = {2012},
publisher = {IEEE Comunications Society},
address = {New York, NY},
booktitle = {Proc. of the IEEE Global Telecommunications Conference},
abstract = {The Session Initiation Protocol (SIP) is at the root of many sessions-based applications such as VoIP and media streaming that are used by a growing number of users and organizations. The increase of the availability and use of such applications calls for careful attention to the possibility of trans- ferring malformed, incorrect, or malicious SIP messages as they can cause problems ranging from relatively innocuous disturbances to full blown attacks and frauds. To this end, SIP messages are analyzed to be classified as âœgoodâ or âœbadâ depending on whether this structure and content are deemed acceptable or not. This paper presents a classifier of SIP messages based on a two stage filter. The first stage uses a straightforward lexical analyzer to detect and remove all messages that are lexically incorrect with reference to the grammar that is defined by the protocol standard.
The second stage uses a machine learning approach based on a Support Vector Machine (SVM) to analyze the structure of the remaining syntactically correct messages in order to detect semantic anomalies which are deemed a strong indication of a possibly malicious message. The SVM âœlearnsâ the structure of the âœgoodâ and âœbadâ SIP messages through an initial training phase and the SVM thus configured correctly classifies messages produced by a synthetic generator and also âœrealâ
SIP messages that have been collected from the communication network at our institution. The preliminary results of such classification look very promising and are presented in the final section of this paper.},
url = {http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=6503527},
url = {http://www.ieee-globecom.org},
doi = {10.1109/GLOCOM.2012.6503527},
pages = {2714--2719}
}
@conference{11572_95130,
author = { S Traverso and L Abeni and R Birke and C Kiraly and E Leonardi and R Lo Cigno and M Mellia },
title = {Experimental comparison of neighborhood filtering strategies in unstructured P2P-TV systems},
year = {2012},
publisher = {IEEE},
address = {USA},
booktitle = {Proc. of 12-th IEEE International Conference on Peer-to-Peer Computing (P2P'12)},
abstract = {P2P-TV systems performance are driven by the overlay topology that peers form. Several proposals have been made in the past to optimize it, yet little experimental studies have corroborated results. The aim of this work is to provide a comprehensive experimental comparison of different strategies for the construction and maintenance of the overlay topology in P2P-TV systems. To this goal, we have implemented different fully-distributed strategies in a P2P-TV application, called Peer- Streamer, that we use to run extensive experimental campaigns in a completely controlled set-up which involves thousands of peers, spanning very different networking scenarios. Results show that the topological properties of the overlay have a deep impact on both user quality of experience and network load. Strategies based solely on random peer selection are greatly outperformed by smart, yet simple strategies that can be implemented with negligible overhead. Even with different and complex scenarios, the neighborhood filtering strategy we devised as most perform- ing guarantees to deliver almost all chunks to all peers with a play-out delay as low as only 6s even with system loads close to 1.0. Results are confirmed by running experiments on PlanetLab. PeerStreamer is open-source to make results reproducible and allow further research by the community.},
url = {http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6335794},
doi = {10.1109/P2P.2012.6335794},
pages = {13--24}
}
@conference{11572_95002,
author = { L Maccari and R Lo Cigno },
title = {How to Reduce and Stabilize MPR sets in OLSR networks},
year = {2012},
publisher = {IEEE},
address = {USA},
booktitle = {Proc. of the IEEE 8th International Conference on Wireless and Mobile Computing},
abstract = {MPR selection is one of the most important and critical functions
of OLSR. The OLSR standard specifies an algorithm that has good local properties in terms of number of MPR selected but does not use available information in order to reduce the global number of MPR nodes. MPR selection affects many network properties, from the actual logical topology, to the routing efficiency, to the protocol overhead and the broadcast/multicast delivery. This paper proposes and evaluates two simple modifications to the MPR selection strategy, which are oriented to global properties rather than local â˜optimalityâ. The results presented show that even marginal modifications of the heuristic lead to a performance improvement, with, for instance, a reduction of up to 15% in the number of control messages required to maintain the topology, a relevant gain specially when obtained without introducing any overhead in control messages},
url = {http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6379101},
doi = {10.1109/WiMOB.2012.6379101},
pages = {373--380}
}
@conference{11572_95004,
author = { A Quartulli and R Lo Cigno },
title = {Improving Mesh-Agnostic Client Announcement in B.A.T.M.A.N.-Advanced},
year = {2012},
publisher = {IEEE},
address = {USA},
booktitle = {IEEE 8th International Conference on Wireless and Mobile Computing, Networking and Communications},
abstract = {Research in Wireless Mesh Networking has been very active in the past years, with the birth of several new ideas and the protocols that implement them. Most common implemen- tations rely on Layer-3 addressing and routing; however 802.11s and other successful protocols suggest that Mesh Networking on Layer-2 address space is more efficient, does not mingle with the global IP routing, and provides easier ways to support micro- mobility as well as client management. This paper focuses on the client announcement protocol, i.e., the functionality, somewhat embedded between Layer-2 and Layer-3, that allows routers
in a mesh network to announce the clients they are serving and that in practice makes the entire routing protocol work correctly. In particular, it focuses on B.A.T.M.A.N.-Advanced, analyses the shortcomings of the simple implementation of this functionality present until v.2011.2.0 and defines the new protocol and algorithms that we have implemented and are part of the distribution starting from v.2011.3.0. Experiments in controlled scenarios show how performance increases dramatically even in scenarios designed specifically to stress the new protocol. The new mechanism and improved performance make it possible to design new features for B.A.T.M.A.N.-Advanced, most notably
the support for fast and seamless handover, which is currently under testing},
url = {http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6379146},
doi = {10.1109/WiMOB.2012.6379146},
pages = {667--674}
}
@conference{11572_94996,
author = { R Ferdous and R Lo Cigno and A Zorat },
title = {On the use of SVMs to Detect Anomalies in a Stream of SIP Messages},
year = {2012},
publisher = {IEEE},
address = {USA},
booktitle = {Proc. of the IEEE 11th International Conference on Machine Learning and Applications},
abstract = {Voice and multimedia communications are rapidly migrating from traditional networks to TCP/IP networks (Internet), where services are provisioned by SIP (Session Initiation Protocol). In this paper we propose an on-line filter that examines the stream of incoming SIP messages and classifies them as good or bad. The classification is carried out in two stages: first a lexical analysis is performed to weed out those messages that do belong to the language generated by the grammar defined by the SIP standard. After this first stage, a second filtering occurs which identifies messages that somehow differ - in structure or contents - from messages that were previously classified as good. While the first filter stage is straightforward, as the classification is crisp (either a messages belongs to the language or it does not), the second stage requires a more delicate handling, as it not a sharp decision whether a message is semantically meaningful or not. The approach we followed for this is based on using past experience on previously classified messages, i.e. a “learn-by-examples” which led to a classifier based on Support- Vector-Machines (SVM) to perform the required analysis of each incoming SIP message. The paper describes the overall architecture of the two-stage filter and then explores several points of the configuration-space for the SVM to determine a good configuration setting that will perform well when used to classify a large sample of SIP messages obtained from real traffic collected on a VoIP installation at our institution. Finally, the performance of the classification on additional messages collected from the same source is presented.},
url = {http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=6406630},
url = {http://www.icmla-conference.org/icmla12},
doi = {10.1109/ICMLA.2012.109},
pages = {592--597}
}
@conference{11572_91978,
author = { L Maccari and R Lo Cigno },
title = {Privacy in the pervasive era: A distributed firewall approach},
year = {2012},
publisher = {IEEE},
address = {Piscataway, NJ},
booktitle = {Wireless On-demand Network Systems and Services (WONS), 2012 9th Annual Conference on},
abstract = {Pervasive computing and communications are (slowly) enabling local ad-hoc services. Preserving privacy in a pervasive environment is one of the key challenges ahead: How can users define their ``communication boundaries''? how can the network avoid wasting resources and eventually collapse under the burden of undesired traffic that will be discarded at the receiver machine? In this paper we propose the adoption of distributed filtering techniques implementing a network-wide firewall whose goal is defining precisely, and under the user control, the boundaries in space, time, information content, and logical addressing of a user communication scope. Initial results based on an implementation integrated with OLSR are presented.},
keywords = {OLSR; communication boundaries; distributed filtering techniques; distributed firewall approach; pervasive computing; ad hoc networks; mobile communication; ubiquitous computing},
url = {http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=6152229&tag=1},
doi = {10.1109/WONS.2012.6152229},
pages = {23--26}
}
@conference{11572_91979,
author = { Segata M. and Lo Cigno R.A.},
title = {Simulation of 802.11 PHY/MAC: The quest for accuracy and efficiency},
year = {2012},
publisher = {IEEE},
address = {USA},
booktitle = {Wireless On-demand Network Systems and Services (WONS), 2012 9th Annual Conference on},
abstract = {The goal of this work is to highlight and explain the limitations of traditional physical channel models used in network simulators for wireless LANs, with particular reference to VANETs, where these limitations may jeopardize the validity of results, specially for safety applications. The fundamental tradeoff is between simulation time and realism. Indeed, a simulator should provide realistic results as fast as possible, even if several nodes (i.e., hundreds) are considered. Our final goal, beyond this initial contribution, is the development of a stochastic channel model which improves reliability of simulations while increasing computational complexity only marginally. The design of our model is based on the representation of the packet decoding procedure as a Markov Decision (Stochastic) Process (MDP), thus avoiding the computational complexity of the simulation of the entire transmission - propagation - decoding chain bit-by-bit, which can surely provide enough accuracy, but at the price of unacceptable computational (and model) complexity. The paper identifies the key phenomena such as preamble detection, central-frequency misalignment, channel captures, vehicles relative speed, that represent the `state' of the MDP modeling the transmission chain, and propose an MDP structure to exploit it. The focus is on 802.11p and OFDM-based PHY layers, but the model is extensible to other transmission techniques easily. The design is tailored for implementation in ns-3, albeit the modeling principle is general and suitable for every event-driven simulator.},
keywords = {IEEE802.11 PHY-MAC simulation; MDP modeling; Markov decision process; NS-3 simulation; OFDM-based PHY layers; VANET; Computational Complexity; Event-driven simulator; Network simulators; Packet decoding procedure; Physical channel models; Preamble detection; Stochastic channel model; Transmission propagation decoding chain; Wireless LAN; Vehicular ad hoc networks},
url = {http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=6152246&tag=1},
doi = {10.1109/WONS.2012.6152246},
pages = {99--106}
}
@conference{11572_94999,
author = { S Joerer and M Segata and B Bloessl and R Lo Cigno and C Sommer and F Dressler },
title = {To Crash or Not to Crash: Estimating its Likelihood and Potentials of Beacon-based IVC Systems},
year = {2012},
publisher = {IEEE},
address = {USA},
booktitle = {4th IEEE Vehicular Networking Conference (VNC 2012)},
abstract = {Is it possible to estimate some ‘safety’ metric to assess the effectiveness of Intelligent Transportation Systems? In particular, we are interested in using Inter-Vehicle Com- munication (IVC) beaconing for increasing drivers’ safety at intersections. In the last couple of years, the vehicular networking community reported in several studies that simple network metrics are not sufficient to evaluate safety enhancing protocols and applications. We present a classification scheme that allows the quantification of such improvements by determining how many potential crashes happen or can be avoided by a specific IVC approach. Using a modified road traffic simulator that allowed selected vehicles to disregard traffic rules, we investigated the impact of safety messaging between cars approaching an intersection. We show that in suburban environments simple beaconing is not as effective as anticipated. Yet, simple one-hop- relaying, e.g., by vehicles parked close to an intersection, can improve drivers’ safety substantially. Since the key purpose of IVC is safety, the paper closes the loop in the evaluation of the effectiveness of vehicular networks as defined today.},
url = {http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6407441},
url = {http://www.ieee-vnc.org},
doi = {10.1109/VNC.2012.6407441},
pages = {25--32}
}
@article{11572_89765,
author = { Birke R and Leonardi E and Mellia M and Bakay A and Szemethy T and Kiraly C and Lo Cigno R and Mathieu F and Muscariello L and Niccolini S and Seedorf J and Tropea G },
title = {Architecture of a network-aware P2P-TV application: the NAPA-WINE approach},
year = {2011},
journal = {IEEE COMMUNICATIONS MAGAZINE},
volume = {49},
abstract = {Peer to Peer streaming (P2P-TV) applications have recently emerged as cheap and efficient solutions to provide real time streaming services over the Internet. For the sake of simplicity, typical P2P-TV systems are designed and optimized following a pure layered approach, thus ignoring the effect of design choices on the underlying transport network. This simple approach, however, may constitute a threat for the network providers, due to the congestion that P2P-TV traffic can potentially generate. In this article, we present and discuss the architecture of an innovative, network cooperative P2PTV application that is being designed and developed within the STREP Project NAPA WINE. Our application is explicitly targeted to favor cooperation between the application and the transport network layer.},
keywords = {Internet; P2P-TV traffic; STREP project NAPA-WINE; congestion; network aware P2P-TV application architecture; network providers; peer to peer streaming applications; pure layered approach; real time streaming services; IP networks; IPTV; peer-to-peer computing; telecommunication traffic; video streaming},
url = {http://ieeexplore.ieee.org/xpl/freeabs_all.jsp?arnumber=5784001&tag=1},
doi = {10.1109/MCOM.2011.5784001},
pages = {154--163}
}
@article{11572_91892,
author = { Ciccarelli G. and Lo Cigno R.},
title = {Collusion in Peer-to-Peer Systems},
year = {2011},
journal = {COMPUTER NETWORKS},
volume = {55},
abstract = {P2P systems are used to provide distributed storage, file sharing, video streaming, distributed gaming, and other applications based on the collaboration of participating peers and on the observation that sharing resources used sporadically leads to huge savings. The operation of a P2P system, as well as its sheer survival, however, is open to many kinds of attacks, which are tough to fight due to both the decentralized nature of P2P applications, and the lack, in some of them, of a central authority, or of a well-defined structure, or both. Particularly, as P2P systems require the active collaboration of the participants beyond their selfish interest, many systems include methods designed to lure the most resourceful users into broader participation, to provide an overall better service. The methods devised to attract the contribution of users are unfortunately vulnerable to a particular class of attacks: collusion. Collusion is broadly defined as any malicious coordinated behavior of a group of users aimed at gaining undeserved benefits, or at damaging (some) well behaved users. In this paper, we survey the literature on P2P systems security with specific attention to collusion, to find out how they resist to such attacks and what solutions can be used, e.g., game theory, to further counter this problem and give P2P systems the possibility of developing into full fledged services of the future Internet.},
keywords = {Collusion; Game theory; Peer-to-peer networks; Security},
url = {http://www.sciencedirect.com/science/article/pii/S1389128611002581},
doi = {10.1016/j.comnet.2011.06.028},
pages = {3517--3532}
}
@conference{11572_89771,
author = { Segata M. and Lo Cigno R.},
title = {Emergency braking: a study of network and application performance},
year = {2011},
publisher = {ACM},
address = {New York, NY, USA},
booktitle = {Proceedings of the Eighth ACM international workshop on Vehicular inter-networking},
abstract = {Safety applications are among the key drivers in VANET research. Their study is complex as it encompasses different disciplines, from wireless networking to car dynamics, to drivers' behavior, not to mention the economic and legal aspects. This work presents a simulative study of emergency braking applications tackled by embedding a mobility, cars' dynamic, and driver's behavior model into a detailed networking simulator (ns-3). The results, derived both at the network and at the application level, capture correctly the interactions of the communications and protocols with the car's adaptive cruise control system and the driver's behavior for cars that are not equipped with communication devices. The paper presents in detail the improvements we contribute in simulation techniques and model completeness. It introduces a novel and easy message aggregation technique to empower message re-propagation while controlling the network load during the peak due to the emergency braking. Finally it discusses the effectiveness of such applications as a function of the market penetration rate, showing that even cars that are not equipped with communication devices benefit from the smoother and earlier reaction of those cars that can communicate and whose adaptive cruise control implements a correct deceleration strategy.},
keywords = {VANET; collaborative adaptive cruise control; emergency braking control; ns-3 simulation; rebroadcast schemes; vehicular networks},
url = {http://dl.acm.org/citation.cfm?doid=2030698.2030700},
url = {http://doi.acm.org/10.1145/2030698.2030700},
doi = {10.1145/2030698.2030700},
pages = {1--10}
}
@conference{11572_89769,
author = { Ceriotti M. and Corrà M. and D'Orazio L. and Doriguzzi R. and Facchin D. and Guna S. and Jesi G. P. and Lo Cigno R. and Mottola L. and Murphy A. L. and Pescalli M. and Picco G. P. and Pregnolato D. and Torghele C.},
title = {Is there light at the ends of the tunnel? Wireless sensor networks for adaptive lighting in road tunnels},
year = {2011},
publisher = {ACM/IEEE},
address = {Piscattaway, NY},
booktitle = {Information Processing in Sensor Networks (IPSN), 2011 10th International Conference on},
abstract = {Existing deployments of wireless sensor networks (WSNs) are often conceived as stand-alone monitoring tools. In this paper, we report instead on a deployment where the WSN is a key component of a closed-loop control system for adaptive lighting in operational road tunnels. WSN nodes along the tunnel walls report light readings to a control station, which closes the loop by setting the intensity of lamps to match a legislated curve. The ability to match dynamically the lighting levels to the actual environmental conditions improves the tunnel safety and reduces its power consumption. The use of WSNs in a closed-loop system, combined with the real-world, harsh setting of operational road tunnels, induces tighter requirements on the quality and timeliness of sensed data, as well as on the reliability and lifetime of the network. In this work, we test to what extent mainstream WSN technology meets these challenges, using a dedicated design that however relies on well-established techniques. The paper describes the hw/sw architecture we devised by focusing on the WSN component, and analyzes its performance through experiments in a real, operational tunnel.},
keywords = {WSN deployment; adaptive lighting; closed loop control system; control station; lamp intensity; network lifetime; network reliability; power consumption reduction; road tunnel; stand-alone monitoring tool; tunnel safety; wireless sensor networks; adaptive control; closed loop systems; lamps; lighting control; power consumption; road safety; sensor placement; software architecture; telecommunication network reliability; tunnels},
url = {http://ieeexplore.ieee.org/xpl/freeabs_all.jsp?arnumber=5779037&tag=1},
pages = {187--198}
}
@article{11572_88922,
author = { Welponer M. and Abeni L. and Marchetto G. and Lo Cigno R.},
title = {Measuring and reducing the impact of the operating system kernel on end-to-end latencies in synchronous packet switched networks},
year = {2011},
journal = {SOFTWARE-PRACTICE & EXPERIENCE},
volume = {2011},
doi = {10.1002/spe.1134}
}
@conference{11572_89770,
author = { Khademi N. and Welzl M. and Lo Cigno R.},
title = {On the Uplink Performance of TCP in Multi-rate 802.11 WLANs},
year = {2011},
publisher = {Springer Berlin / Heidelberg},
address = {Berlin, DE},
volume = {6641},
booktitle = {NETWORKING 2011},
abstract = {IEEE 802.11 defines several physical layer data rates to provide more robust communication by falling back to a lower rate in the presence of high noise levels. The choice of the current rate can be automatized; e.g., Auto-Rate Fallback (ARF) is a well-known mechanism in which the sender adapts its transmission rate in response to link noise using up/down thresholds. ARF has been criticized for not being able to distinguish MAC collisions from channel noise. It has however been shown that, in the absence of noise and in the face of collisions, ARF does not play a significant role for TCP’s downlink performance. The interactions of ARF, DCF and uplink TCP have not yet been deeply investigated. In this paper, we demonstrate our findings on the impact of rate fallback caused by collisions in ARF on the uplink performance of various TCP variants using simulations.},
url = {http://dx.doi.org/10.1007/978-3-642-20798-3_28},
url = {http://www.springerlink.com/content/x244103400270852/},
doi = {10.1007/978-3-642-20798-3_28},
pages = {368--378}
}
@article{11572_89767,
author = { Munir K. and Lo Cigno R. and Vicat-Blanc P. P. and Welzl M.},
title = {Planning data transfers in grids: a multi-service queueing approach},
year = {2011},
journal = {CONCURRENCY AND COMPUTATION},
volume = {2011},
abstract = {Grid applications move large amounts of data between distributed resources, and the efficiency of a Grid depends on their timely delivery within given bounds (deadlines). In most cases, the data volume and deadline are known in advance, allowing for both network planning and connection admission control (CAC). We formally define the problem and, based on this formalization, describe the operation of a feasible procedure for network reservations of deadline-constrained bulk data transfer requests. The procedure guarantees a minimum bandwidth to meet the deadlines and allows for opportunistic utilization of residual network capacity. We propose a novel analytical model based on the solution of an M/M(nc)/1/k(s)−RPS queue. The analytical model is validated against ns−2 simulations taking into account network level details (IP and TCP protocols), showing remarkably good coherence even under heavy loads. The model is orders of magnitude faster than simulation, which enables its application to plan the capacity of Grid networks, and to enforce CAC under the hypothesis of a dominating bottleneck on the transfer route.},
keywords = {Grid; modeling; bulk data transfer; TCP; admission control; processor sharing},
url = {http://dx.doi.org/10.1002/cpe.1742},
doi = {10.1002/cpe.1742},
pages = {407--422}
}
@article{11572_84584,
author = { G Gheorghe and R Lo Cigno and A Montresor },
title = {Security and Privacy Issues in P2P Streaming Systems: A Survey},
year = {2011},
journal = {PEER-TO-PEER NETWORKING AND APPLICATIONS},
volume = {vol. 4},
doi = {10.1007/s12083.010.0070.6},
pages = {75--91}
}
@conference{11572_89768,
author = { Lo Cigno R.},
title = {Untethered Local Communications: From Wireless Access to Social Glue},
year = {2011},
publisher = {IEEE},
address = {Piscataway, NJ},
volume = {2011},
booktitle = {IEEE Wireless On-demand Network Systems and Services (WONS 2011)},
abstract = {The paper presents the issues on the role of wireless access networks to support the kind of information exchange and interactions involved in the evolving social networks. The author discusses several requirements that the wireless access networks and social networking needs to address such as the communication infrastructure, distributed and informal trusts, environment interactions, body interactions, and context awareness.},
keywords = {body interactions; communication infrastructure; context awareness; distributed trust; environment interaction; informal trust; information exchange; social networks; wireless access network; computer network security; computer networks; radiocommunication; social networking (online); ubiquitous computing},
url = {http://ieeexplore.ieee.org/search/freesrchabstract.jsp?tp=&arnumber=5720198},
doi = {10.1109/WONS.2011.5720198},
pages = {42--43}
}
@misc{11572_112227,
author = { Ajelli Marco and Lo Cigno Renato and Montresor Alberto },
title = {Compartmental differential equations models of botnets and epidemic malware},
year = {2010},
publisher = {Università di Trento},
address = {Trento, Italia},
abstract = {Botnets, i.e., large systems of controlled agents, have become the most sophisticated and dangerous way of spreading malware. Their damaging actions can range from massive dispatching of e-mail spam messages, to denial of service attacks, to collection of private and sensitive information. Unlike standard computer viruses or worms, botnets spread silently without actively operating their damaging activity, and then are activated in a coordinated way to maximize the “benefit” of the malware. In this paper we propose two models based on compartmental differential equations derived from “standard” models in biological disease spreading. These models offer insight into the general behavior of botnets, allowing both the optimal tuning of botnets’ characteristics, and possible countermeasures to prevent them. We analyze, in closed form, some simple instances of the models whose parameters have non-ambiguous interpretation. We conclude the paper by discussing possible model extensions, which can be used to fine-tune the analysis of specific epidemic malware in the case that some parameters can be obtained from actual measurements of the botnet behavior.},
pages = {1--10}
}
@conference{11572_85930,
author = { C Kiraly and R Lo Cigno and L Abeni },
title = {Deadline-based Differentiation in P2P Streaming},
year = {2010},
publisher = {IEEE},
address = {Piscataway, NJ},
booktitle = {2010 IEEE Global Telecommunications Conference: GLOBECOM 2010},
pages = {1--5}
}
@conference{11572_89772,
author = { A Russo and R Lo Cigno },
title = {Delay-Aware Push/Pull Protocols for Live Video Streaming in P2P Systems},
year = {2010},
publisher = {IEEE},
address = {Piscattaway, NY},
booktitle = {IEEE International Conference on Communications (ICC 2010)},
abstract = {P2P video streaming is receiving enormous attention, and when video is involved, the efficient use of the network becomes a very important issue, specially if live applications are addressed. In this work we study properties of Push/Pull protocols for the exchange of video chunks in non-structured systems. Push/Pull protocols are a broad class of chunk exchange mechanisms where peers alternate phases where they actively send chunks to other peers, with phases where they seek for missing chunks from other peers. We focus on the properties of the protocol, trying to gain insight on the distributed exchange mechanism itself. Then, we explore how performances can be improved if peers, in selecting the peers to exchange information with, also consider network level parameters, namely the round trip delay.},
url = {http://ieeexplore.ieee.org/xpl/freeabs_all.jsp?arnumber=5502543},
doi = {10.1109/ICC.2010.5502543},
pages = {1--5}
}
@conference{11572_85321,
author = { L Abeni and C Kiraly and A Russo and M Biazzini and R Lo Cigno },
title = {Design and Implementation of a Generic Library for P2P Streaming},
year = {2010},
publisher = {ACM},
address = {New York, NY},
booktitle = {Proceedings of the 2010 ACM workshop on Advanced video streaming techniques for peer-to-peer networks and social networking},
url = {http://portal.acm.org/citation.cfm?id=1877902},
doi = {10.1145/1877891.1877902},
pages = {43--48}
}
@conference{11572_85130,
author = { C Kiraly and L Abeni and R Lo Cigno },
title = {Effects of P2P Streaming on Video Quality},
year = {2010},
publisher = {IEEE},
address = {Piscataway, NJ},
booktitle = {2010 IEEE International Conference on Communications},
abstract = {P2P TV distribution is going commercial, and the video quality delivered to users becomes of the utmost importance. However, the impact of P2P distribution on the video quality is not completely understood yet, especially in live streaming situations. This work addresses the impact of P2P distribution when the delay of the playout is limited, as it must be in any true live TV service. A methodology for the evaluation (using standard objective video quality metrics) is proposed, showing that different ways of grouping frames in chunks for the distribution can lead to very different quality when the system is overloaded.},
keywords = {QoE; Scheduling},
pages = {1--5}
}
@conference{11572_84518,
author = { M Ajelli and R Lo Cigno and A Montresor },
title = {Modeling Botnets and Epidemic Malware},
year = {2010},
publisher = {IEEE},
address = {USA},
booktitle = {Proceedings of the International Communications Conference (ICC'10)},
pages = {1--5}
}
@conference{11572_85943,
author = { L Abeni and A Bakay and M Biazzini and R Birke and E Leonardi and R Lo Cigno and C Kiraly and M Mellia and S Niccolini and J Seedorf and T Szemethy and G Tropea },
title = {Network Friendly P2P-TV: The Napa-Wine Approach},
year = {2010},
publisher = {IEEE},
address = {Piscataway, NJ},
booktitle = {2010 IEEE International Conference on Peer-to-Peer Computing: (P2P)},
keywords = {ALTO like service; GRAPES; Internet; P2P TV system; buffer map; chunk ID set; chunk trading; generic library; generic resource aware P2P environment for streaming; network load; topology management; topology optimization},
url = {http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=5569983&tag=1},
doi = {10.1109/P2P.2010.5569983},
pages = {1--2}
}
@conference{11572_85131,
author = { L Abeni and C Kiraly and R Lo Cigno },
title = {Robust Scheduling of Video Streams in Network-Aware P2P Applications},
year = {2010},
publisher = {IEEE},
address = {Piscataway, NJ},
booktitle = {2010 IEEE International Conference on Communications},
doi = {10.1109/ICC.2010.5502542},
pages = {1--5}
}
@conference{11572_79168,
author = { L Abeni and C Kiraly and R Lo Cigno },
title = {Scheduling P2P Multimedia Streams: Can We Achieve Performance and Robustness?},
year = {2010},
publisher = {IEEE},
address = {New York, N.Y.},
booktitle = {3rd IEEE International Conference on Internet Multimedia Services Architecture and Applications},
doi = {10.1109/IMSAA.2009.5439486},
pages = {1--6}
}
@misc{11572_96661,
author = { A Bondi and M Nardelli and R Lo Cigno and M Pescalli and G Pietro Picco and N Vernesoni },
title = {A system and a process for controlling the light intensity in a tunnel},
year = {2009}
}
@conference{11572_79707,
author = { C Kiraly and R Lo Cigno },
title = {IPsec-Based Anonymous Networking: A Working Implementation},
year = {2009},
publisher = {IEEE International Conference on Communications},
address = {USA},
booktitle = {IEEE International Conference on Communications (ICC '09)},
doi = {10.1109/ICC.2009.5199102},
pages = {2235--2239}
}
@misc{11572_16380,
author = { L Abeni and C Kiraly and R Lo Cigno },
title = {On the Optimal Scheduling of Streaming Applications in Unstructured Meshes},
year = {2009},
publisher = {Springer-Verlag},
address = {Berlin},
booktitle = {NETWORKING 2009: 8th International IFIP-TC 6 Networking Conference [...]: Proceedings},
pages = {117--130}
}
@misc{11572_16429,
author = { R Lo Cigno and T Pecorella and M Sereno and L Veltri },
title = {Peer-to-Peer Beyond File Sharing: Where are P2P Systems Going?},
year = {2009},
publisher = {IEEE},
address = {New York, NY, USA},
booktitle = {6-th International Workshop on Hot Topics in P2P systems (Hot-P2P 2009)},
url = {http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=5160958},
doi = {10.1109/IPDPS.2009.5160958},
pages = {1--8}
}
@conference{11572_94939,
author = { A Russo and R Lo Cigno },
title = {Push/Pull Protocols for Streaming in P2P Systems},
year = {2009},
publisher = {ACM/IEEE},
address = {New York},
booktitle = {IEEE INFOCOM Workshops 2009},
abstract = {P2P approaches are being adopted in more and more applications, exploiting the intrinsic scaling properties of P2P systems. Streaming multicasting applications in particular seems to benefit most from the P2P approach. In this context, systems have been divided between those that push information from parent to child and those that pull it from child to parent. In this work we explore the generalization to push/pull protocols, where each peer can dynamically push or pull, playing alternately on short time frames, the role of parent or child.},
doi = {10.1109/INFCOMW.2009.5072181}
}
@misc{11572_16381,
author = { L Abeni and C Kiraly and R Lo Cigno },
title = {SSSim: a Simple and Scalable Simulator for P2P Streaming Systems},
year = {2009},
publisher = {IEEE},
address = {Piscataway, NJ},
booktitle = {2009 IEEE 14th International Workshop on Computer Aided Modeling and Design of Communication Links and Networks: CAMAD},
doi = {10.1109/CAMAD.2009.5161473},
pages = {1--6}
}
@conference{11572_74976,
author = { Z Zsoka and R Lo Cigno and B Farkas },
title = {Augmented Grooming in Networks with Elastic Traffic},
year = {2008},
publisher = {SPECTS 2008},
address = {USA},
booktitle = {Proceedings of the International Symposium on Performance Evaluation of Computer and Telecommunication Systems},
pages = {554--560}
}
@conference{11572_75022,
author = { F Soldo and R Lo Cigno and M Gerla },
title = {Cooperative Synchronous Broadcasting in Infrastructure-to-Vehicles Networks},
year = {2008},
publisher = {IEEE},
address = {Piscataway, NY, USA},
booktitle = {Wireless on Demand Network Systems and Services},
url = {http://ieeexplore.ieee.org/search/searchresult.jsp?queryText=%28gerla+%3Cin%3E+au%29+%3Cand%3E+%284457464+%3Cin%3E+punumber%29&coll2=ieeecnfs&coll3=ieecnfs&history=yes&reqloc=others&scope=au&imageField2.x=1&imageField2.y=3},
pages = {125--132}
}
@misc{11572_16425,
author = { R Lo Cigno and A Russo D Carra },
title = {On Some Fundamental Properties of P2P Push/Pull Protocols},
year = {2008},
publisher = {IEEE},
address = {New York, NY, USA},
booktitle = {`Second International Conference on Communications and Electronics, ICCE 2008},
url = {http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=4578935},
doi = {10.1109/CCE.2008.4578935},
pages = {67--73}
}
@misc{11572_18740,
author = { N Abu-Ghazaleh and E Alba and C -F Chiasserini and R Lo Cigno },
title = {'Performance of Wireless Networks'},
year = {2008},
publisher = {Elsevier},
address = {Amsterdam},
volume = {52, Issue 1 (1)},
url = {http://www.sciencedirect.com/science?_ob=PublicationURL&_tockey=%23TOC%236234%232008%23999479998%23674293%23FLA%23&_cdi=6234&_pubType=J&_auth=y&_acct=C000053963&_version=1&_urlVersion=0&_userid=1613343&md5=2898cf71a51ffbbbad1d2cdec432c3d3},
url = {http://www.sciencedirect.com/science?_ob=QuickLinksURL&_method=createIntLink&_type=pubHome&_pubType=J&_key=%23toc%236234%232008%23999479998%23674293%23FLA%23&_acct=C000053963&_version=1&_userid=1613343&md5=1483910f9432b4fab36616fbaa14b6ac},
pages = {1--213}
}
@conference{11572_75117,
author = { G Costanzi and R Lo Cigno and A Ghittino and S Annese },
title = {Route Stabilization in Infrastructured Wireless Mesh Networks: an OLSRD Based Solution},
year = {2008},
publisher = {IEEE},
address = {Piscataway, NJ},
booktitle = {IEEE/IFIP WONS 2008: The Fifth Annual Conference on Wireless On demand Network Systems and Services},
pages = {500--505}
}
@article{11572_69265,
author = { D Carra and R Lo Cigno and E W Biersack },
title = {Stochastic Graph Processes for Performance Evaluation of Content Delivery Applications in Overlay Networks},
year = {2008},
journal = {IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS},
volume = {vol. 19},
abstract = {This paper proposes a new methodology to model the distribution of finite size content to a group of users connected through an overlay network.
Our methodology describes the distribution process as a constrained stochastic graph process (CSGP), where the constraints dictated by the content distribution protocol and the characteristics of the overlay network define the interaction among nodes. A CSGP is a semi-Markov process whose state is described by the graph itself. CSGPs offer a powerful description technique that can be exploited by Monte Carlo integration methods to compute in a very efficient way not only the mean but also the full distribution of metrics such as the file download times or number of hops from the source to the receiving nodes.
We model several distribution architectures based on trees and meshes as CSGPs and solve them numerically. We are able to study scenarios with a very large number of nodes and we can precisely quantify the performance differences between the tree- and mesh-based distribution architectures.},
doi = {10.1109/TPDS.2007.1114},
pages = {247--261}
}
@misc{11572_18134,
author = { V T Nguyen and R Lo Cigno and Y Ofek },
title = {Time Blocking Analysis in Time-driven Switching Networks},
year = {2008},
publisher = {IEEE},
address = {PHOENIX, AZ, USA},
booktitle = {IEEE INFOCOM 2008},
keywords = {fractional lambda switching; maximum scheduling delay; optical fibre network; pipeline packet forwarding; sub-lambda switching; time blocking probability analysis; time-driven switching network; optical fibre networks; optical switches; probability; scheduling},
url = {http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=4509838&tag=1},
doi = {10.1109/INFOCOM.2008.243},
pages = {1804--1812}
}
@conference{11572_75139,
author = { C Kiraly and S Teofili and G Bianchi and R Lo Cigno and M Nardelli and E Delzeri },
title = {Traffic Flow Confidentiality in IPsec : Protocol and Implementation},
year = {2008},
publisher = {Springer},
address = {Boston},
volume = {262},
booktitle = {The Future of Identity in the Information Society},
url = {http://www.springerlink.com/content/q652715xq3421r21/},
pages = {311--324}
}
@inbook{11572_28546,
author = { C Kiraly and S Teofili and G Bianchi and R Lo Cigno and M Nardelli and E Delzeri },
title = {Traffic Flow Confidentiality in IPsec:Protocol and Implementation},
year = {2008},
publisher = {Springer},
address = {USA},
booktitle = {The Future of Identity in the Information Society},
doi = {10.1007/978-0-387-79026-8_22},
pages = {311--324}
}
@article{11572_62489,
author = { VIET-THANG NGUYEN and R LO CIGNO and Y OFEK },
title = {Tunable Laser-based Design and Analysis for Fractional Lambda Switches},
year = {2008},
journal = {IEEE TRANSACTIONS ON COMMUNICATIONS},
volume = {56},
doi = {10.1109/TCOMM.2008.060707},
pages = {957--967}
}
@conference{11572_75186,
author = { R Lo Cigno and L Palopoli and A Colombo },
title = {Analysis of Different Scheduling Strategies in 802.11e Networks with Multi-Class Traffic},
year = {2007},
publisher = {IEEE Computer Society},
address = {Dublin, Ireland},
booktitle = {Proc. of 32nd Annual IEEE Conference on Local Computer Networks (LCN 2007)},
url = {http://www.ieeelcn.org/},
doi = {10.1109/LCN.2007.33},
pages = {455--462}
}
@conference{11572_75204,
author = { L Palopoli and R Lo Cigno and A Colombo },
title = {Control and Optimisation of HCCA 802.11e Access Scheduling},
year = {2007},
publisher = {IEEE Control and Automation Society},
address = {Piscataway},
booktitle = {Proc.of 46th IEEE conference on decision and control},
url = {http://iss.bu.edu/dac/dac/cdc/},
doi = {10.1109/CDC.2007.4434437},
pages = {4427--4432}
}
@article{11572_69946,
author = { D Carra and R Lo Cigno and E W Biersack },
title = {Graph Based Analysis of Mesh Overlay Streaming Systems},
year = {2007},
journal = {IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS},
volume = {25},
abstract = {This paper studies fundamental properties of stream-based content distribution services. We assume the presence of an overlay network (such as those built by P2P systems) with limited degree of connectivity, and we develop a mathematical model that captures the essential features of overlay-based streaming protocols and systems.
The methodology is based on stochastic graph theory, and models the streaming system as a stochastic process, whose characteristics are related to the streaming protocol. The model captures the elementary properties of the streaming system such as the number of active connections, the different play-out delay of nodes, and the probability of not receiving the stream due to node failures/misbehavior. Besides the static properties, the model is able to capture the transient behavior of the distribution graphs, i.e., the evolution of the structure over time, for instance in the initial phase of the distribution process.
Contributions of this paper include a detailed definition of the methodology, its comparison with other analytical approaches and with simulative results, and a discussion of the additional insights enabled by this methodology. Results show that mesh based architectures are able to provide bounds on the receiving delay and maintain rate fluctuations due to system dynamics very low. Additionally, given the tight relationship between the stochastic process and the properties of the distribution protocol, this methodology gives basic guidelines for the design of such protocols and systems.},
doi = {10.1109/JSAC.2007.071206},
pages = {1667--1677}
}
@conference{11572_77497,
author = { D Carra and R Lo Cigno and E W Biersack },
title = {Graph Based Modeling of P2P Streaming Systems},
year = {2007},
publisher = {Springer},
address = {Berlin},
volume = {4479},
booktitle = {IFIP Networking 2007},
url = {http://networking2007.uncc.edu/},
doi = {10.1007/978-3-540-72606-7_51},
pages = {594--605}
}
@article{11572_7041,
author = { E W Biersack and D Carra and R Lo Cigno and P Rodriguez and P Felber },
title = {Overlay Architectures for File Distribution: Fundamental Performance Analysis for Homogeneous and Heterogeneous Cases},
year = {2007},
publisher = {Elsevier BV:PO Box 211, 1000 AE Amsterdam Netherlands:011 31 20 4853757, 011 31 20 4853642, 011 31 20 4853641, EMAIL: nlinfo-f@elsevier.nl, INTERNET: http://www.elsevier.nl, Fax: 011 31 20 4853598},
journal = {COMPUTER NETWORKS},
volume = {51},
url = {http://www.sciencedirect.com/science?_ob=ArticleURL&_udi=B6VRG-4KHBB0H-2&_user=1613343&_coverDate=02%2F21%2F2007&_rdoc=1&_fmt=high&_orig=search&_origin=search&_sort=d&_docanchor=&view=c&_searchStrId=1633213958&_rerunOrigin=google&_acct=C000053963&_version=1&_urlVersion=0&_userid=1613343&md5=5b7d86227988695299f8b2c5e74d1172&searchtype=a},
doi = {10.1016/j.comnet.2006.06.011},
pages = {901--917}
}
@article{11572_47871,
author = { R Lo Cigno and D Carra and E W Biersack and P Rodriguez and P Felber },
title = {Overlay Architectures for File Distribution: Fundamental Performance Analysis for Homogeneous and Heterogeneous Cases},
year = {2007},
journal = {COMPUTER NETWORKS},
volume = {51},
pages = {901--917}
}
@conference{11572_77974,
author = { D Carra and R Lo Cigno and E W Biersack },
title = {Content Delivery in Overlay Networks: a Stochastic Graph Processes Perspective},
year = {2006},
publisher = {IEEE},
address = {New York},
booktitle = {IEEE Globecom 2006},
url = {http://www.ieee-globecom.org/},
pages = {2221--2225}
}
@conference{11572_78063,
author = { V T Nguyen and R Lo Cigno and Y Ofek },
title = {Design and Analysis of Tunable Laser based Fractional Lambda Switching (FLS)},
year = {2006},
publisher = {IEEE},
address = {New York, N.Y.},
booktitle = {Proceeding of the 25th Conference on Computer Communications, IEEE Infocom 2006},
pages = {1--10}
}
@article{11572_70945,
author = { E Salvadori and R Lo Cigno and Z Zsoka },
title = {Dynamic grooming in IP over optical networks based on the overlay architecture},
year = {2006},
journal = {OPTICAL SWITCHING AND NETWORKING},
volume = {3},
pages = {118--133}
}
@conference{11572_78036,
author = { D Carra and R Lo Cigno and E W Biersack },
title = {Fast Stochastic Analysis of P2P File Distribution Architectures},
year = {2006},
publisher = {IEEE},
address = {New York, N.Y.},
booktitle = {GLOBECOM 2006: EXPO; 2006 Global Telecommunications Conference; 27 November - 1 December 2006, San Francisco, California, USA [Elektronische Ressource]},
url = {http://www.ieee-globecom.org/},
pages = {2256--2260}
}
@misc{11572_16363,
author = { M Brunato and R Lo Cigno and D Severina },
title = {Managing Wireless HotSpots: the Uni-Fy Approach},
year = {2006},
publisher = {[S.n.]},
address = {[S.l.]},
booktitle = {Proceedings of the Fifth Annual Mediterranean Ad Hoc Networking Workshop (Med-Hoc-Net 2006)},
url = {http://www.medhoc.diit.unict.it/2006/TP.pdf},
pages = {352--360}
}
@conference{11572_63724,
author = { P Larcheri and R Lo Cigno },
title = {Scheduling in 802.11e: Open-Loop or Closed-Loop?},
year = {2006},
booktitle = {IEEE WONS 2006},
url = {http://citi.insa-lyon.fr/wons2006/}
}
@conference{11572_78114,
author = { P Laface and D Carra and R Lo Cigno },
title = {A Performance Model for Multimedia Services Provisioning on Network Interfaces},
year = {2005},
publisher = {Springer-Verlag GmbH},
address = {Germania},
booktitle = {Quality of Service in Multiservice IP Networks: Third International Workshop, QoS-IP 2005, Catania, Italy, February 2-4, 2004, Catania, Italy, February 2-4, 2004. Proceedings},
abstract = {LNCS series, Springer},
pages = {286--292}
}
@article{11572_72331,
author = { C Kiraly and M Garetto and M Meo and M Ajmone Marsan and R Lo Cigno },
title = {Analytical Computation of Completion Time Distributions of Short-Lived TCP Connections},
year = {2005},
journal = {PERFORMANCE EVALUATION},
volume = {59},
pages = {179--197}
}
@article{11572_85918,
author = { C Kiraly and M Garetto and M Meo and M Ajmone Marsan and R Lo Cigno },
title = {Analytical Computation of Completion Time Distributions of Short-Lived TCP Connections},
year = {2005},
journal = {PERFORMANCE EVALUATION},
volume = {Vol.59},
url = {http://www.sciencedirect.com/science?_ob=ArticleURL&_udi=B6V13-4D98N2W-1&_user=1613343&_coverDate=02%2F01%2F2005&_rdoc=1&_fmt=high&_orig=search&_origin=search&_sort=d&_docanchor=&view=c&_acct=C000053963&_version=1&_urlVersion=0&_userid=1613343&md5=a88965c50e9f39f7b59a05c4419752f4&searchtype=a},
doi = {10.1016/j.peva.2004.07.002},
pages = {179--197}
}
@conference{11572_40255,
author = { E Salvadori and R Lo Cigno and Z Zsoka },
title = {Dynamic Grooming in IP over WDM Networks: A Study with Realistic Traffic based on GANCLES Simulation Package},
year = {2005},
publisher = {IEEE},
address = {New York, NY},
booktitle = {Towards the broadband-for-all era: 2005 Conference on Optical Network Design and Modelling, [ONDM 2005]},
url = {http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=1427000},
url = {http://www.elet.polimi.it/conferences/ondm2005/},
doi = {10.1109/ONDM.2005.1427000},
pages = {185--196}
}
@article{11572_74874,
author = { R Battiti and R Lo Cigno and F Orava and B Pehrson },
title = {Global growth of open access networks: from warchalking and connection sharing to sustainable business},
year = {2005},
journal = {JOURNAL ON SPECIAL TOPICS IN MOBILE NETWORKS AND APPLICATIONS},
volume = {10},
pages = {275--287}
}
@conference{11572_85914,
author = { D Carra and R Lo Cigno and E W Biersack },
title = {Introducing Heterogeneity in the Performance Analysis of P2P Networks for File Distribution},
year = {2005},
publisher = {IEEE},
address = {New York, NY, USA},
booktitle = {IEEE Infocom 2005 Student Workshop},
url = {http://www.ieee-infocom.org/2005/},
pages = {1--2}
}
@article{11572_69664,
author = { L Muscariello and M Meo and M Mellia and M Ajmone Marsan and R Lo Cigno },
title = {Markov Models of Internet Traffic and a New Hierarchical MMPP Model},
year = {2005},
journal = {COMPUTER COMMUNICATIONS},
volume = {28},
pages = {1835--1851}
}
@article{11572_69670,
author = { M Mellia and R Lo Cigno and F Neri },
title = {Measuring IP and TCP behavior on edge nodes with Tstat},
year = {2005},
journal = {COMPUTER NETWORKS},
volume = {47},
pages = {1--21}
}
@article{11572_73071,
author = { R Lo Cigno and G Procissi and M Gerla },
title = {Sender-Side TCP Modifications: Performance Analysis and Design Guidelines},
year = {2005},
journal = {CLUSTER COMPUTING},
volume = {8},
pages = {35--45}
}
@conference{11572_78160,
author = { D Carra and R Lo Cigno },
title = {Stochastic Analysis of Chain Based File Distribution Architectures with Heterogeneous Peers},
year = {2005},
publisher = {IEEE Computer Society},
address = {Los Alamitos (CA)},
booktitle = {proceedings of WCW, 2005},
pages = {112--117}
}
@conference{11572_78290,
author = { V T Nguyen and M Baldi and R Lo Cigno and Y Ofek },
title = {Wavelength Swapping using Tunable Lasers for Fractional Lambda Switching},
year = {2005},
publisher = {IEEE computer society},
address = {Los Alamitos (CA)},
booktitle = {The 14th IEEE Workshop on Local and Metropolitan Area Networks, LANMAN 2005.},
url = {http://www.ieee-lanman.org},
pages = {10--15}
}
@article{11572_73225,
author = { R Battiti and R Lo Cigno and F Orava and B Pehrson and M Sabel },
title = {Wireless LANs: from WarChalking to Open Access Networks},
year = {2005},
journal = {JOURNAL ON SPECIAL TOPICS IN MOBILE NETWORKS AND APPLICATIONS},
volume = {10},
pages = {275--287}
}
@misc{11572_18702,
author = { R Battiti and M Conti and R Lo Cigno },
title = {Wireless On-Demand Network Systems: First IFIP TC6 Working Conference, WONS 2004, Madonna di Campiglio, Italy, January 21-23, 2004: Proceedings},
year = {2005},
publisher = {Springer},
address = {Berlin},
volume = {2928}
}
@conference{11572_78216,
author = { L Muscariello and M Mellia and M Meo and M Ajmone Marsan and R Lo Cigno },
title = {An MMPP-based Hierarchical Model of Internet Traffic},
year = {2004},
publisher = {IEEE},
address = {Piscataway, NJ},
booktitle = {2004 IEEE International Conference on Communications},
pages = {2143--2147}
}
@article{11572_73416,
author = { M Garetto and R Lo Cigno and M Meo and M Ajmone Marsan },
title = {Closed Queuing Network Models of Interacting Long-Lived TCP Flows},
year = {2004},
journal = {IEEE-ACM TRANSACTIONS ON NETWORKING},
volume = {12},
abstract = {This paper presents a new analytical model for the estimation of the performance of TCP connections. The model is based on the description of the behavior of TCP in terms of a closed queueing network. The model is very accurate, deriving directly from the finite state machine description of the protocol. The as- sessment of the accuracy of the analytical model is based on com- parisons against detailed simulation experiments developed with the ns-2 package. The protocol model interacts with an IP network model that can take into account meshed topologies with several bottlenecks.
Numerical results indicate that the proposed closed queueing network model provides accurate performance estimates in all situations. A novel and interesting property of the model is the possibility of deriving ensemble distributions of relevant parameters, such as, for instance, the transmission window size or the timeout probability, which provide useful insight into the protocol behavior and properties.},
doi = {10.1109/TNET.2004.826297},
pages = {300--313}
}
@conference{11572_78350,
author = { R Lo Cigno and E Salvadori and Z Zsoka },
title = {Elastic Traffic Effects on WDM Dynamic Grooming Algorithms},
year = {2004},
publisher = {IEEE},
address = {Piscataway, NJ},
booktitle = {Globecom' 04: IEEE Global Telecommunications Conference},
abstract = {Dallas, TX, USA},
doi = {10.1109/GLOCOM.2004.1378336},
pages = {1963--1967}
}
@article{11572_74043,
author = { M Garetto and R Lo Cigno and M Meo and M Ajmone Marsan },
title = {Modeling short-lived TCP connections with open multiclass queueing networks},
year = {2004},
journal = {COMPUTER NETWORKS},
volume = {44},
pages = {153--176}
}
@conference{11572_49594,
author = { M Garetto and M Ajmone Marsan and M Meo and R Lo Cigno },
title = {On the use of fixed point approximations to study reliable protocols over congested links},
year = {2004},
publisher = {IEEE},
address = {Piscataway, NJ},
booktitle = {GLOBECOM ’03: IEEE Global Telecommunications Conference},
doi = {10.1109/GLOCOM.2003.1258813},
pages = {3133--3137}
}
@misc{11572_23128,
author = { R Battiti and M Conti and R Lo Cigno },
title = {Wireless On-Demand Network Systems: First IFIP TC6 Working Conference, WONS 2004, Madonna di Campiglio, Italy, January 21-23, 2004: Proceedings},
year = {2004},
publisher = {Springer},
address = {Berlin},
volume = {2928}
}
@article{11572_74196,
author = { C Casetti and R Lo Cigno and M Mellia and M Munafo` and Z Zsoka },
title = {A New Class of QoS routing strategies based on network graph reduction},
year = {2003},
journal = {COMPUTER NETWORKS},
volume = {41},
pages = {475--487}
}
@conference{11572_75164,
author = { C Casetti and R Lo Cigno and M Mellia and M Munafo` and Z Zsoka },
title = {A New Class of QoS Routing Strategies Based on Network Graph Reduction},
year = {2003},
publisher = {Elsevier North-Holland, Inc.},
address = {Amsterdam},
volume = {Volume 41 , Issue 4 (March 2003)},
booktitle = {Computer Networks: The International Journal of Computer and Telecommunications Networking},
pages = {475--487}
}
@inbook{11572_12779,
author = { R FRACCHIA and M GARETTO and R LO CIGNO },
title = {A Queueing Network Model of Short-Lived TCP Flows with Mixed Wired and Wireless Access Links},
year = {2003},
publisher = {Springer},
address = {BERLIN},
volume = {LNCS2601},
booktitle = {Quality of Service in Multiservice IP Networks},
pages = {392--392}
}
@conference{11572_48483,
author = { R Fracchia and M Garetto and R Lo Cigno },
title = {A queueing network model of short-lived TCP flows with mixed wired and wireless access links},
year = {2003},
publisher = {Springer},
address = {Berlin/Heidelberg},
booktitle = {Lecture Notes in Computer Science},
doi = {10.1007/3-540-36480-3_28},
pages = {392--404}
}
@misc{11572_16357,
author = { C KIRALY and M GARETTO and R LO CIGNO and M MEO and M AJMONE MARSAN },
title = {Computation of the Completion Time Distribution of Short-Lived TCP Connections},
year = {2003},
booktitle = {1st IFIP Int.Conf. on Perf. Mod. and Eval. of Heterogeneous Networks (HetNet03)},
abstract = {Ilkley, West Yorkshire, U.K.}
}
@conference{11572_45736,
author = { C Kiraly and M Garetto and R Lo Cigno and M Meo and M Ajmone Marsan },
title = {Computation of the completion time distribution of short-Lived TCP connections},
year = {2003},
publisher = {University of Bradford},
address = {Londra},
booktitle = {Performance modelling and evaluation of heterogeneous networks (HetNet 2003)},
pages = {1--17}
}
@misc{11572_16298,
author = { M GARETTO and M AJMONE MARSAN and R LO CIGNO and M MEO },
title = {On the Convergence of Fixed Point approximations to Study Congested Networks Loaded by TCP Traffic},
year = {2003},
booktitle = {IEEE GLOBECOM 2003},
abstract = {S.Francisco, CA, USA}
}
@misc{11572_16353,
author = { G MARDENTE and C CASETTI and R LO CIGNO and M MELLIA and M MUNAFO },
title = {On-line Routing Optimization for MPLS-based IP Networks},
year = {2003},
booktitle = {IEEE High Performance Switching and Routing (HPSR 2003)},
abstract = {Turin, Italy}
}
@conference{11572_52171,
author = { C Casetti and G Mardente and M Mellia and M Munafo` and R Lo Cigno },
title = {On-line routing optimization for MPLS-based IP networks},
year = {2003},
publisher = {IEEE},
address = {Torino},
booktitle = {proceeding of HPSR'03},
pages = {215--220}
}
@conference{11572_48195,
author = { M Bagnus and R Lo Cigno },
title = {TCP-SACK analysis and imprevement through OMQN models},
year = {2003},
publisher = {Springer},
address = {Berlin/heidelberg},
booktitle = {Lecture Notes in Computer Science},
pages = {405--418}
}
@inbook{11572_12781,
author = { M BAGNUS and R LO CIGNO },
title = {TCP-SACK Analysis and Improvement through OMQN Models},
year = {2003},
publisher = {Springer},
address = {BERLIN},
volume = {LNCS2601},
booktitle = {Quality of Service in Multiservice IP Networks}
}
@inbook{11572_12780,
author = { M MELLIA and A CARPANI and R LO CIGNO },
title = {TStat: TCP STatistic and Analisys Tool},
year = {2003},
publisher = {Springer},
address = {BERLIN},
volume = {LNCS2601},
booktitle = {Quality of Service in Multiservice IP Networks}
}
@conference{11572_35839,
author = { M Mellia and A Carpani and R Lo Cigno },
title = {TStat: TCP statistic and analisys tool},
year = {2003},
publisher = {Springer},
address = {Berlin / Heidelberg},
booktitle = {Quality of Service in Multiservice IP Networks},
pages = {145--157}
}
@conference{11572_75150,
author = { R Battiti and M Brunato and R Lo Cigno and A Villani and R Flor and G Lazzari },
title = {WILMA: an open lab for 802.11 hotspots},
year = {2003},
volume = {2775},
booktitle = {Personal Wireless Communications 2003},
pages = {163--168}
}
@article{11572_73800,
author = { M Gerla and R Lo Cigno and S Mascolo and W Weng },
title = {Generalized Window Advertising for TCP Congestion Control},
year = {2002},
journal = {EUROPEAN TRANSACTIONS ON TELECOMMUNICATIONS},
volume = {10},
pages = {549--562}
}
@article{11572_73804,
author = { C F Chiasserini and R Lo Cigno },
title = {Handovers in Wireless ATM Networks: In-Band Signaling Protocols and Performance Analysis},
year = {2002},
journal = {IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS},
volume = {1},
pages = {87--100}
}
@conference{11572_45379,
author = { M Mellia and A Carpani and R Lo Cigno },
title = {Measuring IP and TCP behavior on a Edge Node},
year = {2002},
booktitle = {Planet-IP & Nebula Joint Workshop},
url = {http://www.telematica.polito.it/planet-ip/index.html}
}
@conference{11572_75223,
author = { M Mellia and A Carpani and R Lo Cigno },
title = {Measuring IP and TCP behavior on a Edge Node},
year = {2002},
publisher = {IEEE},
address = {Piskaway},
booktitle = {Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE},
pages = {2533--2537}
}
@conference{11572_75231,
author = { M Garetto and R Lo Cigno and M Meo and E Alessio and M Ajmone Marsan },
title = {Modeling Short-Lived TCP Connections with Open Multiclass Queueing Networks},
year = {2002},
publisher = {Elsevier North-Holland, Inc.},
address = {Amsterdam},
booktitle = {Computer Networks: The International Journal of Computer and Telecommunications Networking},
pages = {153--176}
}
@article{11572_70901,
author = { M Ajmone Marsan and A Bianco and R Lo Cigno and M Munafo` and M Baldi },
title = {Performance of transport protocols over ATM networks},
year = {2002},
journal = {SIMULATION},
volume = {78},
pages = {219--230}
}
@article{11572_70977,
author = { F Blanchini and R Lo Cigno and R Tempo },
title = {Robust Rate Control for Integrated Services Packet Networks},
year = {2002},
journal = {IEEE-ACM TRANSACTIONS ON NETWORKING},
volume = {10},
pages = {644--652}
}
@conference{11572_74952,
author = { R Lo Cigno and G Procissi and M Gerla },
title = {Sender-side TCP modifications: an analytical study},
year = {2002},
publisher = {Springer Netherlands},
address = {Amsterdam},
volume = {2345},
booktitle = {Cluster Computing},
pages = {600--611}
}
@conference{11572_75314,
author = { M Garetto and R Lo Cigno and M Meo and M Ajmone Marsan },
title = {A Detailed and Accurate Closed Queueing Network Model of Many Interacting TCP Flows},
year = {2001},
publisher = {IEEE Press},
address = {Piskaway, NJ},
volume = {20},
booktitle = {In Proc. INFOCOM 2001 - 20-th IEEE Joint Conference of the Computer and Communications Societies},
abstract = {This paper presents a new analytical model for the estimation of the performance of TCP connections. The model is based on the description of the behavior of TCP-Tahoe in terms of a closed queueing network, whose solution can be obtained with very low cost, even when the number of TCP connections that interact over the underlying IP network is huge. The protocol model can be very accurate, deriving directly from the finite state machine description of the protocol. The assessment of the accuracy of the analytical model is based on comparisons against detailed simulation experiments developed with the ns-2 package. Numerical results indicate that the proposed closed queueing network model provides extremely accurate performance estimates, not only for average values, but even for distributions, in the case of the classical single-bottleneck configuration, as well as in more complex networking setups.},
url = {http://ieeexplore.ieee.org/xpl/articleDetails.jsp?reload=true&arnumber=916668&contentType=Conference+Publications},
doi = {10.1109/INFCOM.2001.916668},
pages = {1706--1715}
}
@conference{11572_74992,
author = { C Casetti and R Lo Cigno and M Mellia and M Munafò and Z Zsoka },
title = {A Realistic Model to Evaluate Routing Algorithms in the Internet},
year = {2001},
publisher = {IEEE press},
address = {Piskaway, NJ},
booktitle = {Proc. of IEEE Global Telecommunications Conference, 2001 - GLOBECOM '01},
abstract = {This paper addresses the problem of evaluating routing algorithms via simulation in packet-switched networks when elastic traffic is involved. It highlights some deficiencies of classical approaches that fail to capture both the complex interactions of connections traversing multiple bottlenecks and common user behaviors. The paper describes an approach devised to overcome these limitations which is particularly suited for the evaluation of routing algorithms in presence of best-effort traffic. The simulation results presented offer a deeper insight into well-known routing algorithms. Through this analysis it is clear that quantitative and also qualitative behaviors of dynamic routing algorithms based on traffic measurements may be fairly different depending on the nature of the traffic loading the network, as well as depending on its interactions with the network parameters and behavior.},
url = {http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=965901},
doi = {10.1109/GLOCOM.2001.965901},
pages = {1882--1885}
}
@conference{11572_75328,
author = { M Garetto and R Lo Cigno and M Meo and E Alessio and M Ajmone Marsan },
title = {Analytical Estimation of Completion Times of Mixed NewReno and Tahoe TCP Connections over Single and Multiple Bottleneck Networks},
year = {2001},
publisher = {IEEE Press},
address = {San Antonio (TX)},
booktitle = {proceeding of Globecom 2001},
pages = {1788--1793}
}
@article{11572_71267,
author = { M Ajmone Marsan and G De Carolis and E Leonardi and R Lo Cigno and M Meo },
title = {Efficient Estimation of Call Blocking Probabilities in Cellular Mobile Telephony Networks with Customer Retrials},
year = {2001},
journal = {IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS},
volume = {19},
pages = {332--346}
}
@inbook{11572_46971,
author = { M Gerla and W Weng and R Lo Cigno },
title = {Enforcing fairness with explicit network feedback in the Internet},
year = {2001},
publisher = {IEEE},
address = {USA},
booktitle = {Local and Metropolitan Area Networks, 1999. Selected Papers. 10th IEEE Workshop on},
pages = {11--17}
}
@article{11572_73868,
author = { M Ajmone Marsan and C F Chiasserini and A Fumagalli and R Lo Cigno and M Munafò },
title = {Local and Global Handover Based on In-Band Signaling in Wireless ATM Networks},
year = {2001},
journal = {WIRELESS NETWORKS},
volume = {2},
pages = {425--436}
}
@conference{11572_73664,
author = { M Garetto and R Lo Cigno and M Ajmone Marsan and M Meo },
title = {On the Use of Queueing Network Models to Predict the Performance of TCP Connections},
year = {2001},
publisher = {Springer},
address = {Berlin / Heidelberg},
volume = {2170},
booktitle = {Evolutionary Trends of the Internet},
pages = {536--555}
}
@conference{11572_73688,
author = { C Casetti and R Lo Cigno and M Mellia and M Munafo` and Z Zsoka },
title = {Routing Algorithms Evaluation for Elastic Traffic},
year = {2001},
publisher = {IEEE press},
address = {Piskaway, NJ},
booktitle = {2001 IEEE Workshop on High Performance Switching and Routing (HPSR 2001)},
pages = {1895--1897}
}
@article{11572_73290,
author = { M Ajmone Marsan and G De Carolis and E Leonardi and R Lo Cigno and M Meo },
title = {An approximate model for the computation of blocking probabilities in cellular networks with repeated calls},
year = {2000},
journal = {TELECOMMUNICATION SYSTEMS},
volume = {15},
pages = {53--62}
}
@conference{11572_17249,
author = { AJMONE MARSAN M and DE CAROLIS G and LEONARDI E and R LO CIGNO and MEO M },
title = {Approximate Markovian Models of Cellular Mobile Telephone Networks with Customer Retrials},
year = {2000},
booktitle = {IEEE ICC 2000},
abstract = {New Orleans, Louisiana, USA}
}
@misc{11572_17248,
author = { WENG W and GERLA M and R LO CIGNO },
title = {Bandwidth feedback control of TCP and real time sources in the Internet},
year = {2000},
booktitle = {IEEE Globecom 2000},
abstract = {San Francesco, CA, USA}
}
@article{11572_65838,
author = { C Casetti and R Lo Cigno and M Mellia },
title = {Load-Balancing Solutions for Static Routing Schemes in ATM Networks},
year = {2000},
journal = {COMPUTER NETWORKS},
volume = {34},
abstract = {Special Issue on Performance Modelling and Evaluation of ATM Networks},
doi = {10.1016/S1389-1286(00)00104-3},
pages = {169--180}
}
@misc{11572_16295,
author = { CASETTI C and R LO CIGNO and MELLIA M and MUNAFO' M and ZSOKA Z },
title = {QoS Routing Strategies when Link State Information is Out-of-Date},
year = {2000},
booktitle = {Eighth IFIP Workshop on Performance Modelling and Evaluation of ATM & IP Networks},
abstract = {Ilkley, West Yorkshire, U.K.}
}
@conference{11572_20560,
author = { Lo Cigno R.},
title = {QoS Routing Strategies when Link State Information is Out-of-Date},
year = {2000},
booktitle = {Workshop on Performance Modelling and Evaluation of ATM & IP proceeding}
}
@inbook{11572_48459,
author = { Lo Cigno R.},
title = {Wireless ATM: An Introduction and Performance Issues},
year = {2000},
publisher = {Kluwer},
address = {Nowell, MA, USA},
booktitle = {Performance Modelling and Applications of ATM Networks},
pages = {309--331}
}
@article{11572_58051,
author = { M Ajmone Marsan and R Lo Cigno and M Meo and E De Sousza E Silva },
title = {A Markovian model for TCP over ATM},
year = {1999},
journal = {TELECOMMUNICATION SYSTEMS},
volume = {12},
pages = {341--368}
}
@misc{11572_16284,
author = { GERLA M and R LO CIGNO and WENG W },
title = {BA-TCP: A Bandwidth Aware TCP for Satellite Networks},
year = {1999},
booktitle = {8-th International Conference on ComputerCommunications and Networks -- ICCCN'99},
abstract = {Boston-Natick, MA, USA}
}
@article{11572_74766,
author = { R Lo Cigno and M Gerla },
title = {Modeling Window Based Congestion Control Protocols with Many Flows},
year = {1999},
journal = {PERFORMANCE EVALUATION},
volume = {36},
pages = {289--306}
}
@misc{11572_16285,
author = { CASETTI C and R LO CIGNO and MELLIA M },
title = {QoS-Aware Routing Schemes Based on Hierarchical Load-Balancing for Integrated Services Packet Networks},
year = {1999},
booktitle = {IEEE International Communication Conference (ICC'99)},
abstract = {Vancouver, Canada}
}
@misc{11572_16286,
author = { AJMONE MARSAN M and DE CAROLIS G and LEONARDI E and R LO CIGNO and MEO M },
title = {An Approximate Model for the Computation of Blocking Probabilities in Cellular Networks with Repeated Calls},
year = {1998},
booktitle = {11th ITC Specialists Seminar "Multimedia and Nomadic Communications"},
abstract = {Yokohama, Japan}
}
@article{11572_50293,
author = { M Ajmone Marsan and A Bianco and C Casetti and C Chiasserini and A Francini and R Lo Cigno and M Munafo` },
title = {An Integrated Simulation Environment for the Analysis of ATM Networks at Multiple Time Scales},
year = {1998},
journal = {COMPUTER NETWORKS},
volume = {29},
pages = {2165--2185}
}
@conference{11572_16288,
author = { BLANCHINI F and R LO CIGNO and TEMPO R },
title = {Control of ATM Networks: Fragility and Robustness Issues},
year = {1998},
booktitle = {American Control Conference 1998},
abstract = {Philadelphia, PA, USA}
}
@misc{11572_16287,
author = { CHIASSERINI C F and R LO CIGNO and SCARRONE E },
title = {Handovers in Wireless ATM: An In-Band Signaling Solution},
year = {1998},
booktitle = {IEEE 1998 International Conference on Universal Personal Communications (ICUPC'98)},
abstract = {Florence, Italy}
}
@conference{11572_16289,
author = { CORNAGLIA B and SANTANIELLO R and NERI F and LEONARDI E and R LO CIGNO and MEO M and SARACINO D },
title = {LMDS Systems: A Possible Solution for Wireless ATM Access Networks},
year = {1998},
booktitle = {IEEE International Conference on ATM (ICATM'98)},
abstract = {Colmar, France}
}
@article{11572_73151,
author = { M Ajmone Marsan and C Chiasserini and A Fumagalli and R Lo Cigno and M Munafo` },
title = {Local and Global Handover Based on In-BandSignaling in Wireless ATM Networks},
year = {1998},
journal = {WIRELESS NETWORKS},
volume = {2},
pages = {28--36}
}
@misc{11572_16290,
author = { AJMONE MARSAN M and BEGAIN K and R LO CIGNO and MUNAFO' M },
title = {Stop & Go ABR: A Simple Algorithm for the Implementation of Best Effort Services in ATM LANs},
year = {1998},
booktitle = {Fourth International Conference on Broadband Communications '98},
abstract = {Stuttgart, Germany}
}
@misc{11572_16292,
author = { AJMONE MARSAN M and BIANCO A and CASETTI C and CHIASSERINI C F and FRANCINI A and R LO CIGNO and MELLIA M and MUNAFO' M },
title = {An Integrated Software Environment for the Simulation of ATM Networks},
year = {1997},
booktitle = {SCSC'97, Summer Computer Simulation Conference},
abstract = {Arlington, Virginia, USA}
}
@misc{11572_16293,
author = { AJMONE MARSAN M and CHIASSERINI C F and FUMAGALLI A and R LO CIGNO and MUNAFO' M },
title = {Buffer Requirements for Loss-Free Handovers in Wireless ATM Networks},
year = {1997},
booktitle = {IEEE ATM'97 Workshop},
abstract = {Lisboa, Portugal}
}
@article{11572_71840,
author = { M Ajmone Marsan and C Chiasserini and A Fumagalli and R Lo Cigno and M Munafo` },
title = {Local and Global Handovers for Mobility Management in Wireless ATM Networks},
year = {1997},
journal = {IEEE WIRELESS COMMUNICATIONS},
volume = {4},
abstract = {\'Special Issue on Mobility and Location: A European Perspective\', No. 5},
pages = {16--24}
}
@conference{11572_16291,
author = { AJMONE MARSAN M and BALDI M and BIANCO A and R LO CIGNO and MUNAFO' M },
title = {On the Performance of Transport Protocols Over ATM Networks},
year = {1997},
booktitle = {ICCC'97, International Conference for Computer Communications},
abstract = {Cannes, France}
}
@misc{11572_16294,
author = { AJMONE MARSAN M and BEGAIN K and R LO CIGNO and MUNAFO' M },
title = {Performance of TCP File Transfers over the Explicit Rate ABR ATM Service Category},
year = {1997},
booktitle = {5th International Conference on Telecommunication Systems Modelling and Analysis},
abstract = {Nashville, TN, USA}
}
@article{11572_60659,
author = { M Ajmone Marsan and A Bianco and T Do and L Jereb and R Lo Cigno and M Mufanò },
title = {ATM Simulation with CLASS},
year = {1995},
journal = {PERFORMANCE EVALUATION},
volume = {24},
pages = {137--159}
}
@article{11572_24579,
author = { E Bahya and R Lo Cigno and S Rasmussen },
title = {Validation Tests of TOPSIM IV},
year = {1993},
journal = {ESA JOURNAL},
volume = {249},
pages = {145--160}
}
@article{11572_44996,
author = { G Albertengo and F Borgonovo and P Civera and L Fratta and R Lo Cigno and G Panizzardi and G Piccinini and M Zamboni },
title = {Deflection Network: Principles, Implementation, Services},
year = {1992},
journal = {EUROPEAN TRANSACTIONS ON TELECOMMUNICATIONS},
volume = {3},
pages = {233--240}
}
@conference{11572_156279,
author = { Kirchner Davide and Ferdous Raihana and Lo Cigno Renato and Maccari Leonardo and Gallo Massimo and Perino Diego and Saino Lorenzo },
title = {Augustus: a CCN router for programmable networks},
year = {2016},
publisher = {ACM},
address = {New York, NY, USA},
booktitle = {Proceedings of the 3rd ACM Conference on Information-Centric Networking},
doi = {10.1145/2984356.2984363},
pages = {31--39}
}
@conference{11572_156737,
author = { Segata Michele and Goss Davide and Lo Cigno Renato },
title = {Distributed EDCA bursting: Improving cluster-based communication in IVC},
year = {2016},
publisher = {Association for Computing Machinery, Inc},
address = {New York, NY, USA},
booktitle = {Proceedings of the 1st MobiHoc International Workshop on Internet of Vehicles and Vehicles of Internet (IoV-VoI 2016)},
keywords = {Clustering; EDCA bursting, IEEE 802.11; Inter-vehicle communication; Software; Computer Science Applications1707 Computer Vision and Pattern Recognition; Computer Networks and Communications},
doi = {10.1145/2938681.2938686},
pages = {13--18}
}
@article{11572_168494,
author = { Kandalintsev Alexander and Kliazovich Dzmitry and Lo cigno Renato },
title = {Freeze'nSense: Estimation of performance isolation in cloud environments},
year = {2016},
journal = {SOFTWARE-PRACTICE & EXPERIENCE},
volume = {on-line},
abstract = {Modern computing hardware has a very good task parallelism, but resource contention between tasks remains high. This renders large fractions of CPU time wasted and leads to application interference. Even tasks running on dedicated CPU cores can still incur interference from other tasks, most notably because of the caches and other hardware components shared by more than one core. The level of interference depends on the nature of executed tasks and is difficult to predict. A customer who has been granted that his task will run as if it were alone (e.g., a CPU core dedicated to a virtual machine), indeed suffers from significant performance degradation due to the time spent waiting for resources occupied by other tasks. Measuring actual performance of a task or a virtual machine can be difficult. However, even more challenging is estimating what the performance of the task should be if it were running completely in isolation. In this paper, we present a measurement technique Freeze'nSense. It is based on the hardware performance counters and allows measuring actual performance of a task and estimating performance as if the task were in isolation, all during runtime. To estimate performance in isolation, the proposed technique performs a short-time freezing of the potentially interfering tasks. Freeze'nSense introduces lower than 1% overhead and is confirmed to provide accurate and reliable measurements. In practice, Freeze'nSense becomes a valuable tool helping to automatically identify tasks that suffer the most in a shared environment and move them to a distant core. The observed performance improvement can be as large as 80–100% for individual tasks, and scale up to 15–20% for the computing node.},
keywords = {Application profiling; Cloud services; Computation interference; Data-center management; Hardware performance counters; Performance isolation; Performance measure; Resource management; Software},
url = {http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1097-024X},
doi = {10.1002/spe.2456},
pages = {N/A--N/A}
}
@misc{11572_172141,
author = {Maccari, Leonardo and Lo Cigno, Renato},
title = {Tuning the Robustness of Routing Information Diffusion with Multi-Point Relays},
year = {2017},
publisher = {Università degli Studi di Trento},
address = {Trento},
abstract = {Optimized Link State Routing is one of the most used routing protocol in wireless networks: static, mobile, ad- hoc, mesh, and even sensor networks. The selection of Multi-Point Relays (MPRs) to build a backbone for signalling traffic, which is often also used to route user traffic, is at the hearth of the protocol and its efficiency is crucial to the protocol efficiency as well as to the entire network topology management. Several heuristics exist that try to minimize the number of MPRs in order to reduce the overall signaling traffic. A recent one, called Selector Set Tie Breaker (SSTB) showed that the number of MPRs can be reduced to a few units in dense networks with hundreds of nodes. This greatly reduces the signaling traffic but also the redundancy of the information that is spread in the network. This paper investigates the consequences of the reduction of the number of MPRs on the robustness of the routing function and introduces a coefficient and a tuning parameter to influence it.},
pages = {1--6}
}
@article{11572_175081,
author = {Santini, Stefania and Salvi, Alessandro and Valente, Antonio Saverio and Pescape, Antonio and Segata, Michele and Lo Cigno, Renato},
title = {A Consensus-Based Approach for Platooning with Intervehicular Communications and Its Validation in Realistic Scenarios},
year = {2017},
journal = {IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY},
volume = {66},
keywords = {Distributed consensus; Lyapunov-Razumikhin; multiple time-varying communication delays; platooning; vehicle to vehicle; vehicular ad hoc network; Automotive Engineering; Aerospace Engineering; Computer Networks and Communications; Applied Mathematics; Electrical and Electronic Engineering},
doi = {10.1109/TVT.2016.2585018},
pages = {1985--1999}
}
@conference{11572_175121,
author = {Segata, Michele and Lo Cigno, Renato},
title = {On the feasibility of collision detection in full-duplex 802.11 radio},
year = {2017},
publisher = {Institute of Electrical and Electronics Engineers Inc.},
address = {IEEE Operations Center, 445 Hoes Lane, Piscataway, NJ 08854, USA},
booktitle = {2017 13th Annual Conference on Wireless On-Demand Network Systems and Services, WONS 2017 - Proceedings},
keywords = {Hardware and Architecture; Computer Networks and Communications},
doi = {10.1109/WONS.2017.7888755},
pages = {9--16}
}
@conference{11572_175126,
author = {Krupitzer, Christian and Breitbach, Martin and Saal, Johannes and Becker, Christian and Segata, Michele and Lo Cigno, Renato},
title = {RoCoSys: A framework for coordination of mobile IoT devices},
year = {2017},
publisher = {IEEE},
address = {IEEE Operations Center, 445 Hoes Lane, Piscataway, NJ 08854, USA},
booktitle = {2017 IEEE International Conference on Pervasive Computing and Communications Workshops (PerCom Workshops)},
doi = {10.1109/PERCOMW.2017.7917611},
pages = {485--490}
}
@conference{11572_175137,
author = {Segata, Michele and Vijeikis, Romas and Lo Cigno, Renato},
title = {Communication-based Collision Avoidance between Vulnerable Road Users and Cars},
year = {2017},
publisher = {IEEE},
address = {IEEE Operations Center, 445 Hoes Lane, Piscataway, NJ 08854, USA},
booktitle = {IEEE INFOCOM 2017 - The 36th Annual IEEE International Conference on Computer Communications},
abstract = {The advent of wireless communication for vehicles paves the road for a bounty of cooperative applications: The most interesting being cooperative safety awareness. By exchanging information vehicles can become aware of each other and prevent dangerous situations that can lead to crashes either by early warning drivers or by automatic vehicle control, a solution particularly appealing for self-driving cars. While research on vehicular safety mainly focuses on vehicle-to-vehicle safety, we can exploit communication to implement applications aimed at protecting vulnerable road users, such as pedestrians or cyclists. In this paper, we start by exploiting a probability framework for estimating the likelihood of collision between a vehicles approaching an intersection and a cyclist, in light of the feasibility of communication between the two. On top of this framework, we design a simple application that, under certain conditions, informs the car driver (assumed to have to yield precedence) of the possible collision. We model the reaction of the driver to the warning and analyze possible benefits and drawbacks of such an application. The contribution is not the application itself, which is obvious, but the insights in the results in light of communication capabilities and human reaction that provide a specific set of aspects that should be considered in the design of such a safety system.}
}
@conference{11572_175043,
author = {Maccari, Leonardo and Nguyen, Quynh and Lo Cigno, Renato},
title = {On the computation of centrality metrics for network security in mesh networks},
year = {2016},
publisher = {Institute of Electrical and Electronics Engineers Inc.},
address = {IEEE Operations Center, 445 Hoes Lane, Piscataway, NJ 08854, USA},
booktitle = {2016 IEEE Global Communications Conference, GLOBECOM 2016 - Proceedings},
keywords = {Computational Theory and Mathematics; Computer Networks and Communications; Hardware and Architecture; Safety, Risk, Reliability and Quality},
doi = {10.1109/GLOCOM.2016.7842049},
pages = {1--6}
}
@article{11572_175049,
author = {Segata, Michele and Dressler, Falko and Lo Cigno, Renato},
title = {Let's talk in groups: A distributed bursting scheme for cluster-based vehicular applications},
year = {2016},
journal = {VEHICULAR COMMUNICATIONS},
volume = {2016},
keywords = {Clustering; EDCA bursting; IEEE 802.11; Inter-vehicle communication; Communication; Automotive Engineering; Electrical and Electronic Engineering},
url = {http://www.journals.elsevier.com/vehicular-communications/},
doi = {10.1016/j.vehcom.2016.11.006}
}
@article{11572_178955,
author = {Baldesi, Luca and Maccari, Leonardo and Lo Cigno, Renato Antonio},
title = {On the Use of Eigenvector Centrality for Cooperative Streaming},
year = {2017},
journal = {IEEE COMMUNICATIONS LETTERS},
volume = {2017, volume 21},
abstract = {The timely and efficient cooperative distribution of a streamlined content in a communication network is a key feature for many applications and services. One of the unsolved problems is the assignment of transmission rates to nodes given the constraints imposed by the topology, so that all nodes receive the stream with the minimal global use of resources. This paper addresses the problem exploiting the notion of eigenvector centrality. It shows that the problem can be solved efficiently in a distributed way if every node is aware of the full network topology and that in certain cases only local information on the network graph is sufficient.},
keywords = {Live Streaming, Rate Allocation, Cooperative 1Streaming, Video Distribution},
url = {http://ieeexplore.ieee.org/document/7942071/},
doi = {10.1109/LCOMM.2017.2713361},
pages = {1953--1956}
}
@conference{11572_181495,
author = {Maturi, Francesco and Gringoli, Francesco and Lo Cigno, Renato},
title = {A dynamic and autonomous channel selection strategy for interference avoidance in 802.11},
year = {2017},
publisher = {IFIP and Institute of Electrical and Electronics Engineers Inc.},
address = {USA},
booktitle = {13th Annual Conference on Wireless On-Demand Network Systems and Services, WONS 2017 - Proceedings},
abstract = {The coexistence of different technologies within the same spectrum swaths, as well as the distributed, non-coordinated channel assignment for WLANs is becoming not only an important research topic, but also a matter of sustainability for the trend we witness in moving all last-hop communications on wireless links to unleash the users from their wires and tethers. This work proposes, implements and evaluates a strategy that allows an entire 802.11 Basic Service Set (BSS) to dynamically hop between the available channels always selecting the “best” one. The selection not only guarantees the hopping BSS performances well above what can be achieved with a static selection, but it also minimizes the interference toward other BSSs, so that the overall performance of the system maximizes resource utilization. The performance of the protocol and strategy we propose is tested with an implementation on off-the-shelf 802.11g cards; the experiments are run in labs and around the campus of the University of Trento.},
keywords = {Hardware and Architecture; Computer Networks and Communications},
url = {http://ieeexplore.ieee.org/document/7888756/},
doi = {10.1109/WONS.2017.7888756},
pages = {1--8}
}
@article{11572_182467,
author = {Maccari, Leonardo and Facchi, Nicolò and Baldesi, Luca and Lo Cigno, Renato},
title = {Optimized P2P streaming for wireless distributed networks},
year = {2017},
journal = {PERVASIVE AND MOBILE COMPUTING},
volume = {2017},
abstract = {The future Internet will support pervasive applications and communications models that require end-nodes cooperation, such as fog computing and machine-to-machine communications. Among the many applications, also video streaming can be provided with a cooperative and peer-to-peer approach. Cooperative distribution requires building a distribution overlay on top of the physical topology (the underlay). This work proposes an optimized, cross-layer approach to build this overlay minimizing the impact on the underlay. We design an optimal strategy, which is proven to be NP-complete, and thus not solvable with a distributed, lightweight protocol. The optimal strategy is relaxed exploiting the knowledge on the betweenness centrality of the nodes in the underlay topology, obtaining two easily implementable solutions applicable to any link-state protocol for distributed wireless mesh networks. The additional introduction of heuristic improvements further optimizes the performance in real network scenarios. Extensive simulation results support the theoretical findings using three different network topologies. They show that the relaxed implementations are reasonably close to the optimal solution, and provide vast gains compared to the traditional overlay topologies that peer-to-peer applications build.},
keywords = {Ad-hoc networks; Mesh networks; P2P video streaming; Computer Science (miscellaneous); Applied Mathematics},
url = {http://www.sciencedirect.com/science/article/pii/S1574119216303443},
doi = {10.1016/j.pmcj.2017.05.006},
pages = {1--12}
}
@misc{11572_183393,
author = {Giordano, Giulia and Segata, Michele and Blanchini, Franco and Lo Cigno, Renato},
title = {A Joint Network/Control Design for Cooperative Automatic Driving: Extended Version},
year = {2017},
publisher = {University of Trento},
address = {Trento},
volume = {DISI - Technical Report},
abstract = {Cooperative automatic driving, or platooning, is a promising solution to improve traffic safety, while reducing congestion and pollution. The design of a control system for this application is a challenging, multi-disciplinary problem, as cooperation between vehicles is obtained through wireless communication. So far, control and network issues of platooning have been investigated separately. In this work we design a cooperative driving system from a joint network and control perspective, determining worst-case upper bounds on the safety distance subject to network losses, so the actual inter-vehicle gap can be tuned depending on vehicle or network performance. By means of simulation, we show that the system is very robust to packet losses and that the derived bounds are never violated.}
}
@conference{11572_193508,
author = {Giulia, Giordano and Michele, Segata and Franco, Blanchini and Renato Lo Cigno},
title = {A Joint Network/Control Design for Cooperative Automatic Driving},
year = {2017},
publisher = {IEEE},
address = {445 Hoes Lane, Piscataway, NJ 08854, USA},
booktitle = {9th IEEE Vehicular Networking Conference (VNC 2017)},
abstract = {Cooperative automatic driving, or platooning, is a promising solution to improve traffic safety, while reducing congestion and pollution. The design of a control system for this application is a challenging, multi-disciplinary problem, as cooperation between vehicles is obtained through wireless communication. So far, control and network issues of platooning have been investigated separately. In this work we design a cooperative driving system from a joint network and control perspective, determining worst-case upper bounds on the safety distance subject to network losses, so the actual inter-vehicle gap can be tuned depending on vehicle or network performance. By means of simulation, we show that the system is very robust to packet losses and that the derived bounds are never violated.},
pages = {167--174}
}
@conference{11572_204025,
author = {Ghiro, Lorenzo and Maccari, Leonardo and Cigno, Renato Lo},
title = {Proof of networking: Can blockchains boost the next generation of distributed networks?},
year = {2018},
publisher = {IEEE},
address = {IEEE Operations Center, 445 Hoes Lane, Piscataway, NJ 08854, USA},
booktitle = {Proc. of the 14th Annual Conference on Wireless On-demand Network Systems and Services (WONS)},
doi = {10.23919/WONS.2018.8311658},
pages = {29--32}
}
@conference{11572_204030,
author = {Maccari, Leonardo and Ghiro, Lorenzo and Guerrieri, Alessio and Montresor, Alberto and Lo Cigno, Renato},
title = {On the Distributed Computation of Load Centrality and Its Application to DV Routing},
year = {2018},
publisher = {IEEE},
address = {IEEE Operations Center, 445 Hoes Lane, Piscataway, NJ 08854, USA},
booktitle = {Proc. of IEEE International Conference on Computer Communications (INFOCOM)},
keywords = {accepted}
}
@article{11572_210208,
author = {Maccari, Leonardo and Maischberger, Mirko and Cigno, Renato Lo},
title = {Where have all the MPRs gone? On the optimal selection of Multi-Point Relays},
year = {2018},
journal = {AD HOC NETWORKS},
volume = {77},
doi = {10.1016/j.adhoc.2018.04.012},
pages = {69--83}
}
@article{11572_215438,
author = {Dressler, Falko and Klingler, Florian and Segata, Michele and Lo Cigno, Renato},
title = {Cooperative Driving and the Tactile Internet},
year = {2018},
journal = {PROCEEDINGS OF THE IEEE},
volume = {2018},
abstract = {The trend towards autonomous driving and the recent advances in vehicular networking led to a number of very successful proposals towards cooperative driving. Maneuvers can be coordinated among participating vehicles and controlled by means of wireless communications. One of the most challenging scenario or application in this context is Cooperative Adaptive Cruise Control (CACC) or platooning. When it comes to realizing safety gaps between the cars of less than 5m, very strong requirements on the communication system need to be satisfied. The underlying distributed control system needs regular updates of sensor information from the other cars in the order of about 10 Hz. This leads to message rates in the order of up to 10 kHz for large networks, which, given the possibly unreliable wireless communication and the critical network congestion, is beyond the capabilities of current vehicular networking concepts. In this article, we summarize the concepts of networked control systems and revisit the capabilities of current vehicular networking approaches. We then present opportunities of Tactile Internet concepts that integrate interdisciplinary approaches from both control theory, mechanical engineering, and communication protocol design. This way, it becomes possible to solve the high reliability and latency issues in this context.},
doi = {10.1109/JPROC.2018.2863026}
}
@article{11572_215440,
author = {Santini, Stefania and Salvi, Alessandro and Valente, Antonio Saverio and Pescapè, Antonio and Segata, Michele and Lo Cigno, Renato},
title = {Platooning Maneuvers in Vehicular Networks: a Distributed and Consensus-Based Approach},
year = {2018},
journal = {IEEE TRANSACTIONS ON INTELLIGENT VEHICLES},
volume = {2018},
abstract = {Cooperative driving is an essential component of future intelligent road systems. It promises greater safety, reducing accidents due to drivers distraction, improved infrastructure utilization, and fuel consumption reduction with platooning applications. Proper platoon management requires Inter-Vehicular Communication (IVC), longitudinal control and stability, lateral control for and safety, and protocols, proper application and platoons, algorithms to manage and perform coordinated maneuvers.This work shows how a longitudinal controller based on distributed consensus can, at the same time, guarantee stability and performance in regime platoon operations, and protocols, be at the hearth of maneuvering and algorithms, as it remains stable in face of changes of platoon topology and system, control gains. The adoption of a single control algorithm for two fundamental tasks greatly simplify the overall design of the and stability, improves and mobility, safety as it is not required to switch between different controllers during platoon operation. The theoretical properties are proven in the first part of the paper. The second part of the paper is devoted to its implementation in a state-of- the-art and IVC simulator, which is used for an extensive experimental campaign showing the dynamic properties of the system and its performance in a set of typical platoon maneuvers as join, leave and inclusion of a vehicle in the middle of the platoon. All simulations include realistic details of the vehicle dynamics (mass, dimensions, power train dynamics) as well as extremely detailed modeling of the communication network, from 802.11p protocol details, to collisions, packet errors, path loss and fading on the channel, and delays., source-destination based}
}
@conference{11572_215436,
author = {Segata, Michele and Facchi, Nicolò and Maccari, Leonardo and Gemmi, Gabriele and Lo Cigno, Renato},
title = {Centrality-based Route Recovery in Wireless Mesh Networks},
year = {2018},
publisher = {IEEE},
address = {IEEE Operations Center, 445 Hoes Lane, Piscataway, NJ 08854, USA},
booktitle = {IEEE International Conference on Communications (ICC 2018)},
abstract = {Wireless Mesh Networks are subject to frequent node and link failures, and routing protocols currently used, such as Optimized Link State Routing (OLSR) or Babel (Babel), suffer from relatively long recovery times characterized by broken and looped routes due to long timeouts that can not be shortened to keep the overhead at an acceptable level. This paper experiments a novel timer management technique named Pop-Routing on top of OLSR. Pop-Routing exploits the notion of betweenness centrality to tune timers depending on the node position in the network, so that failures that lead to larger traffic losses can be recovered faster. Pop-Routing maintains the overhead constant, but favors the most central nodes, whose failure is devastating from the performance point of view, and penalizes peripheral ones and leaves of the topology, whose failure has a very little impact on the entire network. Pop-Routing has been implemented as a plug-in in the OLSR daemon, coupled with an external process, named Prince, that computes centrality and timer values without interfering with the routing daemon. Experiments are run on the WiSHFUL showing the benefit of Pop-tuning of OLSR Hello and Traffic Control timers.}
}
@conference{11572_215434,
author = {Segata, Michele and Facchi, Nicolò and Maccari, Leonardo and Lo Cigno, Renato},
title = {RoRoute: Tools to Experiment with Routing Protocols in WMNs},
year = {2018},
publisher = {IEEE},
address = {IEEE Operations Center, 445 Hoes Lane, Piscataway, NJ 08854, USA},
booktitle = {14th IEEE/IFIP Conference on Wireless On demand Network Systems and Services (WONS 2018)}
}
This file was generated by bibtex2html 1.97.