Change search
Link to record
Permanent link

Direct link
BETA
Publications (9 of 9) Show all publications
Marcos, P., Chiesa, M., Müller, L., Kathiravelu, P., Dietzel, C., Canini, M. & Barcellos, M. (2018). Dynam-IX: A dynamic interconnection exchange. In: SIGCOMM 2018 - Proceedings of the 2018 Posters and Demos, Part of SIGCOMM 2018: . Paper presented at ACM SIGCOMM 2018 Conference, 20 August 2018 through 25 August 2018 (pp. 12-14). Association for Computing Machinery, Inc
Open this publication in new window or tab >>Dynam-IX: A dynamic interconnection exchange
Show others...
2018 (English)In: SIGCOMM 2018 - Proceedings of the 2018 Posters and Demos, Part of SIGCOMM 2018, Association for Computing Machinery, Inc , 2018, p. 12-14Conference paper, Published paper (Refereed)
Place, publisher, year, edition, pages
Association for Computing Machinery, Inc, 2018
Keywords
Internet eXchange point, Peering
National Category
Computer and Information Sciences
Identifiers
urn:nbn:se:kth:diva-247199 (URN)10.1145/3234200.3234218 (DOI)2-s2.0-85056475253 (Scopus ID)9781450359153 (ISBN)
Conference
ACM SIGCOMM 2018 Conference, 20 August 2018 through 25 August 2018
Note

QC 20190423

