Fabio Ricciato - Academia.edu (original) (raw)
Papers by Fabio Ricciato
Computer Networks, 2013
Recently, Secure-Multiparty Computation (SMC) has been proposed as an approach to enable inter-do... more Recently, Secure-Multiparty Computation (SMC) has been proposed as an approach to enable inter-domain network monitoring while protecting the data of individual ISPs. The SMC family includes many different techniques and variants, featuring different forms of ''security'', i.e., against different types of attack (er), and with different levels of computation complexity and communication overhead. In the context of collaborative network monitoring, the rate and volume of network data to be (securely) processed is massive, and the number of participating players is large, therefore scalability is a primary requirement. To preserve scalability one must sacrifice other requirement, like verifiability and computational completeness that, however, are not critical in our context. In this paper we consider two possible schemes: the Shamir's Secret Sharing (SSS), based on polynomial interpolation on prime fields, and the Globally-Constrained Randomization (GCR) scheme based on simple blinding. We address various system-level aspects and quantify the achievable performance of both schemes. A prototype version of GCR has been implemented as an extension of SEPIA, an open-source SMC library developed at ETH Zurich that supports SSS natively. We have performed a number of controlled experiments in distributed emulated scenarios for comparing SSS and GCR performance. Our results show that additions via GCR are faster than via SSS, that the relative performance gain increases when scaling up the data volume and/or number of participants, and when network conditions get worse. Furthermore, we analyze the performance degradation due to sudden node failures, and show that it can be satisfactorily controlled by containing the fault probability below a reasonable level.
2012 10th International Symposium on Modeling and Optimization in Mobile Ad Hoc and Wireless Networks, 2012
In this informal contribution we raise a couple of remarks and requests for clarification about s... more In this informal contribution we raise a couple of remarks and requests for clarification about some recent papers in the field of traffic analysis. These cases are illustrative of the kind of issues and open points that are encountered when reading, applying and working with published papers. The readers and followers of each published paper -especially of the best ones -form naturally a small community of interest. In most cases the remarks to the paper are of interest for them all. Based on these considerations we raise the following proposal to the research community: let each conference and/or journal editor maintain an open public wiki-like commenting platform for publishing comments and rebuttals after the paper publication.
2007 Fourth Annual Conference on Wireless on Demand Network Systems and Services, 2007
Video and Multimedia Transmissions over Cellular Networks, 2009
2008 6th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks and Workshops, 2008
We present a measurement method that allows to capture the complete set of all PSDU (PLCP Service... more We present a measurement method that allows to capture the complete set of all PSDU (PLCP Service Data Unit) transmissions and receptions in live IEEE 802.11b/g links with very high timing resolution. This tool provides an in-depth view of the statistics of frame-losses as it makes it possible to distinguish between different loss types such as complete miss, partial corruption and physical-layer capture. Getting access to this low-level statistics on nodes that actively participate in transmissions themselves is a challenging task since the software-interface provided to the network layer needs to remain untouched and cannot be used for tracing. In this contribution we describe in detail how to non-intrusively circumvent these restrictions and also present initial results.
We present a general framework for improving and extending GNSS--based positioning by leveraging ... more We present a general framework for improving and extending GNSS--based positioning by leveraging opportunistic measurements from legacy terrestrial radio signals. The proposed approach requires only that participating nodes collect and share reception timestamps of incoming packets and/or other reference signals transmitted by other fixed or mobile nodes, with no need of inter--node synchronization. The envisioned scheme couples the idea of cooperative GNSS augmentation with recent pioneering work in the field of time--based localization in asynchronous networks. In this contribution we present the fundamental principles of the proposed approach and discuss the system--level aspects that make it particularly appealing and timely for Cooperative ITS applications, with the goal of motivating further research and experimentation in this direction.
IEEE Wireless Communications, 2000
ACM SIGCOMM Computer Communication Review, 2006
In this informal contribution we raise a couple of remarks and requests for clarification about s... more In this informal contribution we raise a couple of remarks and requests for clarification about some recent papers in the field of traffic analysis. These cases are illustrative of the kind of issues and open points that are encountered when reading, applying and working with published papers. The readers and followers of each published paper -especially of the best ones -form naturally a small community of interest. In most cases the remarks to the paper are of interest for them all. Based on these considerations we raise the following proposal to the research community: let each conference and/or journal editor maintain an open public wiki-like commenting platform for publishing comments and rebuttals after the paper publication.
ACM SIGCOMM Computer Communication Review, 2006
The presence of "unwanted" (or background) traffic in the Internet is a well-known fact. In princ... more The presence of "unwanted" (or background) traffic in the Internet is a well-known fact. In principle any network that has been engineered without taking its presence into account might experience troubles during periods of massive exposure to unwanted traffic, e.g. during large-scale infections. A concrete example was provided by the spreading of Code-Red-II in 2001, which caused several routers crashes worldwide. Similar events might take place in 3G networks as well, with further potential complications arising from their high functional complexity and the scarcity of radio resources. For example, under certain hypothetical network configuration settings unwanted traffic, and specifically scanning traffic from infected Mobile Stations, can cause large-scale wastage of logical resources, and in extreme cases even starvation. Unwanted traffic is present nowdays also in GPRS/UMTS, mainly due to the widespread use of 3G connect cards for laptops. We urge the research community and network operators to consider the issue of 3G robustness to unwanted traffic as a prominent research area.
IEEE INFOCOM, 2000
Several applications of practical interest stem from the capability to monitor and store packet-l... more Several applications of practical interest stem from the capability to monitor and store packet-level traces in a 3G network. Among them, the possibility to infer and locate network problems (e.g. persistent shortage of capacity, or equipment misfunctioning), in the core and radio sections, without direct access to the equipments. This approach yields strong practical benefits, given the costs and complexity
This deliverable specifies the traffic handling mechanisms for the first trial.
This paper focuses on the potential issue of data traffic on mobile networks generated by mobile ... more This paper focuses on the potential issue of data traffic on mobile networks generated by mobile applications on smartphones. An analysis overview of the possible solutions is described, focusing on Wi-Fi Offloading at application level, as a candidate solution. We propose E.A.C.M. (Enhanced Android Connection Manager), a downloadable application-based solution, developed on an off-the-shelf Android environment to provide Mobility, Authentication
The availability of synchronized traces captured at different links allows the extraction of one-... more The availability of synchronized traces captured at different links allows the extraction of one-way delays for the network section in between. In principle one-way delay statistics van be used as quality indicators and serve as a basis to detect drifts and troubles within the network, or simply to validate the its health. Since packet delays depends not only on the status of the network but also on the arriving traffic rate, any meaningful delay analysis must go hand in hand with the analysis of the traffic patterns at short time scales. In this work we report on the traffic and delay patterns observed at short timescales at the edge of a cellular mobile network. We describe the methodological aspects and present a set of results from an operational network. We find that the aggregate traffic rate yields large impulses and investigate on their causes. Specifically, we find that high-rate sequential scanners represent a common source of traffic impulses, and discuss the potential im...
Lecture Notes in Computer Science, 2000
Lecture Notes in Computer Science, 2003
MPLS can be used to provide network robustness to faults through path protection techniques. In t... more MPLS can be used to provide network robustness to faults through path protection techniques. In this paper we present a dynamic model supporting different classes of end-to-end protection, including protection against Single Fault and Dual Fault, with and without sharing of backup bandwidth. Beyond link and node failures we also consider protection against Shared Risk Link Group (SLRG) failure. An interesting feature of the proposed scheme is the ability to offer service differentiation with respect to the recovery probability, by coupling the differentiation on the number of backup paths with bandwidth assignment policy. In this paper we describe the underlying algorithms for route selection and backup bandwidth sharing. The route selection is based on explicit load-dependent routing of service and backup paths. We show by simulation that the proposed route selection algorithm is effective in improving the network utilization. We discuss two alternative implementations of our model: distributed and partially centralized. The primary concern with the distributed approach is the message overhead implied by link-load dissemination, e.g. by flooding. However we show by simulation that message overhead can be taken under control by adopting a well-tuned adaptive overhead reduction algorithm. Our conclusion is that both distributed and partially-centralized implementation are feasible.
Globecom '00 - IEEE. Global Telecommunications Conference. Conference Record (Cat. No.00CH37137), 2000
The differentiated service architecture is proposed as a scalable approach to QoS for IP networks... more The differentiated service architecture is proposed as a scalable approach to QoS for IP networks. Therefore it is based on the aggregate (per class) scheduling of packets, but it aims at providing QoS to single flows. In particular the expedited forwarding (EF) per hop behavior (PHB) and the related premium service have been defined in order to provide determinist QoS
Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies, 2002
Coupling MPLS Traffic Engineering on top of a wavelength-routed WDM layer offersgreat flexibility... more Coupling MPLS Traffic Engineering on top of a wavelength-routed WDM layer offersgreat flexibility to op- eratorsto allocate traffic demandsin their networks . In this paper we consider the problem of off-line joint configuration at both packet and optical layers. We consider time-variant offered traffic, and assume that the operator has knowledge of the traffic dynamicsasa s et of traffic matricesat
Proceedings of the Design Automation & Test in Europe Conference, 2006
Sensor networks are emerging wireless technologies; their integration with the existing 2.5G, 3G ... more Sensor networks are emerging wireless technologies; their integration with the existing 2.5G, 3G mobile networks is a key issue to provide advanced services, e.g., health control. However this integration poses new challenges in the design and simulation of the involved embedded systems since it requires the cooperation of simulation tools that model hardware, software, and network aspects and their interactions. We present the modeling and simulation of a network scenario, core of a telecom provider's future portfolio, in which an ARM-based mobile handset is used as the gateway between a wireless sensor network (WSN) and remote users through a wide area network (WAN). Initially, the gateway and the WSN are modeled at system level with SystemC while the wide area network is modeled with NS-2. Then, HW/SW partitioning is performed on the gateway and an instruction set simulator of the ARM processor is used for the cycle-accurate execution of the RTOS and the application software.
Computer Networks, 2013
Recently, Secure-Multiparty Computation (SMC) has been proposed as an approach to enable inter-do... more Recently, Secure-Multiparty Computation (SMC) has been proposed as an approach to enable inter-domain network monitoring while protecting the data of individual ISPs. The SMC family includes many different techniques and variants, featuring different forms of ''security'', i.e., against different types of attack (er), and with different levels of computation complexity and communication overhead. In the context of collaborative network monitoring, the rate and volume of network data to be (securely) processed is massive, and the number of participating players is large, therefore scalability is a primary requirement. To preserve scalability one must sacrifice other requirement, like verifiability and computational completeness that, however, are not critical in our context. In this paper we consider two possible schemes: the Shamir's Secret Sharing (SSS), based on polynomial interpolation on prime fields, and the Globally-Constrained Randomization (GCR) scheme based on simple blinding. We address various system-level aspects and quantify the achievable performance of both schemes. A prototype version of GCR has been implemented as an extension of SEPIA, an open-source SMC library developed at ETH Zurich that supports SSS natively. We have performed a number of controlled experiments in distributed emulated scenarios for comparing SSS and GCR performance. Our results show that additions via GCR are faster than via SSS, that the relative performance gain increases when scaling up the data volume and/or number of participants, and when network conditions get worse. Furthermore, we analyze the performance degradation due to sudden node failures, and show that it can be satisfactorily controlled by containing the fault probability below a reasonable level.
2012 10th International Symposium on Modeling and Optimization in Mobile Ad Hoc and Wireless Networks, 2012
In this informal contribution we raise a couple of remarks and requests for clarification about s... more In this informal contribution we raise a couple of remarks and requests for clarification about some recent papers in the field of traffic analysis. These cases are illustrative of the kind of issues and open points that are encountered when reading, applying and working with published papers. The readers and followers of each published paper -especially of the best ones -form naturally a small community of interest. In most cases the remarks to the paper are of interest for them all. Based on these considerations we raise the following proposal to the research community: let each conference and/or journal editor maintain an open public wiki-like commenting platform for publishing comments and rebuttals after the paper publication.
2007 Fourth Annual Conference on Wireless on Demand Network Systems and Services, 2007
Video and Multimedia Transmissions over Cellular Networks, 2009
2008 6th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks and Workshops, 2008
We present a measurement method that allows to capture the complete set of all PSDU (PLCP Service... more We present a measurement method that allows to capture the complete set of all PSDU (PLCP Service Data Unit) transmissions and receptions in live IEEE 802.11b/g links with very high timing resolution. This tool provides an in-depth view of the statistics of frame-losses as it makes it possible to distinguish between different loss types such as complete miss, partial corruption and physical-layer capture. Getting access to this low-level statistics on nodes that actively participate in transmissions themselves is a challenging task since the software-interface provided to the network layer needs to remain untouched and cannot be used for tracing. In this contribution we describe in detail how to non-intrusively circumvent these restrictions and also present initial results.
We present a general framework for improving and extending GNSS--based positioning by leveraging ... more We present a general framework for improving and extending GNSS--based positioning by leveraging opportunistic measurements from legacy terrestrial radio signals. The proposed approach requires only that participating nodes collect and share reception timestamps of incoming packets and/or other reference signals transmitted by other fixed or mobile nodes, with no need of inter--node synchronization. The envisioned scheme couples the idea of cooperative GNSS augmentation with recent pioneering work in the field of time--based localization in asynchronous networks. In this contribution we present the fundamental principles of the proposed approach and discuss the system--level aspects that make it particularly appealing and timely for Cooperative ITS applications, with the goal of motivating further research and experimentation in this direction.
IEEE Wireless Communications, 2000
ACM SIGCOMM Computer Communication Review, 2006
In this informal contribution we raise a couple of remarks and requests for clarification about s... more In this informal contribution we raise a couple of remarks and requests for clarification about some recent papers in the field of traffic analysis. These cases are illustrative of the kind of issues and open points that are encountered when reading, applying and working with published papers. The readers and followers of each published paper -especially of the best ones -form naturally a small community of interest. In most cases the remarks to the paper are of interest for them all. Based on these considerations we raise the following proposal to the research community: let each conference and/or journal editor maintain an open public wiki-like commenting platform for publishing comments and rebuttals after the paper publication.
ACM SIGCOMM Computer Communication Review, 2006
The presence of "unwanted" (or background) traffic in the Internet is a well-known fact. In princ... more The presence of "unwanted" (or background) traffic in the Internet is a well-known fact. In principle any network that has been engineered without taking its presence into account might experience troubles during periods of massive exposure to unwanted traffic, e.g. during large-scale infections. A concrete example was provided by the spreading of Code-Red-II in 2001, which caused several routers crashes worldwide. Similar events might take place in 3G networks as well, with further potential complications arising from their high functional complexity and the scarcity of radio resources. For example, under certain hypothetical network configuration settings unwanted traffic, and specifically scanning traffic from infected Mobile Stations, can cause large-scale wastage of logical resources, and in extreme cases even starvation. Unwanted traffic is present nowdays also in GPRS/UMTS, mainly due to the widespread use of 3G connect cards for laptops. We urge the research community and network operators to consider the issue of 3G robustness to unwanted traffic as a prominent research area.
IEEE INFOCOM, 2000
Several applications of practical interest stem from the capability to monitor and store packet-l... more Several applications of practical interest stem from the capability to monitor and store packet-level traces in a 3G network. Among them, the possibility to infer and locate network problems (e.g. persistent shortage of capacity, or equipment misfunctioning), in the core and radio sections, without direct access to the equipments. This approach yields strong practical benefits, given the costs and complexity
This deliverable specifies the traffic handling mechanisms for the first trial.
This paper focuses on the potential issue of data traffic on mobile networks generated by mobile ... more This paper focuses on the potential issue of data traffic on mobile networks generated by mobile applications on smartphones. An analysis overview of the possible solutions is described, focusing on Wi-Fi Offloading at application level, as a candidate solution. We propose E.A.C.M. (Enhanced Android Connection Manager), a downloadable application-based solution, developed on an off-the-shelf Android environment to provide Mobility, Authentication
The availability of synchronized traces captured at different links allows the extraction of one-... more The availability of synchronized traces captured at different links allows the extraction of one-way delays for the network section in between. In principle one-way delay statistics van be used as quality indicators and serve as a basis to detect drifts and troubles within the network, or simply to validate the its health. Since packet delays depends not only on the status of the network but also on the arriving traffic rate, any meaningful delay analysis must go hand in hand with the analysis of the traffic patterns at short time scales. In this work we report on the traffic and delay patterns observed at short timescales at the edge of a cellular mobile network. We describe the methodological aspects and present a set of results from an operational network. We find that the aggregate traffic rate yields large impulses and investigate on their causes. Specifically, we find that high-rate sequential scanners represent a common source of traffic impulses, and discuss the potential im...
Lecture Notes in Computer Science, 2000
Lecture Notes in Computer Science, 2003
MPLS can be used to provide network robustness to faults through path protection techniques. In t... more MPLS can be used to provide network robustness to faults through path protection techniques. In this paper we present a dynamic model supporting different classes of end-to-end protection, including protection against Single Fault and Dual Fault, with and without sharing of backup bandwidth. Beyond link and node failures we also consider protection against Shared Risk Link Group (SLRG) failure. An interesting feature of the proposed scheme is the ability to offer service differentiation with respect to the recovery probability, by coupling the differentiation on the number of backup paths with bandwidth assignment policy. In this paper we describe the underlying algorithms for route selection and backup bandwidth sharing. The route selection is based on explicit load-dependent routing of service and backup paths. We show by simulation that the proposed route selection algorithm is effective in improving the network utilization. We discuss two alternative implementations of our model: distributed and partially centralized. The primary concern with the distributed approach is the message overhead implied by link-load dissemination, e.g. by flooding. However we show by simulation that message overhead can be taken under control by adopting a well-tuned adaptive overhead reduction algorithm. Our conclusion is that both distributed and partially-centralized implementation are feasible.
Globecom '00 - IEEE. Global Telecommunications Conference. Conference Record (Cat. No.00CH37137), 2000
The differentiated service architecture is proposed as a scalable approach to QoS for IP networks... more The differentiated service architecture is proposed as a scalable approach to QoS for IP networks. Therefore it is based on the aggregate (per class) scheduling of packets, but it aims at providing QoS to single flows. In particular the expedited forwarding (EF) per hop behavior (PHB) and the related premium service have been defined in order to provide determinist QoS
Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies, 2002
Coupling MPLS Traffic Engineering on top of a wavelength-routed WDM layer offersgreat flexibility... more Coupling MPLS Traffic Engineering on top of a wavelength-routed WDM layer offersgreat flexibility to op- eratorsto allocate traffic demandsin their networks . In this paper we consider the problem of off-line joint configuration at both packet and optical layers. We consider time-variant offered traffic, and assume that the operator has knowledge of the traffic dynamicsasa s et of traffic matricesat
Proceedings of the Design Automation & Test in Europe Conference, 2006
Sensor networks are emerging wireless technologies; their integration with the existing 2.5G, 3G ... more Sensor networks are emerging wireless technologies; their integration with the existing 2.5G, 3G mobile networks is a key issue to provide advanced services, e.g., health control. However this integration poses new challenges in the design and simulation of the involved embedded systems since it requires the cooperation of simulation tools that model hardware, software, and network aspects and their interactions. We present the modeling and simulation of a network scenario, core of a telecom provider's future portfolio, in which an ARM-based mobile handset is used as the gateway between a wireless sensor network (WSN) and remote users through a wide area network (WAN). Initially, the gateway and the WSN are modeled at system level with SystemC while the wide area network is modeled with NS-2. Then, HW/SW partitioning is performed on the gateway and an instruction set simulator of the ARM processor is used for the cycle-accurate execution of the RTOS and the application software.