|
|
|
Marco Canini
|
|
Networked Systems Laboratory
|
Postdoctoral Researcher
|
office(s):
INN316
phone(s): [+41 21 69] 37515
|
|
|
|
|
|
MISSION
|
My research focuses on computer networking with emphasis on:
- rethinking Internet fundamentals to include power awareness and improve Internet's energy efficiency,
- methods for Internet traffic classification based on application identification,
- design of network monitoring applications, and
- graphical visualization of networking data.
A second strong interest that I developed while at NSL regards improving the reliability of networked systems. In particular, I'm working on an approach for detecting potential faults in the Internet's inter-domain routing system and a tool called NICE for finding bugs in OpenFlow-based software-defined networks.
|
|
BIOGRAPHY
|
I received the laurea degree with honors in Computer Science and Engineering in May 2005 from the University of Genoa, Italy.
From 2006, I was a Ph.D. student in the Department of Communications, Computer and Systems Science (DIST) of the University of Genoa, advised by Prof. Raffaele Bolla.
I received my Ph.D. degree in 2009 after defending my thesis titled "Accurate Real-time Traffic Classification at High-speed in IP Networks".
During my Ph.D., I was invited as a visitor to the University of Cambridge, Computer Laboratory where I collaborated with Dr. Andrew W. Moore on characterizing network-based applications within project Brasil.
I also held positions at Intel Research and Google.
In August 2009, I joined the Networked Systems Laboratory at EPFL.
|
|
PUBLICATIONS
|
Energy-efficient Networks
- Identifying and Using Energy-Critical Paths.
N. Vasic, D. Novakovic, S. Shekhar, P. Bhurat, M. Canini, D. Kostic.
In Proceedings of ACM CoNEXT'11, Dec 2011.
abstract | bibtexAbstractThe power consumption of the Internet and datacenter networks is already significant, and threatens to shortly hit the power delivery limits while the hardware is trying to sustain ever-increasing traffic requirements. Existing energy-reduction approaches in this domain advocate recomputing network configuration with each substantial change in demand. Unfortunately, computing the minimum network subset is computationally hard and does not scale. Thus, the network is forced to operate with diminished performance during the recomputation periods. In this paper, we propose REsPoNse, a framework which overcomes the optimality-scalability trade-off. The insight in REsPoNse is to identify a few energy-critical paths off-line, install them into network elements, and use a simple online element to redirect the traffic in a way that enables large parts of the network to enter a low-power state. We evaluate REsPoNse with real network data and demonstrate that it achieves the same energy savings as the existing approaches, with marginal impact on network scalability and application performance. @INPROCEEDINGS{Vasic.CONEXT11,
author = {Vasi\'c, Nedeljko and Novakovi\'c, Dejan and Shekhar, Satyam and Bhurat, Prateek and Canini, Marco and Kosti\'c, Dejan},
title = {{Identifying and Using Energy-Critical Paths}},
booktitle = {Proceedings of ACM CoNEXT'11},
year = {2011},
month = {Dec}
} - Insomnia in the Access or How to Curb Access Network Related Energy Consumption.
E. Goma, M. Canini, A. Lopez Toledo, N. Laoutaris, D. Kostic, P. Rodriguez, R. Stanojevic, P. Yague Valentin.
In Proceedings of ACM SIGCOMM'11, Aug 2011.
abstract | bibtexAbstractAccess networks include modems, home gateways, and DSL Access Multiplexers (DSLAMs), and are responsible for 70-80% of total network-based energy consumption. In this paper, we take an in-depth look at the problem of greening access networks, identify root problems, and propose practical solutions for their user- and ISP-parts. On the user side, the combination of continuous light traffic and lack of alternative paths condemns gateways to being powered most of the time despite having Sleep-on-Idle (SoI) capabilities. To address this, we introduce Broadband Hitch-Hiking (BH2), that takes advantage of the overlap of wireless networks to aggregate user traffic in as few gateways as possible. In current urban settings BH2 can power off 65-90% of gateways. Powering off gateways permits the remaining ones to synchronize at higher speeds due to reduced crosstalk from having fewer active lines. Our tests reveal speedup up to 25%. On the ISP side, we propose introducing simple inexpensive switches at the distribution frame for batching active lines to a subset of cards letting the remaining ones sleep. Overall, our results show an 80% energy savings margin in access networks. The combination of BH2 and switching gets close to this margin, saving 66% on average.
@INPROCEEDINGS{Goma.SIGCOMM.BH2,
author = {Eduard Goma and Marco Canini and Alberto Lopez Toledo and Nikolaos Laoutaris and Dejan Kosti\'c and Pablo Rodriguez and Rade Stanojevi\'c and Pablo Yag\"ue Valent\'in},
title = {{Insomnia in the Access or How to Curb Access Network Related Energy Consumption}},
booktitle = {Proceedings of ACM SIGCOMM'11},
year = {2011},
month = {Aug}
}
Reliable Networked Systems
- A NICE Way to Test OpenFlow Applications (Technical Report version).
M. Canini, D. Venzano, P. Peresini, D. Kostic, J. Rexford. In Proceedings of NSDI'12, Apr 2012. To appear.
- Automating the Testing of OpenFlow Applications.
M. Canini, D. Kostic, J. Rexford, D. Venzano.
In Workshop on Rigorous Protocol Engineering (WRiPE 2011), Oct 2011.
abstract | bibtexAbstractSoftware-defined networking, and the emergence of OpenFlow-capable switches, enables a wide range of new network functionality. However, enhanced programmability inevitably leads to more software faults (or bugs). We believe that tools for testing OpenFlow programs are critical to the success of the new technology. However, the way OpenFlow applications interact with the data plane raises several challenges. First, the space of possible inputs (e.g., packet headers and inter-packet timings) is huge. Second, the centralized controller has a indirect view of the traffic and experiences unavoidable delays in installing rules in the switches. Third, external factors like user behavior (e.g., mobility) and higher-layer protocols (e.g., the TCP state machine) affect the correctness of OpenFlow programs. In this work-in-progress paper, we extend techniques for symbolic execution to generate inputs that systematically explore the space of system executions. First, we analyze controller applications to identify equivalence classes of packets that exercise different parts of the code. Second, we propose several network models with increasing precision, ranging from simple traffic models to live testing on the target network. Initial experiences with our prototype, which symbolically executes OpenFlow applications written in Python, suggest that our techniques can help programmers identify bugs in their OpenFlow programs. @INPROCEEDINGS{Canini.WRIPE,
author = {Canini, Marco and Kosti\'c, Dejan and Rexford, Jennifer and Venzano, Daniele},
title = {{Automating the Testing of OpenFlow Applications},
booktitle = {{Proceedings of the 1st International Workshop on Rigorous Protocol Engineering (WRiPE'11)},
year = {2011},
month = {Oct}
} - Finding Almost-Invariants in Distributed Systems.
M. Yabandeh, A. Anand, M. Canini, D. Kostic.
In Proceedings of the 30th IEEE Symposium on Reliable Distributed Systems (SRDS'11), Oct 2011.
abstract | bibtexAbstractIt is notoriously hard to develop dependable distributed systems. This is partly due to the difficulties in foreseeing various corner cases and failure scenarios while implementing a system that will be deployed over an asynchronous network. In contrast, reasoning about the desired distributed system behavior and the corresponding invariants is easier than reasoning about the code itself. Further, the invariants can be used for testing, theorem proving, and runtime enforcement. In this paper, we propose an approach to observe the system behavior and automatically infer invariants which reveal implementation bugs. Using our tool, Avenger, we automatically generate a large number of potentially relevant properties, check them within the time and spatial domains using traces of system executions, and filter out all but a few properties before reporting them to the developer. Our key insight in filtering is that a good candidate for an invariant is the one that holds in all but a few cases, i.e., an "almost-invariant". Our experimental results with the XORP BGP implementation demonstrate Avenger's ability to identify the almost-invariants that lead the developer to programming errors. @INPROCEEDINGS{Yabandeh.SRDS.Avenger,
author = {Yabandeh, Maysam and Abhishek, Anand and Canini, Marco and Kosti\'c, Dejan},
title = {{Finding Almost-Invariants in Distributed Systems}},
booktitle = {{Proceedings of the 30th IEEE Symposium on Reliable Distributed Systems (SRDS'11)}},
year = {2011},
month = {Oct}
} - Toward Online Testing of Federated and Heterogeneous Distributed Systems.
M. Canini, V. Jovanovic, D. Venzano, B. Spasojevic, O. Crameri, D. Kostic.
In Proceedings of USENIX Annual Technical Conference (ATC'11), Jun 2011.
abstract | bibtexAbstractMaking distributed systems reliable is notoriously difficult. It is even more difficult to achieve high reliability for federated and heterogeneous systems, i.e., those that are operated by multiple administrative entities and have numerous inter-operable implementations. A prime example of such a system is the Internet's inter-domain routing, today based on BGP. We argue that system reliability should be improved by proactively identifying potential faults using an online testing functionality. We propose DiCE, an approach that continuously and automatically explores the system behavior, to check whether the system deviates from its desired behavior. DiCE orchestrates the exploration of relevant system behaviors by subjecting system nodes to many possible inputs that exercise node actions. DiCE starts exploring from current, live system state, and operates in isolation from the deployed system. We describe our experience in integrating DiCE with an open-source BGP router. We evaluate the prototype's ability to quickly detect origin misconfiguration, a recurring operator mistake that causes Internet-wide outages. We also quantify DiCE's overhead and find it to have marginal impact on system performance. @INPROCEEDINGS{Canini.ATC.TowardOnlineTesting,
author = {Canini, Marco and Jovanovi\'c, Vojin and Venzano, Daniele and Spasojevi\'c, Boris and Crameri, Olivier and Kosti\'c, Dejan},
title = {Toward Online Testing of Federated and Heterogeneous Distributed Systems},
booktitle = {Proceedings of the 2011 USENIX Annual Technical Conference (ATC'11)},
year = {2011},
month = {Jun}
} - Fault Prediction in Distributed Systems Gone Wild.
M. Canini, D. Novakovic, V. Jovanovic, D. Kostic.
In Proceedings of the 4th ACM SIGOPS/SIGACT Workshop on Large Scale Distributed Systems and Middleware (LADIS'10), Jul 2010.
abstract | bibtexAbstractWe consider the problem of predicting faults in deployed, large-scale distributed systems that are heterogeneous and federated. Motivated by the importance of ensuring reliability of the services these systems provide, we argue that the key step in making these systems reliable is the need to automatically predict faults. For example, doing so is vital for avoiding Internet-wide outages that occur due to programming errors or miscongurations. @INPROCEEDINGS{Canini.LADIS.FaultPred,
author = {Canini, Marco and Novakovi\'c, Dejan and Jovanovi\'c, Vojin and Kosti\'c, Dejan},
title = {Fault Prediction in Distributed Systems Gone Wild},
booktitle = {Proceedings of the 4th ACM SIGOPS/SIGACT Workshop on Large Scale Distributed Systems and Middleware (LADIS'10)},
year = {2010},
month = {Jul}
}
Network Monitoring and Application Identification
- Evaluation and Design of Cache Replacement Policies under Flooding Attacks.
M. Zadnik, M. Canini.
In Proceedings of the 2nd International Workshop on TRaffic Analysis and Classification (TRAC'11), Jul 2011.
abstract | bibtexAbstractA flow cache is a fundamental building block for flow-based traffic processing. Its efficiency is critical for the overall performance of a number of networked devices and systems. However, if not properly managed, the flow cache can be easily filled up and rendered ineffective by traffic patterns such as flooding attacks and scanning activities which, unfortunately, commonly occur in the Internet. In this paper, we show that popular cache replacement policies such as LRU cause the flow caches to evict the so called heavy-hitter flows during flooding attacks. To address this shortcoming, we build upon our recent work [1] and construct a replacement policy that is more resilient to floods and yet performs similarly to other policies under common network traffic conditions. @INPROCEEDINGS{Zadnik.TRAC.CacheEvo,
author = {Zadnik, Martin and Canini, Marco},
title = {Evaluation and Design of Cache Replacement Policies under Flooding Attacks},
booktitle = {Proceedings of the 2nd International Workshop on TRaffic Analysis and Classification (TRAC'11)},
year = {2011},
month = {Jul}
} - Evolution of Cache Replacement Policies to Track Heavy-hitter Flows.
M. Zadnik, M. Canini.
In Proceedings of Passive Active Measurement conference (PAM'11), Mar 2011.
abstract | bibtexAbstractSeveral important network applications cannot easily scale to higher data rates without requiring focusing just on the large traffic flows. Recent works have discussed algorithmic solutions that trade-off accuracy to gain efficiency for filtering and tracking the so-called "heavy-hitters". However, a major limit is that flows must initially go through a filtering process, making it impossible to track state associated with the first few packets of the flow. In this paper, we propose a different paradigm in tracking the large flows which overcomes this limit. We view the problem as that of managing a small flow cache with a finely tuned replacement policy that strives to avoid evicting the heavy-hitters. Our scheme starts from recorded traffic traces and uses Genetic Algorithms to evolve a replacement policy tailored for supporting seamless, stateful traffic-processing. We evaluate our scheme in terms of missed heavy-hitters: it performs close to the optimal, oracle-based policy, and when compared to other standard policies, it consistently outperforms them, even by a factor of two in most cases. @INPROCEEDINGS{Zadnik.PAM.CacheEvo,
author = {Zadnik, Martin and Canini, Marco},
title = {Evolution of Cache Replacement Policies to Track Heavy-hitter Flows},
booktitle = {Proceedings of Passive Active Measurement conference (PAM'11)},
year = {2011},
month = {Mar}
} - Experience with High-Speed Automated Application-Identification for Network-Management.
M. Canini, M. Zadnik, W. Li, A. W. Moore.
In Proceedings of the 5th ACM/IEEE Symposium on Architectures for Networking and Communications Systems (ANCS'09), Oct 2009.
abstract | bibtexAbstractAtoZ, an automatic traffic organizer, provides control of how network-resources are used by applications. It does this by combining the high-speed packet processing of the NetFPGA with an efficient method for application-behavior labeling. AtoZ can control network resources by prohibiting certain applications and controlling the resources available to others. We discuss deployment experience and use real traffic to illustrate how such an architecture enables several distinct features: high accuracy, high throughput, minimal delay, and efficient packet labeling - all in a low cost, robust configuration that works alongside the enterprise access-router. @INPROCEEDINGS{Canini.ANCS.AtoZ,
author = {Marco Canini and Wei Li and Martin Zadnik and Andrew W. Moore},
title = {Experience with High-Speed Automated Application-Identification for Network-Management},
booktitle = {Proceedings of the 5th ACM/IEEE Symposium on Architectures for Networking and Communications Systems (ANCS'09)},
year = {2009},
month = {Oct}
} - Tracking Elephant Flows in Internet Backbone Traffic with an FPGA-based Cache.
M. Zadnik, M. Canini, A. W. Moore, D. J. Miller, W. Li.
In Proceedings of the 19th International Conference on Field Programmable Logic and Applications (FPL'09), Aug 2009.
abstract | bibtexAbstractThis paper presents an FPGA-friendly approach to tracking elephant flows in network traffic. Our approach, Single Step Segmented Least Recently Used (S3-LRU) policy, is a network traffic-friendly replacement policy for maintaining flow states in a Naïve Hash Table (NHT). We demonstrate that our S3-LRU approach preserves elephant flows: conservatively promoting potential elephants and evicting low rate flows in LRU manner. Our approach keeps flow-state of any elephant since start-of-day and provides a significant improvement over filtering approaches proposed in previous work. Our FPGA-based implementation of the S3-LRU in combination with an NHT suites well the parallel access to block memories while capitalising on the retuning of parameters through dynamic-reprogramming. @INPROCEEDINGS{Zadnik.FPL09.Elephant,
author = {Martin Zadnik and Marco Canini and Andrew W. Moore and David J. Miller and Wei Li},
title = {Tracking Elephant Flows in Internet Backbone Traffic with an FPGA-based Cache},
booktitle = {Proceedings of the 19th International Conference on Field Programmable Logic and Applications (FPL'09)},
year = {2009},
month = {Aug}
} - GTVS: Boosting the Collection of Application Traffic Ground Truth.
M. Canini, W. Li, A. W. Moore, R. Bolla.
In Proceedings of the First International Workshop on Traffic Monitoring and Analysis (TMA'09), May 2009.
abstract | bibtexAbstractInteresting research in the areas of traffic classification, network monitoring, and application-oriented analysis can not proceed without real traffic traces, labeled with actual application information. However, hand-labeled traces are an extremely valuable but scarce resource in the traffic monitoring and analysis community, as a result of both privacy concerns and technical difficulties. Hardly any possibility exists for payloaded data to be released, while the impossibility of obtaining certain ground-truth application information from non-payloaded data has severely constrained the value of anonymized public traces. The usual way to obtain the ground truth is fragile, inefficient and not directly comparable from one's work to another. This paper proposes amethodology and details the design of a technical framework that significantly boosts the efficiency in compiling the application traffic ground truth. Further, a case study on a 30 minute real data trace is presented. In contrast with past work, this is an easy hands-on tool suite dedicated to save user's time and labor and is freely available to the public. @INPROCEEDINGS{Canini.TMA09.GTVS,
author = {Marco Canini and Wei Li and Andrew W. Moore and Raffaele Bolla},
title = {GTVS: Boosting the Collection of Application Traffic Ground Truth},
booktitle = {Proceedings of the First International Workshop on Traffic Monitoring and Analysis (TMA'09)},
year = {2009},
month = {May}
} - Efficient Application Identification and the Temporal Stability of Classification Schema.
W. Li, M. Canini, A. W. Moore, R. Bolla.
Computer Networks, 53(6), Apr 2009.
abstract | bibtexAbstractMotivated by the importance of accurate identification for a range of applications, this paper compares and contrasts the effective and efficient classification of network-based applications using behavioral observations of network-traffic and those using deep-packet inspection. Importantly, throughout our work we are able to make comparison with data possessing an accurate, independently determined ground-truth that describes the actual applications causing the network-traffic observed. In a unique study in both the spatial-domain: comparing across different network-locations and in the temporal-domain: comparing across a number of years of data, we illustrate the decay in classification accuracy across a range of application-classification mechanisms. Further, we document the accuracy of spatial classification without training data possessing spatial diversity. Finally, we illustrate the classification of UDP traffic. We use the same classification approach for both stateful flows (TCP) and stateless flows based upon UDP. Importantly, we demonstrate high levels of accuracy: greater than 92% for the worst circumstance regardless of the application. @ARTICLE{Li.09.EAI,
author = {Wei Li and Marco Canini and Andrew W. Moore and Raffaele Bolla},
title = {Efficient application identification and the temporal and spatial stability of classification schema},
journal = {Computer Networks},
volume = {53},
number = {6},
year = {2009},
month = {Apr},
pages = {790--809},
doi = {doi:10.1016/j.comnet.2008.11.016}
} - Per Flow Packet Sampling for High-Speed Network Monitoring.
M. Canini, D. Fay, D. J. Miller, A. W. Moore, R. Bolla.
In Proceedings of the First International Conference on Communication Systems and Networks (COMSNETS'09), Jan 2009.
abstract | bibtexAbstractWe present a per-flow packet sampling method that enables the real-time classification of high-speed network traffic. Our method, based upon the partial sampling of each flow (i.e., performing sampling at only early stages in each flow's lifetime), provides a sufficient reduction in total traffic (e.g., a factor of five in packets, a factor of ten in bytes) as to allow practical implementations at one Gigabit/s, and, using limited hardware assistance, ten Gigabit/s. @INPROCEEDINGS{Canini.COMSNETS09.PFPS,
author = {Marco Canini and Damien Fay and David J. Miller and Andrew W. Moore and Raffaele Bolla},
title = {Per Flow Packet Sampling for High-Speed Network Monitoring},
booktitle = {Proceedings of the First International Conference on Communication Systems and Networks (COMSNETS'09)},
year = {2009},
month = {Jan}
} - On the Double-Faced Nature of P2P Traffic.
R. Bolla, M. Canini, R. Rapuzzi, M. Sciuto.
In Proceedings of the Sixteenth Euromicro Conference on Parallel, Distributed and Network-Based Processing (PDP'08), pages 524-530, Feb 2008.
abstract | bibtexAbstractOver the last few years, peer-to-peer (P2P) file sharing applications have evolved to become a major traffic source in the Internet. The ability to quantify their impact on the network, as a consequence of both signaling and download traffic, is fundamental to a number of network operations, including traffic engineering, capacity planning, quality of service, forecasting for long-term provisioning, etc. We present here a measurement study on the characteristics of the traffic associated with different P2P applications. Our aim is to offer useful insight into the nature of P2P traffic, which we consider a step toward building P2P traffic aggregates generators in simulative environments. We show that P2P traffic can be divided into two distinguished behavioral profiles, which, independently of the application protocol, present significant differences in the average and standard deviation of four measurements: arrival times, durations, volumes and average packet sizes of P2P conversations. These profiles well represent the typical behavior of signaling and download traffic. Based on our findings, we argue that, if such distinction is not taken into account, the statistical measurements needed to model P2P traffic aggregates would result biased, and potentially bring to misleading results. @INPROCEEDINGS{Bolla.PDP08.P2P,
author = {Raffaele Bolla and Marco Canini and Riccardo Rapuzzi and Michele Sciuto},
title = {On the Double-Faced Nature of {P2P} Traffic},
booktitle = {Proceedings of the Sixteenth Euromicro Conference on Parallel, Distributed and Network-Based Processing (PDP'08)},
year = {2008},
pages = {524--530},
month = {Feb}
} - Characterizing the network behavior of P2P traffic.
R. Bolla, M. Canini, R. Rapuzzi, M. Sciuto.
In Proceedings of the Fourth International Telecommunication Networking Workshop on QoS in Multiservice IP Networks (IT-NEWS'08), pages 14-19, Feb 2008.
abstract | bibtexAbstractNowadays the majority of Internet traffic is generated by peer-to-peer (P2P) file sharing applications. As the popularity of these applications has been increasing dramatically over the past few years, it becomes increasingly important to analyze their behavior and to understand their effects on the network. The ability to quantify their impact on the network is fundamental to a number of network operations, including traffic engineering, capacity planning, quality of service, forecasting for long-term provisioning, etc. We present here a measurement study on the characteristics of the traffic associated with two different P2P applications. Our aim is to provide useful insight into the nature of P2P traffic from the point of view of the network. To achieve this, we introduce a novel meauserement, Content Transfer Index (CTI), to distinguish two classes of behavior associated with P2P traffic: the download and the signaling traffic profile. Next we apply the CTI to our data sets and show that it effectively offers a general characterization of P2P traffic. Finally, we present a number of statistical measurements that are significantly unbiased due to having considered the distinction between the two classes. To the best of our knowledge, this is the first study to follow this approach. We believe such a study will help researchers better understand the impact of P2P applications on the network and how to improve their performance. @INPROCEEDINGS{Bolla.ITNEWS08.P2P,
author = {Raffaele Bolla and Marco Canini and Riccardo Rapuzzi and Michele Sciuto},
title = {Characterizing the network behavior of {P2P} traffic},
booktitle = {Proceedings of the Fourth International Telecommunication Networking Workshop on QoS in Multiservice IP Networks (IT-NEWS'08)},
year = {2008},
pages = {14--19},
month = {Feb}
} - A High Performance IP Traffic Generation Tool Based on the Intel IXP2400 Network Processor.
R. Bolla, R. Bruschi, M. Canini, M. Repetto.
In Proceedings of the 2005 Tyrrhenian International Workshop on Digital Communications (TIWDC'05), Sorrento, Italy, Jun 2005, and in F. Davoli, S. Palazzo, S. Zappatore, Eds. Distributed Cooperative Laboratories: Networking, Instrumentation, and Measurements. Springer, Norwell, MA, pages 127-142, 2006.
|
|
OTHER PUBLICATIONS
|
Extended abstracts
- Is Your OpenFlow Application Correct?.
P. Peresini and M. Canini.
ACM CoNEXT Student Workshop, Dec 2011. - Online Testing of Federated and Heterogeneous Distributed Systems.
M. Canini, V. Jovanovic, D. Venzano, D. Novakovic, D. Kostic
ACM SIGCOMM '11, Aug 2011. - Evolution of Cache Replacement Policies to Track Heavy-hitter Flows.
M. Zadnik and M. Canini.
ACM/IEEE Symposium on Architectures for Networking and Communications Systems (ANCS '10), Oct 2010. - DiCE: Predicting Faults in Heterogeneous, Federated Distributed Systems.
V. Jovanovic, M. Canini, G. Kumar, B. Spasojevic, O. Crameri, D. Kostic
USENIX Symposium on Operating Systems Design and Implementation (OSDI '10), Oct 2010. - Toward the Identification of Anonymous Web Proxies.
M. Canini, W. Li, A. W. Moore.
PAM Student Workshop, Apr 2009. - Revisiting HTTP Traffic in the New Age.
W. Li, A. W. Moore, M. Canini.
ACM SIGCOMM '08, Aug 2008.
Book chapters
- Experiences with the Collection of Application Ground Truth Data.
M. Canini, R. Rapuzzi, R. Bolla.
In Antonio Pescape and Carlo Sansone (Editor), RECIPE. Robust and Efficient traffic Classification of IP nEtworks, Fridericiana Editrice Universitaria, Napoli, ISBN: 978-88-833-8081-5, July 2009.
|
|
SOFTWARE
|
- NICE. - NICE (No bugs in Controller Execution) is a tool to test OpenFlow controller application for the NOX controller platform. Find out more information about NICE from its dedicated website.
- AtoZ (md5sum). - This is the first public release of AtoZ (Automatic Traffic OrganiZer).
This release includes:- AtoZ software - the package of Click elements implementing the main classification logic
- AtoZ firmware - the NetFPGA firmware that is part of AtoZ HW/SW co-design
Find out more information about AtoZ from our research paper.
- GTVS (md5sum) - This is the first public release of GTVS (Ground Truth Verification System) distributed under BSD license.
This release includes:- GTVS - the main application frontend and tools
- mon2 - a collection of tools and scripts to manage network data traces
- tnt - the tnt package of Click elements
The documentation is available online here.
Please do not hesitate to contact me for questions, suggestions and patches.
- concatcap - A simple program to concatenate multiple tcpdump traces in pcap format distributed under BSD license.
This program is similar to mergecap, but unlike mergecap it's coded for the specific task of concatenating traces dumped from the same link (e.g., using -W and -C tcpdump options). Therefore, it assumes that traces are already ordered. Note that concatcap reads the traces file names from its stdin and outputs the merged trace on its stdout. The main advantage of concatcap over mergecap is that it opens the traces one at a time. This is really convenient if your datasets are composed by a large number of files. To build the program, just type make. You might want to edit the Makefile to set the correct path to libpcap.
|
|
|
Postdoctoral Researcher 