Available from: 2019-04-23 Created: 2019-04-23 Last updated: 2019-04-23Bibliographically approved
Marcos, P., Chiesa, M., Muller, L., Kathiravelu, P., Dietzel, C., Canini, M. & Barcellos, M. (2018). Dynam-IX: a Dynamic Interconnection eXchange. In: PROCEEDINGS OF THE 2018 APPLIED NETWORKING RESEARCH WORKSHOP (ANRW '18): . Paper presented at Applied Networking Research Workshop (ANRW),Montreal, CANADA, JUL 16, 2018 (pp. 94-94). Association for Computing Machinery (ACM)
Open this publication in new window or tab >>Dynam-IX: a Dynamic Interconnection eXchange
Show others...
2018 (English)In: PROCEEDINGS OF THE 2018 APPLIED NETWORKING RESEARCH WORKSHOP (ANRW '18), Association for Computing Machinery (ACM), 2018, p. 94-94Conference paper, Published paper (Refereed)
Place, publisher, year, edition, pages
Association for Computing Machinery (ACM), 2018
National Category
Communication Systems
Identifiers
urn:nbn:se:kth:diva-255596 (URN)10.1145/3232755.3232784 (DOI)000475842700033 ()
Conference
Applied Networking Research Workshop (ANRW),Montreal, CANADA, JUL 16, 2018
Note

QC 20190815

Available from: 2019-08-15 Created: 2019-08-15 Last updated: 2019-08-15Bibliographically approved
Chiesa, M., Retvari, G. & Schapira, M. (2018). Oblivious Routing in IP Networks. IEEE/ACM Transactions on Networking, 26(3), 1292-1305
Open this publication in new window or tab >>Oblivious Routing in IP Networks
2018 (English)In: IEEE/ACM Transactions on Networking, ISSN 1063-6692, E-ISSN 1558-2566, Vol. 26, no 3, p. 1292-1305Article in journal (Refereed) Published
Abstract [en]

To optimize the flow of traffic in IP networks, operators do traffic engineering (TE), i.e., tune routing-protocol parameters in response to traffic demands. TE in IP networks typically involves configuring static link weights and splitting traffic between the resulting shortest-paths via the equal-cost-multipath (ECMP) mechanism. Unfortunately, ECMP is a notoriously cumbersome and indirect means for optimizing traffic flow, often leading to poor network performance. Also, obtaining accurate knowledge of traffic demands as the input to TE is a non-trivial task that may require additional monitoring infrastructure, and traffic conditions can be highly variable, further complicating TE. We leverage recently proposed schemes for increasing ECMP's expressiveness via carefully disseminated bogus information (lies) to design COYOTE, a readily deployable TE scheme for robust and efficient network utilization. COYOTE leverages new algorithmic ideas to configure (static) traffic splitting ratios that are optimized with respect to all (even adversarial) traffic scenarios within the operator's "uncertainty bounds". Our experimental analyses show that COYOTE significantly outperforms today's prevalent TE schemes in a manner that is robust to traffic uncertainty and variation. We discuss experiments with a prototype implementation of COYOTE.

Place, publisher, year, edition, pages
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC, 2018
Keywords
Software defined networking, routing, IP networks, wide area networks, network theory
National Category
Telecommunications
Identifiers
urn:nbn:se:kth:diva-232269 (URN)10.1109/TNET.2018.2832020 (DOI)000435358400019 ()2-s2.0-85047621677 (Scopus ID)
Note

QC 20180718

Available from: 2018-07-18 Created: 2018-07-18 Last updated: 2018-07-18Bibliographically approved
Alowayed, Y., Canini, M., Marcos, P., Chiesa, M. & Barcellos, M. (2018). Picking a partner: A fair blockchain based scoring protocol for autonomous systems. In: ANRW 2018 - Proceedings of the 2018 Applied Networking Research Workshop: . Paper presented at 2018 Applied Networking Research Workshop, ANRW 2018, Montreal, Canada, 16 July 2018 (pp. 33-39). Association for Computing Machinery (ACM)
Open this publication in new window or tab >>Picking a partner: A fair blockchain based scoring protocol for autonomous systems
Show others...
2018 (English)In: ANRW 2018 - Proceedings of the 2018 Applied Networking Research Workshop, Association for Computing Machinery (ACM), 2018, p. 33-39Conference paper, Published paper (Refereed)
Abstract [en]

We tackle the problem of enabling Autonomous Systems to evaluate network providers on the basis of their adherence to Service Level Agreements (SLAs) regarding interconnection agreements. In current Internet practices, choices of interconnection partners are driven by factors such as word of mouth, personal relationships, brand recognition and market intelligence, and not by proofs of previous performance. Given that Internet eXchange Points provide increasingly more peering choices, rudimentary schemes for picking interconnection partners are not adequate anymore. Although the current interconnection ecosystem is shrouded in confidentiality, our key observation is that recently-emerged blockchain technology and advances in cryptography enable a privacy-preserving decentralized solution based on actual performance measurements. We propose the concept of SLA score to evaluate network providers and introduce a privacy-preserving protocol that allows networks to compute and verify SLA scores.

Place, publisher, year, edition, pages
Association for Computing Machinery (ACM), 2018
Keywords
AS ranking, Blockchain, SLA score
National Category
Communication Systems
Identifiers
urn:nbn:se:kth:diva-234739 (URN)10.1145/3232755.3232785 (DOI)000475842700020 ()2-s2.0-85052738885 (Scopus ID)9781450355858 (ISBN)
Conference
2018 Applied Networking Research Workshop, ANRW 2018, Montreal, Canada, 16 July 2018
Note

QC 20180910

Available from: 2018-09-10 Created: 2018-09-10 Last updated: 2019-08-01Bibliographically approved
Dethise, A., Chiesa, M. & Canini, M. (2018). Prelude: Ensuring inter-domain loop-freedom in SDN-enabled networks. In: ACM International Conference Proceeding Series: . Paper presented at 2nd Asia-Pacific Workshop on Networking, APNet 2018, 2 August 2018 through 3 August 2018 (pp. 50-56). Association for Computing Machinery
Open this publication in new window or tab >>Prelude: Ensuring inter-domain loop-freedom in SDN-enabled networks
2018 (English)In: ACM International Conference Proceeding Series, Association for Computing Machinery , 2018, p. 50-56Conference paper, Published paper (Refereed)
Abstract [en]

Software-Defined eXchanges (SDXes) promise to improve the interdomain routing ecosystem through SDN deployment. Yet, the nave deployment of SDN on the Internet raises concerns about the correctness of the interdomain data-plane. By allowing operators to deflect traffic from default BGP routes, SDN policies can create permanent forwarding loops that are not visible to the control-plane. We propose Prelude, a system for detecting SDN-induced forwarding loops between SDXes with high accuracy without leaking private routing information of network operators. To achieve this, we leverage Secure Multi-Party Computation (SMPC) techniques to build a novel and general privacy-preserving primitive that detects whether any subset of SDN rules might affect the same portion of traffic without learning anything about those rules. We then leverage this primitive as the main building block of a distributed system tailored to detect forwarding loops among any set of SDXes. We leverage the particular nature of SDXes to further improve the efficiency of our SMPC solution. The number of valid SDN rules rejected by our solution is 100x lower than previous privacy-preserving solutions, and provides better privacy guarantees. Furthermore, our solution naturally provides network operators with some insights on the cost of the deflected paths.

Place, publisher, year, edition, pages
Association for Computing Machinery, 2018
Keywords
Computer applications, Computer programming, Building blockes, Distributed systems, Interdomain Routing, Network operator, Privacy preserving, Privacy preserving solutions, Routing information, Secure multi-party computation, Data privacy
National Category
Communication Systems
Identifiers
urn:nbn:se:kth:diva-252262 (URN)10.1145/3232565.3232570 (DOI)2-s2.0-85063091124 (Scopus ID)9781450363952 (ISBN)
Conference
2nd Asia-Pacific Workshop on Networking, APNet 2018, 2 August 2018 through 3 August 2018
Note

QC20190614

Available from: 2019-06-14 Created: 2019-06-14 Last updated: 2019-06-14Bibliographically approved
Sedar, R., Borokhovich, M., Chiesa, M., Antichi, G. & Schmid, S. (2018). Supporting emerging applications with low-latency failover in P4. In: NEAT 2018 - Proceedings of the 2018 Workshop on Networking for Emerging Applications and Technologies, Part of SIGCOMM 2018: . Paper presented at ACM SIGCOMM 2018 Workshop on Networking for Emerging Applications and Technologies, NEAT 2018, 20 August 2018 (pp. 52-57). Association for Computing Machinery, Inc
Open this publication in new window or tab >>Supporting emerging applications with low-latency failover in P4
Show others...
2018 (English)In: NEAT 2018 - Proceedings of the 2018 Workshop on Networking for Emerging Applications and Technologies, Part of SIGCOMM 2018, Association for Computing Machinery, Inc , 2018, p. 52-57Conference paper, Published paper (Refereed)
Abstract [en]

Emerging applications expect fast turn-around from in-network failover mechanisms. This paper starts exploring the design space for supporting high availability and low latency using fast reroute in programmable data planes. In particular, we present a primitive for supporting well-known fast reroute mechanisms that is both efficient in terms of packet processing latency, memory requirements, and switch throughput.

Place, publisher, year, edition, pages
Association for Computing Machinery, Inc, 2018
Keywords
Fast failover, High availability, Low latency, Programmable data planes, Data planes, Emerging applications, Failover, Failover mechanism, Memory requirements, Packet processing
National Category
Computer and Information Sciences
Identifiers
urn:nbn:se:kth:diva-247200 (URN)10.1145/3229574.3229580 (DOI)2-s2.0-85056418147 (Scopus ID)9781450359078 (ISBN)
Conference
ACM SIGCOMM 2018 Workshop on Networking for Emerging Applications and Technologies, NEAT 2018, 20 August 2018
Note

QC 20190423

Available from: 2019-04-23 Created: 2019-04-23 Last updated: 2019-04-23Bibliographically approved
Foerster, K.-T., Parham, M., Chiesa, M. & Schmid, S. (2018). TI-MFA: Keep Calm and Reroute Segments Fast. In: IEEE INFOCOM 2018 - IEEE CONFERENCE ON COMPUTER COMMUNICATIONS WORKSHOPS (INFOCOM WKSHPS): . Paper presented at IEEE Conference on Computer Communications (IEEE INFOCOM), APR 15-19, 2018, Honolulu, HI (pp. 415-420). IEEE
Open this publication in new window or tab >>TI-MFA: Keep Calm and Reroute Segments Fast
2018 (English)In: IEEE INFOCOM 2018 - IEEE CONFERENCE ON COMPUTER COMMUNICATIONS WORKSHOPS (INFOCOM WKSHPS), IEEE , 2018, p. 415-420Conference paper, Published paper (Refereed)
Abstract [en]

Segment Routing (SR) promises to provide scalable and fine-grained traffic engineering. However, little is known today on how to implement resilient routing in SR, i.e., routes which tolerate one or even multiple failures. This paper initiates the theoretical study of static fast failover mechanisms which do not depend on reconvergence and hence support a very fast reaction to failures. We introduce formal models and identify fundamental tradeoffs on what can and cannot be achieved in terms of static resilient routing. In particular, we identify an inherent price in terms of performance if routing paths need to be resilient, even in the absence of failures. Our main contribution is a first algorithm which is resilient even to multiple failures and which comes with provable resiliency and performance guarantees. We complement our formal analysis with simulations on real topologies, which show the benefits of our approach over existing algorithms.

Place, publisher, year, edition, pages
IEEE, 2018
Series
IEEE Conference on Computer Communications Workshops, ISSN 2159-4228
National Category
Computer Systems
Identifiers
urn:nbn:se:kth:diva-239837 (URN)10.1109/INFCOMW.2018.8406885 (DOI)000450157700133 ()2-s2.0-85050661808 (Scopus ID)978-1-5386-5979-3 (ISBN)
Conference
IEEE Conference on Computer Communications (IEEE INFOCOM), APR 15-19, 2018, Honolulu, HI
Note

QC 20190107

Available from: 2019-01-07 Created: 2019-01-07 Last updated: 2019-01-07Bibliographically approved
Foerster, K.-T. -., Parham, M., Chiesa, M. & Schmid, S. (2018). TI-MFA: Keep calm and reroute segments fast. In: INFOCOM 2018 - IEEE Conference on Computer Communications Workshops: . Paper presented at 2018 IEEE Conference on Computer Communications Workshops, INFOCOM 2018, 15 April 2018 through 19 April 2018 (pp. 415-420). Institute of Electrical and Electronics Engineers Inc.
Open this publication in new window or tab >>TI-MFA: Keep calm and reroute segments fast
2018 (English)In: INFOCOM 2018 - IEEE Conference on Computer Communications Workshops, Institute of Electrical and Electronics Engineers Inc. , 2018, p. 415-420Conference paper, Published paper (Refereed)
Abstract [en]

Segment Routing (SR) promises to provide scalable and fine-grained traffic engineering. However, little is known today on how to implement resilient routing in SR, i.e., routes which tolerate one or even multiple failures. This paper initiates the theoretical study of static fast failover mechanisms which do not depend on reconvergence and hence support a very fast reaction to failures. We introduce formal models and identify fundamental tradeoffs on what can and cannot be achieved in terms of static resilient routing. In particular, we identify an inherent price in terms of performance if routing paths need to be resilient, even in the absence of failures. Our main contribution is a first algorithm which is resilient even to multiple failures and which comes with provable resiliency and performance guarantees. We complement our formal analysis with simulations on real topologies, which show the benefits of our approach over existing algorithms. © 2018 IEEE.

Place, publisher, year, edition, pages
Institute of Electrical and Electronics Engineers Inc., 2018
Keywords
Highway engineering, Failover mechanism, Fast reaction, Formal analysis, Multiple failures, Performance guarantees, Re convergences, Theoretical study, Traffic Engineering, Formal methods
National Category
Communication Systems
Identifiers
urn:nbn:se:kth:diva-238087 (URN)10.1109/INFCOMW.2018.8406885 (DOI)2-s2.0-85050661808 (Scopus ID)9781538659793 (ISBN)
Conference
2018 IEEE Conference on Computer Communications Workshops, INFOCOM 2018, 15 April 2018 through 19 April 2018
Note

Conference code: 137864; Export Date: 30 October 2018; Conference Paper

QC 20190111

Available from: 2019-01-11 Created: 2019-01-11 Last updated: 2019-01-11Bibliographically approved
Chiesa, M., Demmler, D., Canini, M., Schapira, M. & Schneider, T. (2017). SIXPACK: Securing internet eXchange points against curious onlookers. In: CoNEXT 2017 - Proceedings of the 2017 13th International Conference on emerging Networking EXperiments and Technologies: . Paper presented at 13th International Conference on Emerging Networking EXperiments and Technologies, CoNEXT 2017, Incheon, South Korea, 12 December 2017 through 15 December 2017 (pp. 120-133). Association for Computing Machinery (ACM)
Open this publication in new window or tab >>SIXPACK: Securing internet eXchange points against curious onlookers
Show others...
2017 (English)In: CoNEXT 2017 - Proceedings of the 2017 13th International Conference on emerging Networking EXperiments and Technologies, Association for Computing Machinery (ACM), 2017, p. 120-133Conference paper, Published paper (Refereed)
Abstract [en]

Internet eXchange Points (IXPs) play an ever-growing role in Internet inter-connection. To facilitate the exchange of routes amongst their members, IXPs provide Route Server (RS) services to dispatch the routes according to each member's peering policies. Nowadays, to make use of RSes, these policies must be disclosed to the IXP. This poses fundamental questions regarding the privacy guarantees of route-computation on confidential business information. Indeed, as evidenced by interaction with IXP administrators and a survey of network operators, this state of affairs raises privacy concerns among network administrators and even deters some networks from subscribing to RS services. We design sixpack1, an RS service that leverages Secure Multi-Party Computation (SMPC) to keep peering policies confidential, while extending, the functionalities of today's RSes. As SMPC is notoriously heavy in terms of communication and computation, our design and implementation of sixpack aims at moving computation outside of the SMPC without compromising the privacy guarantees. We assess the effectiveness and scalability of our system by evaluating a prototype implementation using traces of data from one of the largest IXPs in the world. Our evaluation results indicate that sixpack can scale to support privacy-preserving route-computation, even at IXPs with many hundreds of member networks.

Place, publisher, year, edition, pages
Association for Computing Machinery (ACM), 2017
Keywords
Interdomain routing, Internet eXchange Points, Privacy-preserving routing, Secure multi party computation
National Category
Other Electrical Engineering, Electronic Engineering, Information Engineering
Identifiers
urn:nbn:se:kth:diva-221712 (URN)10.1145/3143361.3143362 (DOI)2-s2.0-85040244380 (Scopus ID)9781450354226 (ISBN)
Conference
13th International Conference on Emerging Networking EXperiments and Technologies, CoNEXT 2017, Incheon, South Korea, 12 December 2017 through 15 December 2017
Note

QC 20180122

Available from: 2018-01-22 Created: 2018-01-22 Last updated: 2018-02-08Bibliographically approved
Organisations
Identifiers
ORCID iD: ORCID iD iconorcid.org/0000-0002-9675-9729

Search in DiVA

Show all publications