@inproceedings{mueller2019homeca,

title = {HomeCA: Scalable Secure IoT Network Integration},

author = {Robert Müller; Corinna Schmitt; Daniel Kaiser; Marcel Waldvogel},

editor = {David; Geihs; Lange; Stumme},

url = {https://netfuture.ch/wp-content/uploads/2019/09/mueller2019homeca.pdf},

year  = {2019},

date = {2019-09-25},

urldate = {1000-01-01},

booktitle = {INFORMATIK 2019},

journal = {INFORMATIK 2019},

volume = {P-294},

pages = {167-180},

publisher = {Gesellschaft für Informatik},

series = {LNI},

abstract = {Integrating Internet of Things (IoT) devices into an existing network is a nightmare. Minimalistic, unfriendly user interfaces, if any; badly chosen security methods, most notably the defaults; lack of long term security; and bugs or misconfigurations are plentiful. As a result, an increasing number of owners operate unsecure devices.



Our investigations into the root causes of the problems resulted in the development of Home Certificate Authority (HomeCA). HomeCA includes a comprehensive set of secure, vendor-independent interoperable practices based on existing protocols and open standards. HomeCA avoids most of the current pitfalls in network integration by design. Long-term protocol security, permission management, and secure usage combined with simplified device integration and secure key updates on ownership acquisition pave the way toward scalable, federated IoT security.},

keywords = {Internet of Things, Security, Wireless},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{Ringmann2018Requirements,

title = {Requirements for legally compliant software based on the GDPR},

author = {Sandra Domenique Ringmann and Hanno Langweg and Marcel Waldvogel},

url = {https://netfuture.ch/wp-content/uploads/2018/10/ringmann2018requirements.pdf},

year  = {2018},

date = {2018-10-22},

urldate = {1000-01-01},

booktitle = {Cloud and Trusted Computing 2018 (C&TC 2018)},

abstract = {We identify 74 generic, reusable technical requirements based on the GDPR that can be applied to software products which process personal data. The requirements can be traced to corresponding articles and recitals of the GDPR and fulfil the key principles of lawfulness and transparency. Therefore, we present an approach to requirements engineering with regard to developing legally compliant software that satisfies the principles of privacy by design, privacy by default as well as security by design.},

keywords = {Cloud Computing, Data Protection, GDPR, Privacy},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{Held2018FightingRansomware,

title = {Fighting Ransomware with Guided Undo},

author = {Matthias Held and Marcel Waldvogel},

url = {https://netfuture.ch/wp-content/uploads/2018/07/held2018fightingransomware.pdf

https://netfuture.ch/wp-content/uploads/2018/09/ransomware_detection.pdf

https://netfuture.ch/wp-content/uploads/2018/09/2018-ransomware.odp},

year  = {2018},

date = {2018-09-18},

urldate = {1000-01-01},

booktitle = {Proceedings of NISK 2018},

abstract = {Ransomware attacks are rare, yet catastrophic. On closer inspection, they differ from other malware infections: Given appropriate preparation, they do not need to be caught on first sight, but can be undone later. However, current ransomware protection follows the beaten path of anti-malware copying their fallacies. We show how the move to personal cloud storage allows for a paradigm shift in ransomware protection: exceptional attack isolation, perfect elimination of false positive alerts, and simplified recovery.



In this paper, we analyze the necessary operations for ransomware, extend existing ransomware taxonomy, and verify them against real-world malware samples. We analyze the costs and benefits of moving ransomware detection to versioned personal cloud storage. Our content, meta data, and behavior analysis paired with a `guilt by association' capability greatly improve the false positive rate, but the guided undo make this rate all but inconsequential. Even though the user now carries a new burden, it comes with clear responsibilities and benefits, while being freed from questionable duties, resulting in a win-win situation for user experience and detection quality.

},

keywords = {Cloud Storage, Intrusion Detection, Ransomware, Replication, Security, Usability, Web Applications},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{Müller2017MoDeNA-AIMS,

title = {MoDeNA: Enhancing User Security for Devices in Wireless Personal and Local Area Networks},

author = {Robert Müller and Marcel Waldvogel and Corinna Schmitt},

url = {https://netfuture.ch/wp-content/uploads/2017/07/mueller2017modena.pdf

https://netfuture.ch/wp-content/uploads/2017/07/modena_presentation_aims_2017_07_12.pdf},

year  = {2017},

date = {2017-07-10},

urldate = {1000-01-01},

booktitle = {Proceedings of AIMS 2017},

abstract = {Today most used devices are connected with each other building the Internet of Things (IoT). A variety of protocols are used depending on the underlying network infrastructure, application (e.g., Smart City, eHealth), and device capability. The judgment of the security feeling of the data sharing depends on personal settings (e.g., easy to use, encrypted transmission, anonymization support). MoDeNA – a Mobile Device Network Assistant – was developed offering an opportunity for understanding the judgment of security by bringing the user’s concerns and their technology understanding of used devices and protocols into relation. MoDeNA provides a transparent overview over the used wireless security of the user’s device giving concrete advices for improving the connection security and usability of mobile device security.},

keywords = {Internet of Things, Mobile Networks, Security, Usability},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{Waldvogel-X509,

title = {X.509 User Certificate-based Two-Factor Authentication for Web Applications},

author = {Marcel Waldvogel and Thomas Zink},

editor = {Paul Müller and Bernhard Neumair and Helmut Reiser and Dreo Rodosek, Gabi},

url = {https://netfuture.ch/wp-content/uploads/2018/05/x509auth.pdf

},

year  = {2017},

date = {2017-05-30},

urldate = {1000-01-01},

booktitle = {10. DFN-Forum Kommunikationstechnologien},

abstract = {An appealing property to researchers, educators, and students is the openness of the physical environment and IT infrastructure of their organizations. However, to the IT administration, this creates challenges way beyond those of a single-purpose business or administration. Especially the personally identifiable information or the power of the critical functions behind these logins, such as financial transactions or manipulating user accounts, require extra protection in the heterogeneous educational environment with single-sign-on. However, most web-based environments still lack a reasonable second-factor protection or at least the enforcement of it for privileged operations without hindering normal usage.



In this paper we introduce a novel and surprisingly simple yet extremely flexible way to implement two-factor authentication based on X.509 user certificates in web applications. Our solution requires only a few lines of code in web server configuration and none in the application source code for basic protection. Furthermore, since it is based on X.509 certificates, it can be easily combined with smartcards or USB cryptotokens to further enhance security.},

keywords = {Federated Services, Identity Management, Passwords, Security, Usability, Web Applications, X.509},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{kaiser2016user-friendly,

title = {User-Friendly, Versatile, and Efficient Multi-Link DNS Service Discovery},

author = {Daniel Kaiser and Marcel Waldvogel and Holger Strittmatter and Oliver Haase

},

url = {https://netfuture.ch/wp-content/uploads/2016/06/kaiser2016user-friendly.pdf},

year  = {2016},

date = {2016-06-27},

urldate = {1000-01-01},

booktitle = {Proceedings of the 1st Workshop on Edge Computing (WEC 2016); in conjunction with IEEE ICDCS 2016},

abstract = {When mobile devices at the network edge want to communicate with each other, they too often depend on the availability of faraway resources. Feasible user-friendly service discovery is essential for direct communication. DNS Service Discovery over Multicast DNS (DNS-SD/mDNS) is widely used for configurationless service discovery in local networks; due in no small part to the fact that it is based on the well established DNS, and efficient in small networks.



In our research, we enhance DNS-SD/mDNS providing versatility, user control, efficiency, and privacy, while maintaining the deployment simplicity and backward compatibility. These enhancements are necessary to make it a solid, flexible foundation for device communication in the edge of the Internet.



In this paper, we focus on providing multi-link capabilities and scalable scopes for DNS-SD while being mindful of both user-friendliness and efficiency. We propose DNS-SD over Stateless DNS (DNS-SD/sDNS), a solution that allows configurationless service discovery in arbitrary self-named scopes – largely independent of the physical network layout – by leveraging our Stateless DNS technique and the Raft consensus algorithm.},

keywords = {DNS-SD, Multicast, Service Discovery, Zeroconf},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{rain2015realistic,

title = {Realistic, Extensible DNS and mDNS Models for INET/OMNeT++},

author = {Andreas Rain and Daniel Kaiser and Marcel Waldvogel},

url = {https://netfuture.ch/wp-content/uploads/2016/06/rain2015realistic.pdf

https://netfuture.ch/wp-content/uploads/2016/06/rain2015realistic-slides.pdf},

year  = {2015},

date = {2015-09-03},

urldate = {1000-01-01},

booktitle = {Proceedings of the “OMNeT++ Community Summit 2015”},

abstract = {The domain name system (DNS) is one of the core services in today’s network structures. In local and ad-hoc networks DNS is often enhanced or replaced by mDNS. As of yet, no simulation models for DNS and mDNS have been developed for INET/OMNeT++. We introduce DNS and mDNS simulation models for OMNeT++, which allow researchers to easily prototype and evaluate extensions for these protocols. In addition, we present models for our own experimental extensions, namely Stateless DNS and Privacy-Enhanced mDNS, that are based on the aforementioned models. Using our models we were able to further improve the efficiency of our protocol extensions.},

keywords = {DNS-SD, Mobile Networks, Multicast, Service Discovery, Simulation, Zeroconf},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{Kaiser2015Multicast-avoiding,

title = {A Multicast-Avoiding Privacy Extension for the Avahi Zeroconf Daemon},

author = {Daniel Kaiser and Andreas Rain and Marcel Waldvogel and Holger Strittmatter},

url = {https://netfuture.ch/wp-content/uploads/2014/12/kaiser2015multicast-avoiding.pdf

https://netfuture.ch/wp-content/uploads/2015/03/mdns-security-poster.pdf},

year  = {2015},

date = {2015-03-10},

urldate = {1000-01-01},

booktitle = {NetSys 2015},

publisher = {Gesellschaft für Informatik},

abstract = {In today’s local networks, a significant amount of traffic is caused by Multicast packets, such as Multicast DNS Service Discovery (mDNS-SD), a widespread technique used for configurationless service distribution and discovery. It suffers from two major problems inherent in multicast: privacy and network load. We present a privacy extension for the Avahi Zeroconf Daemon that tackles both problems while being very efficient.},

keywords = {DNS-SD, Privacy, Security, Zeroconf},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{Herberth2015JSXC,

title = {JSXC: Adding Encrypted Chat with 3 Lines of Code},

author = {Klaus Herberth and Daniel Scharon and Matthias Fratz and Marcel Waldvogel},

url = {https://netfuture.ch/wp-content/uploads/2014/12/herberth2015jsxc.pdf

https://netfuture.ch/wp-content/uploads/2015/02/jsxc-poster.pdf},

year  = {2015},

date = {2015-03-10},

urldate = {1000-01-01},

booktitle = {NetSys 2015},

publisher = {Gesellschaft für Informatik},

abstract = {If it is not in the web, it does not exist. However, most of our current arsenal of web services are provided for free by large international corporations – free as in targeted advertising. More privacy-aware self-hosted alternatives frequently lack the feature set of their commercial rivals, leaving users to decide between privacy and functionality. Therefore, we present WISEchat (Web-Integrated Secure Enhanced Chat), our concept for enhancing practical security for web-based chat, as well as an implementation, the JavaScript XMPP Client (JSXC). By design, JSXC can be easily and painlessly integrated into existing web apps to equip them with encrypted chat capabilities, making them more attractive and thus more frequently providing a secure alternative as the most functional and convenient alternative.},

keywords = {Security, XMPP},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{Waldvogel2015Boost,

title = {Boost DNS Privacy, Reliability, and Efficiency with opDNS Safe Query Elimination},

author = {Marcel Waldvogel and Thomas Zink},

url = {https://netfuture.ch/wp-content/uploads/2014/12/waldvogel2015boost.pdf

https://netfuture.ch/wp-content/uploads/2015/03/opdns-poster.pdf},

year  = {2015},

date = {2015-03-10},

urldate = {1000-01-01},

booktitle = {NetSys 2015},

publisher = {Gesellschaft für Informatik},

abstract = {SRV records, DNSSEC, and DANE among others fortify the Domain Name System as the central information hub behind the Internet. Largely hidden from the end user, an increasing number of protocol and trust decisions are contingent on DNS. Neglect or attacks on DNS have much more impact today than ever, now endangering security far beyond denial of service. Opportunistic Persistent DNS (opDNS) addresses these problems by abandoning pessimistic caching and eliminating unnecessary traffic. Today’s DNS infrastructure relies on the hosts forgetting and refreshing DNS records in relatively short time. In conjunction with TLS, opDNS greatly reduces the number of queries and in turn increases privacy, reliability, and efficiency. Even with DNS lookups all but eliminated for frequently visited secure services, changes to the server addresses will be recognized almost immediately, unlike standard DNS. We will show how end systems can take advantage of opDNS without having to wait for support by server operators or application developers, enabling the most effective way of deployment.},

keywords = {DNS, Privacy, Security},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{Kaiser2014Adding,

title = {Adding Privacy to Multicast DNS Service Discovery},

author = {Daniel Kaiser and Marcel Waldvogel},

url = {https://netfuture.ch/wp-content/uploads/2014/08/Kaiser2014Adding.pdf},

year  = {2014},

date = {2014-09-24},

urldate = {1000-01-01},

booktitle = {Proceedings of IEEE TrustCom 2014 (IEEE EFINS 2014 workshop)},

abstract = {Multicast DNS Service Discovery (mDNS-SD), made fashionable through Apple’s \emph{Bonjour}, is a prevalent technique allowing service distribution and discovery in local networks without configuration (Zeroconf). Possible application areas are device synchronization, instant messaging, VoIP, file and screen sharing. It is very convenient for users, because they can connect to and offer services when they enter a network without any manual configuration. However, it requires the public exposure of the offering and requesting identities along with information about the offered and requested services, even when services do not need to be public. Some of the information published by the announcements can be very revealing, including complete lists of family members. In this paper we discuss the privacy problems arising when using mDNS-SD and present our privacy extension, which allows hiding all information published while still not requiring any network configuration except for an initial pairing. A key feature of our solution is the ease of upgrading existing systems, a must for widespread deployment and acceptance. To show the feasibility of our mDNS-SD privacy extension, we developed an implementation based on the open-source \emph{Avahi} daemon.},

keywords = {DNS-SD, Multicast, Peer-to-Peer, Privacy, Service Discovery, Social Networks, Trust, Zeroconf},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{Kaiser2014Efficient,

title = {Efficient Privacy Preserving Multicast DNS Service Discovery},

author = {Daniel Kaiser and Marcel Waldvogel},

url = {https://netfuture.ch/wp-content/uploads/2014/08/Kaiser2014Efficient.pdf},

year  = {2014},

date = {2014-08-23},

urldate = {1000-01-01},

booktitle = {Workshop on Privacy-Preserving Cyberspace Safety and Security (CSS)},

abstract = {In today’s local networks a significant amount of traffic is caused by Multicast DNS Service Discovery (mDNS-SD), a prevalent technique used for configurationless service distribution and discovery. It allows users to offer and use services like device synchronization, file sharing, and chat, when joining a local network without any manual configuration. While this is very convenient, it requires the public exposure of the offering and requesting identities along with information about the offered and requested services, even when services do not need to be public. Some of the information published by the announcements can be very revealing, including complete lists of family members. Another problem is the huge amount of multicast traffic caused, which is especially relevant for large WiFi networks.

In this paper we present a privacy extension that does not publish private information and reduces the number of packets sent while still not requiring any network configuration except for an initial pairing per pair of users. A key feature of our solution is the ease of upgrading existing systems, a must for widespread deployment and acceptance. We developed an implementation based on the open-source Avahi daemon to show the feasibility of our privacy extension. Our solution grants tunable privacy and reduces multicast traffic without affecting user experience.},

keywords = {DNS-SD, Multicast, Privacy, Service Discovery, Zeroconf},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{Waldvogel2014SIEGE,

title = {SIEGE: Service-Independent Enterprise-GradE protection against password scans},

author = {Marcel Waldvogel and Jürgen Kollek},

editor = {Paul Müller and Bernhard Neumair and

Helmut Reiser and Dreo Rodosek, Gabi},

url = {https://netfuture.ch/wp-content/uploads/2014/08/Waldvogel2014SIEGE.pdf

https://netfuture.ch/wp-content/uploads/2014/08/Waldvogel2014SIEGE-slides.pdf},

year  = {2014},

date = {2014-06-16},

urldate = {1000-01-01},

booktitle = {7. DFN-Forum Kommunikationstechnologien -- Beiträge der Fachtagung},

publisher = {Gesellschaft für Informatik},

series = {Lecture Notes in Informatics},

abstract = {Security is one of the main challenges today, complicated significantly by the heterogeneous and open academic networks with thousands of different applications. Botnet-based brute-force password scans are a common security threat against the open academic networks. Common defenses are hard to maintain, error-prone and do not reliably discriminate between user error and coordinated attack. In this paper, we present a novel approach, which allows to secure many network services at once. By combining in-app tracking, local and global crowdsourcing, geographic information, and probabilistic user-bot distinction through differential password analysis, our PAM-based detection module can provide higher accuracy and faster blocking of botnets. In the future, we aim to make the mechanism even more generic and thus provide a distributed defense against one of the strongest threats against our infrastructure.},

keywords = {Federated Services, Identity Management, Intrusion Detection, Passwords, Peer, Security},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{Graf2012Versatile,

title = {Versatile Key Management for Secure Cloud Storage},

author = {Sebastian Graf and Patrick Lang and Stefan A. Hohenadel and Marcel Waldvogel},

url = {https://netfuture.ch/wp-content/uploads/2012/graf12versatile.pdf},

year  = {2012},

date = {2012-10-08},

urldate = {1000-01-01},

booktitle = {IEEE 31st Symposium on Reliable Distributed Systems, SRDS 2012},

pages = {469-474},

crossref = {DBLP:conf/srds/2012},

keywords = {Cloud Storage, Security},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{Zink2012BitTorrent,

title = {BitTorrent traffic obfuscation: A chase towards semantic traffic identification},

author = {Thomas Zink and Marcel Waldvogel},

url = {https://netfuture.ch/wp-content/uploads/2012/zink12bittorrent.pdf},

year  = {2012},

date = {2012-09-03},

urldate = {1000-01-01},

booktitle = {12th IEEE International Conference on Peer-to-Peer Computing, P2P 2012},

pages = {126-137},

crossref = {DBLP:conf/p2p/2012},

abstract = {With the beginning of the 21st century emerging peer-to-peer networks ushered in a new era of large scale media exchange. Faced with ever increasing volumes of traffic, legal threats by copyright holders, and QoS demands of customers, network service providers are urged to apply traffic classification and shaping techniques. These systems usually are highly integrated to satisfy the harsh restrictions present in network infrastructure. They require constant maintenance and updates. Additionally, they have legal issues and violate both the net neutrality and end-to-end principles. On the other hand, clients see their freedom and privacy attacked. As a result, users, application programmers, and even commercial service providers laboriously strive to hide their interests and circumvent classification techniques. In this user vs. ISP war, the user side has a clear edge. While changing the network infrastructure is by nature very complex, and only slowly reacts to new conditions, updating and distributing software between users is easy and practically instantaneous. In this paper we discuss how state-of-the-art traffic classification systems can be circumvented with little effort. We present a new obfuscation extension to the BitTorrent protocol that allows signature free handshaking. The extension requires no changes to the infrastructure and is fully backwards compatible. With only little change to client software, contemporary classification techniques are rendered ineffective. We argue that future traffic classification must not rely on restricted local syntax information but instead must exploit global communication patterns and protocol semantics in order to be able to keep pace with rapid application and protocol changes.},

keywords = {Denial of Service, Peer-to-Peer, Security, Traffic Engineering},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{Simon2012bwIDM,

title = {bwIDM: Föderieren auch nicht-webbasierter Dienste auf Basis von SAML},

author = {Michael Simon and Marcel Waldvogel and Sven Schober and Saher Semaan and Martin Nussbaumer},

url = {https://netfuture.ch/wp-content/uploads/2012/simon12bwidm.pdf},

year  = {2012},

date = {2012-05-20},

urldate = {1000-01-01},

booktitle = {5. DFN-Forum Kommunikationstechnologien: Verteilte Systeme im Wissenschaftsbereich},

pages = {119-128},

crossref = {DBLP:conf/dfn/2012},

abstract = {Zur organisationsübergreifenden Nutzung von IT-Diensten werden Dienstföderationen gebildet. Dabei kann das Nutzerkonto der sogenannten Heimateinrichtung auch zum Zugriff auf nicht-lokale Dienste genutzt werden. Während die Integration webbasierter Dienste in Föderationen mit SAML und beispielsweise Shibboleth mittlerweile in vielen Anwendungsbereichen allgegenwärtig ist, fällt die Integration nicht-webbasierter IT-Dienste schwer. Existierende Ansätze, mit denen sich prinzipiell auch nicht-webbasierte Dienste integrieren lassen, erfüllen essentielle Anforderungen nicht und/oder sind nach ihrem heutigen Entwicklungsstand noch nicht betriebsfähig. In diesem Papier werden zwei Verfahren für nicht-webbasierte, föderative Dienstzugriffe (Moonshot und PAM/ECP) evaluiert und notwendige Erweiterungen zur Sicherstellung der Betriebsfa ̈higkeit vorgestellt. Ein implementierter Proof-of-Concept zeigt die Umsetzbarkeit der Lösung.},

keywords = {Cloud Storage, Identity Management, Security},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{Graf2012Legal,

title = {A Legal and Technical Perspective on Secure Cloud Storage},

author = {Sebastian Graf and Jörg Eisele and Marcel Waldvogel and Marc Strittmatter},

url = {https://netfuture.ch/wp-content/uploads/2012/graf12legal.pdf},

year  = {2012},

date = {2012-05-20},

urldate = {1000-01-01},

booktitle = {5. DFN-Forum Kommunikationstechnologien: Verteilte Systeme im Wissenschaftsbereich},

pages = {63-72},

crossref = {DBLP:conf/dfn/2012},

abstract = {Cloud infrastructures are nowadays an irreplaceable component within modern IT-infrastructures.

Due to their representing abstraction regarding the physical execution framework from the deployment of the service, clouds not offer valuable attributes like scalability, environmental protection by best utilization of hardware resources, pay-as-you-go billing but also problem fields especially when it comes to the storage of confidential data. More concise, secure utilization of common cloud infrastructures like provided by Google, Microsoft or Amazon generate not only an indistinguishable impact to computer science but also to law science. As a consequence, based upon the confidentially of the data and the different methods and parties able to access this information, the safeness of the data must not only be provided by applying technical security measures upon the cloud-stored information but also by the investigation of legal issues going along with the flexibility of the cloud. To fill this gap, our contribution bases upon two pillars:<ul><li>We discuss legal issues going along with the storage of (especially confidential) data on cloud infrastructures provided by third parties.</li><li>Besides the legal issues, we further investigate technical measures how to ensure secure data storage on a technical level utilizing the benefits of cloud infrastructures (namely the scalability and availability).</li></ul>Based upon these investigations, we propose a technical model for secure cloud storage and interpret the measures against common aspects from the area of jurisprudence. Besides, we show that the area of jurisprudence still offers many open issues related to cloud based storage which represent a challenge for end-users as well as complex institutions like universities.},

keywords = {Cloud Storage, Security},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{Zink2012Efficient,

title = {Efficient BitTorrent handshake obfuscation},

author = {Thomas Zink and Marcel Waldvogel},

url = {https://netfuture.ch/wp-content/uploads/2015/02/zink2012efficient.pdf},

isbn = {978-1-4503-1148-9},

year  = {2012},

date = {2012-05-08},

urldate = {1000-01-01},

booktitle = {Proceedings of the First Workshop on P2P and Dependability},

publisher = {ACM},

abstract = {During the last decade, large scale media distribution populated peer-to-peer applications. Faced with ever increasing volumes of traffic, legal threats by copyright holders, and QoS demands of customers, network service providers are urged to apply traffic classification and shaping techniques. These highly integrated systems require constant maintenance, introduce legal issues, and violate both the net neutrality and end-to-end principles.



Clients see their freedom and privacy attacked. Users, application programmers, and even commercial service providers laboriously strive to hide their interests and circumvent classification techniques. While changing the network infrastructure is by nature very complex, and it reacts only slowly to new conditions, updating and distributing software between users is easy and practically instantaneous.



We present a new obfuscation extension to the BitTorrent protocol, which allows signature free handshaking. The extension requires no changes to the infrastructure and is fully backwards compatible. With only little change to client software, contemporary classification techniques can be rendered ineffective.},

keywords = {Peer-to-Peer, Privacy, Security, Traffic Engineering},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{islam11prediction,

title = {Prediction quality of contact history in opportunistic networks},

author = {Muhammad Arshad Islam and Marcel Waldvogel},

url = {https://netfuture.ch/wp-content/uploads/2013/11/islam11prediction.pdf},

year  = {2011},

date = {2011-10-10},

urldate = {1000-01-01},

booktitle = {Wireless Days},

crossref = {DBLP:conf/wd/2011},

abstract = {Routing in opportunistic networks heavily relies on past behavior of the mobile devices it is formed of to predict their future and thus making routing decisions. While almost every protocol relies on this history, its prediction quality has never been studied in a realistic setting. Using extensive simulations on real traces, we are able to describe for the first time how well predictions can be. Unlike oracle-based prediction comparisons, we do not try to predict a contact, but compare the expected user result, namely message delivery probabilities. The analysis also provides guidance on the importance of multi-path routing and the path diversity required, as well as on the impact on forward error correction on the delivery probability. Our results show that the repetitive nature of path is directly proportional to the mobility extent of the devices and, consequently, history obtained from dense opportunistic networks is reliable.},

keywords = {Opportunistic Networks},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{Islam2011Prediction,

title = {Prediction Quality of Contact History in Opportunistic Networks},

author = {Muhammad Arshad Islam and Marcel Waldvogel},

url = {https://netfuture.ch/wp-content/uploads/2018/10/islam2011prediction.pdf},

year  = {2011},

date = {2011-10-10},

urldate = {1000-01-01},

booktitle = {IFIP Wireless Days 2011},

abstract = {Routing in opportunistic networks heavily relies on past behavior of the mobile devices it is formed of to predict their future and thus making routing decisions. While almost every protocol relies on this history, its prediction quality has never been studied in a realistic setting. Using extensive simulations on real traces, we are able to describe for the first time how well predictions can be. Unlike oracle-based prediction comparisons, we do not try to predict a contact, but compare the expected user result, namely message delivery probabilities. The analysis also provides guidance on the importance of multi-path routing and the path diversity required, as well as on the impact on forward error correction on the delivery probability. Our results show that the repetitive nature of path is directly proportional to the mobility extent of the devices and, consequently, history obtained from dense opportunistic networks is reliable.},

keywords = {Opportunistic Networks},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{Maier2011NAT,

title = {NAT Hole Punching Revisited},

author = {Daniel Maier and Oliver Haase and Jürgen Wäsch and Marcel Waldvogel},

url = {https://netfuture.ch/wp-content/uploads/2011/maier11nat.pdf},

year  = {2011},

date = {2011-10-07},

urldate = {1000-01-01},

booktitle = {Proceedings of IEEE LCN 2011, The 36th IEEE Conference on Local Computer Networks},

abstract = {Setting up connections to hosts behind Network Address Translation (NAT) equipment has last been the subject of research debates half a decade ago when NAT technology was still immature. This paper fills this gap and provides a solid comparison of two essential TCP hole punching approaches: sequential and parallel TCP hole punching. The comparison features current conditions and thoroughly compares setup delay, implementation complexity, resource usage, and effectuality of the two approaches. The result is a list of recommendations and a portable, effectual, and open-source Java implementation.},

keywords = {NAT traversal, Peer-to-Peer},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{Gienger2011Polybius,

title = {Polybius: Secure Web Single-Sign-On for Legacy Applications},

author = {Pascal Gienger and Marcel Waldvogel},

url = {https://netfuture.ch/wp-content/uploads/2011/gienger11polybius.pdf},

year  = {2011},

date = {2011-06-20},

urldate = {1000-01-01},

booktitle = {4. DFN-Forum Kommunikationstechnologien},

abstract = {Web-based interfaces to applications in all domains of university life are surging. Given the diverse demands in and the histories of universities, combined with the rapid IT industry developments, all attempts at a sole all-encompassing platform for single-sign-on (SSO) will remain futile. In this paper, we present an architecture for a meta-SSO, which is able to seamlessly integrate with a wide variety of existing local sign-in and SSO mechanisms. It is therefore an excellent candidate for a university-wide all-purpose SSO system. Among the highlights are: No passwords are ever stored on disk, neither in the browser nor in the gateway; its basics have been implemented in a simple, yet versatile Apache module; and it can help reducing the impact of security problems anywhere in the system. It could even form the basis for secure inter-university collaborations and mutual outsourcing.},

keywords = {Cloud Storage, Identity Management, Security, Trust, Web Applications},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{Graf2011Hecate,

title = {Hecate: Managing Authorization with RESTful XML},

author = {Sebastian Graf and Vyacheslav Zholudev and Lukas Lewandowski and Marcel Waldvogel},

url = {https://netfuture.ch/wp-content/uploads/2011/graf11hecate.pdf},

year  = {2011},

date = {2011-03-28},

urldate = {1000-01-01},

booktitle = {Proceedings of WS-REST 2011},

abstract = {The potentials of REST offers new ways for communications between louse coupled entities featured through the Web of Things. The binding of the disjunct components of this architecture creates security issues, such as the centralized authorization techniques respecting the independence of the underlying entities. This results in the question how authorization is performed respecting the flexibility of REST without any knowledge about the underlying resources. Nevertheless, possible knowledge about these resources should enable the authorization workflow to offer finer-granular permissions on substructures of the resources. With our new approach - named Hecate - we offer a framework to assure simplified handling while keeping the potentials and flexibility of REST. We have designed an architecture based on XML with a flexible authorization mechanism on the one hand and optional resource-awareness on the other hand. The flexibility within the authorization work-flow bases on permission sets respecting the HTTP verbs. Additional in-depth knowledge of the entity optionally extends these permissions with resource-aware filters. Hecate offers not only great benefits because of its flexibility, but also because of the optional extensibility proved within the two reference implementations. With Hecate, we show that a centralized authorization mechanism combining independence and optional resource-based filtering extends the flexibility of REST rather than restricting it.},

keywords = {Identity Management, Security, XML},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{Graf2011Rolling,

title = {Rolling Boles, Optimal XML Structure Integrity for Updating Operations},

author = {Sebastian Graf and Sebastian Kay Belle and Marcel Waldvogel},

url = {https://netfuture.ch/wp-content/uploads/2011/graf11rolling.pdf},

year  = {2011},

date = {2011-03-28},

urldate = {1000-01-01},

booktitle = {Proceedings of the 20th international conference on World Wide Web (WWW2011)},

pages = {49-50},

publisher = {ACM},

address = {Hyderabad, India},

abstract = {While multiple techniques exist to utilize the tree structure of the Extensible Markup Language (XML) regarding integrity checks, they all rely on adaptions of the Merkle Tree: All children are acting as one slice regarding the checksum of one node with the help of an one-way hash concatenation. This results in postorder traversals regarding the (re-)computation of the integrity structure within modification operations. With our approach we perform nearly in-time updates of the entire integrity structure. We therefore equipped an XHash-based approach with an incremental hash function. This replaces postorder traversals by adapting only the incremental modifications to the checksums of a node and its ancestors. With experimental results we prove that our approach only generates a constant overhead depending on the depth of the tree while native DOMHash implementations produce an overhead based on the depth and the number of all nodes in the tree. Consequently, our approach called Rolling Boles generates sustainable impact since it facilitates instant integrity updates in constant time.},

keywords = {XML},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{Graf2011Treetank,

title = {Treetank, Designing A Versioned XML Storage},

author = {Sebastian Graf and Marc Kramis and Marcel Waldvogel},

url = {https://netfuture.ch/wp-content/uploads/2011/graf11treetank.pdf},

year  = {2011},

date = {2011-03-26},

urldate = {1000-01-01},

booktitle = {XML Prague '11},

abstract = {XML underlies the same constant modification scenarios like any other resource especially in flexible environments like the WWW. Therefore, intelligent handling of versioned XML is mandatory. Due to the structural nature of XML, the efficient storage of changes in the data and therefor in the tree needs new paradigms regarding efficient storage and effective retrieval operations. We present a node granular XML versioning approach which relies on the independence of the storage and the versioning system. Different layers which have the ability to satisfy specific aspects of a node-granular versioning storage guarantee this independence. Results prove that our architecture offers efficient handling of consecutive changes within all modification scenarios while not restricting XML regarding its usage. Hence, our prototype system handles even huge XML instances while ensuring equal access to each revision of the data.},

keywords = {Cloud Storage, XML},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{Islam2011Questioning,

title = {Questioning flooding as a routing benchmark in Opportunistic Networks},

author = {Arshad Islam and Marcel Waldvogel},

url = {https://netfuture.ch/wp-content/uploads/2011/islam11questioning.pdf},

year  = {2011},

date = {2011-03-26},

urldate = {1000-01-01},

booktitle = {Proceedings of the Baltic Congress on Future Internet Communications},

pages = {128-133},

abstract = {Routing in Opportunistic Networks, as a relatively young discipline, still lacks coherent, simple and valid benchmarks. It is customary to use epidemic routing as performance benchmark for Opportunistic Networks. We identify and describe the current simulation practices that do not expose the shortcomings of flooding as an upper bound. In this paper to provide a step towards a routing benchmark, which is flexible, provides results close to an upper bound, is simple to implement, and thus might be a candidate for a common benchmark. This new method called EPO, does not suffer from bottlenecks that limit the performance of epidemic flooding, even when bandwidth is scarce. Our analysis shows that networks are not suffering from that much severe congestion as suggested by flooding and thus giving a better insight to the underlying network.},

keywords = {Mobile Networks, Opportunistic Networks},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{Islam2011Optimizing,

title = {Optimizing Message Delivery in Mobile-Opportunistic Networks},

author = {Arshad Islam and Marcel Waldvogel},

url = {https://netfuture.ch/wp-content/uploads/2011/islam11optimizing.pdf},

isbn = {978-1-4244-8511-6},

year  = {2011},

date = {2011-02-16},

urldate = {1000-01-01},

booktitle = {Proceedings of the Baltic Congress on Future Internet Communications},

pages = {134-141},

abstract = {The big challenge of routing in opportunistic mobile networks, overlooked by most researchers, is to not only find any path to the destination, but a path that is stable and powerful enough to actually carry the message. Few attempts addressed this problem, all of them under controlled scenarios, avoiding the complexity of real-world connectivity. As a result of our comparison of selected networks under a wide variety of realistic scenarios, we have not only been able to identify and describe favorable traits of protocols, but also necessary relationship of successful MON protocols with QoS routing in wired networks. We present a novel protocol, Nile, that performs both in dense as well as sparse networks. Nile is the first autonomous “controlled Hooding” protocol that keeps the link loads in check, to push replicas only on those paths that are both promising and may sustain more load. It is a multi path protocol that deploys replication based on heuristic for disjoint path calculation. Other protocols' performance, when simulated in real-world traces, highly depends on parameter choice. Nile, however, consistently performs among the top protocols without any external tuning and exerts far less overhead than other replication protocols.},

keywords = {Mobile Networks, Opportunistic Networks},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{Graf2010Integrity,

title = {Integrity Assurance for RESTful XML},

author = {Sebastian Graf and Lukas Lewandowski and Marcel Waldvogel},

url = {https://netfuture.ch/wp-content/uploads/2010/graf10integrity.pdf},

year  = {2010},

date = {2010-11-04},

urldate = {1000-01-01},

booktitle = {Proceedings of WISM 2010},

abstract = {The REpresentational State Transfer (REST) represents an extensible, easy and elegant architecture for accessing web-based resources. REST alone and in combination with XML is fast gaining momentum in a diverse set of web applications. REST is stateless, as is HTTP on which it is built. For many applications, this not enough, especially in the context of concurrent access and the increasing need for auditing and accountability. We present a lightweight mechanism which allows the application to control the integrity of the underlying resources in a simple, yet flexible manner. Based on an opportunistic locking approach, we show in this paper that XML does not only act as an extensible and direct accessible backend that ensures easy modifications due to the allocation of nodes, but also gives scalable possibilities to perform on-the-fly integrity verification based on the tree structure.},

keywords = {Security, XML},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{Belle2009PathForge,

title = {PathForge: Faithful Anonymization of Movement Data},

author = {Sebastian Kay Belle and Marcel Waldvogel},

url = {https://netfuture.ch/wp-content/uploads/2009/belle09pathforge.pdf},

year  = {2009},

date = {2009-08-17},

urldate = {1000-01-01},

booktitle = {Proceedings of the 1st ACM workshop on Networking, systems, and applications for mobile handhelds (MobiHeld '09)},

pages = {63-64},

abstract = {For most mobile networks, providers need the current position of their users to provide efficient service. The resulting motion data is not only an invaluable source for analyzing traffic or flow patterns, but also for tracking an individual's whereabouts, even without their knowledge. Today, many carry at least one mobile networked device with them wherever they go, day and night. The resulting motion data can be used to reveal the most intimate details of our lives, making this information extremely privacy sensitive. In this paper, we present PathForge, a lightweight solution, which not only fulfills the provider's efficiency requirement, but continues to allow flow pattern analysis, yet provides full privacy for users when not actively involved in a call.},

keywords = {Mobile Networks, Privacy, Security},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{Mansmann2009Interactive,

title = {Interactive Analysis of NetFlows for Misuse Detection in Large IP Networks},

author = {Florian Mansmann and Fabian Fischer and Daniel A. Keim and Stephan Pietzko and Marcel Waldvogel},

url = {https://netfuture.ch/wp-content/uploads/2009/mansmann09interactive.pdf},

year  = {2009},

date = {2009-05-01},

urldate = {1000-01-01},

booktitle = {DFN-Forum Kommunikationstechnologie},

address = {Garching (Munich), Germany},

abstract = {While more and more applications require higher network bandwidth, there is also a tendency that large portions of this bandwidth are misused for dubious purposes, such as unauthorized VoIP, file sharing, or criminal botnet activity. Automatie intrusion detection methods can detcct a large portion of such misuse, but novel patterns can only be detected by humans. Moreover, interpretation of large amounts of alerts imposes new challenges on the analysts. The goal of this paper is to preseot the visual analysis system NFlowVis to interactively detcct unwanted usage of the network infrastructure either by pivoting NetFlows using IOS alerts or by specifying usage patterns, such as sets of suspicious port numbers. Thereby, our work focuses on providing a scalable approach to store and retrieve large quantities of Netflows by means of a database management system.},

keywords = {Intrusion Detection, Security},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{Belle2008I,

title = {I Seek for Knowledge: Exploiting Social Properties in Mobile Ad-Hoc Networks},

author = {Sebastian Kay Belle and Muhammad Arshad Islam and Marcel Waldvogel},

url = {https://netfuture.ch/wp-content/uploads/2008/belle08iseek.pdf},

year  = {2008},

date = {2008-11-24},

urldate = {1000-01-01},

booktitle = {In Proceedings of 1st IFIP Wireless Days 2008},

pages = {1-5},

abstract = {New social networks are born each day, at a formal conference, at informal social gathering, at family reunions etc. Internet has already been playing an important role to let people socialize through online social websites. For many users, its still not the optimal way of interaction as one has to be very active updating their activities on the online profiles. With the easy access to mobile devices, modern technologies have now started to adopt to more human of socializing. As these mobile devices accompany their users almost all the time, they can record and observe their users behavior as well as gather information about their social circle. Therefore, they can help users to get information from contacts, that they potentially not even know. In this paper we put our efforts towards the initial design of such an architecture, we call \emph{Mergenet}, that will sniff for information around the user's surrounding, leveraging useful answers on their demand.

},

keywords = {Opportunistic Networks, Privacy, Social Networks},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{Graf2008Distributing,

title = {Distributing XML with Focus on Parallel Evaluation},

author = {Sebastian Graf and Marc Kramis and Marcel Waldvogel},

url = {https://netfuture.ch/wp-content/uploads/2008/graf08distributing.pdf},

year  = {2008},

date = {2008-08-23},

urldate = {1000-01-01},

booktitle = {Sixth International Workshop on Databases, Information Systems and Peer-to-Peer Computing (DBISP2P 2008)},

pages = {55-67},

abstract = {In contrast to relational databases the distribution of document-centric XML is not well researched. While there are some suggestions on how to split and distribute large XML documents, these approaches do not consider the parallel query evaluation. In this paper, we present and compare five different algorithms to search after suitable split nodes in

a large XML document. We then describe how to distribute extractable substructures over a fixed number of peers and how to query these peers in parallel to retrieve the final result. In addition, we analyse the impact of our splitting algorithms with respect to scalability for two different XPath expression classes on three well-known XML data sets. We conclude this paper with an outlook on future work, including result ordering during parallel query execution and dynamic re-distribution of XML fragments to new peers due to updates.},

keywords = {Cloud Storage, XML},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{Fischer2008Large-scale,

title = {Large-scale Network Monitoring for Visual Analysis of Attacks},

author = {Fabian Fischer and Florian Mansmann and Daniel A. Keim and Stephan Pietzko and Marcel Waldvogel},

url = {https://netfuture.ch/wp-content/uploads/2008/fischer08large-scale.pdf},

year  = {2008},

date = {2008-08-15},

urldate = {1000-01-01},

booktitle = {5th International Workshop on Visualization for Cyber Security (VizSEC 2008)},

address = {Cambridge, MA, USA},

abstract = {The importance of the Internet and our dependency on computer networks are steadily growing, which results in high costs and substantial consequences in case of successful intrusions, stolen data, and interrupted services. At the same time, a trend towards massive attacks against the network infrastructure is noticeable. Therefore, monitoring large networks has become an important field in practice and research. Through monitoring systems, attacks can be detected and analyzed to gain knowledge of how to better protect the network in the future. In the scope of this paper, we present a system to analyze NetFlow data using a relational database system. NetFlow records are linked with alerts from an intrusion detection system to enable efficient exploration of suspicious activity within the monitored network. Within the system, the monitored network is mapped to a TreeMap visualization, the attackers are arranged at the borders and linked using splines parameterized with prefix information. In a series of case studies, we demonstrate how the tool can be used to judge the relevance of alerts, to reveal massive distributed attacks, and to analyze service usage within a network.},

keywords = {Intrusion Detection, Security},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{Belle2008Consistent,

title = {Consistent Deniable Lying: Privacy in Mobile Social Networks},

author = {Sebastian Kay Belle and Marcel Waldvogel},

url = {https://netfuture.ch/wp-content/uploads/2008/belle08consistent.pdf},

year  = {2008},

date = {2008-05-19},

urldate = {1000-01-01},

booktitle = {Pervasive 2008 Workshop on Security and Privacy Issues in Mobile Phone Use (SPMU 2008)},

address = {Sydney, Australia},

abstract = {Social networking is moving to mobile phones. This not only means continuous access, but also allows to link virtual and physical neighbourhood in novel ways. To make such systems useful, personal data such as lists of friends and interests need to be shared with more and frequently unknown people, posing a risk to your privacy. In this paper, we present our approach to social networking, Consistent Deniable Lying (CDL). Using easy-to-understand mechanisms and tuned to this environment, it enables you to meet new friends with joint interests while limiting exposure of your private data. Not only can it be generalised to include “friends of friends” (transitivity) into interest search, it allows you to plausibly refute any allegations of your claimed interests. Unlike prior work, we focus on the application to similarity finding and include the novel aspects of transitivity and deniability, which are key to success in social networks.},

keywords = {Opportunistic Networks, Peer-to-Peer, Privacy, Security, Social Networks},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{Islam2008Reality-Check,

title = {Reality-Check for DTN Routing Algorithms},

author = {Arshad Islam and Marcel Waldvogel},

url = {https://netfuture.ch/wp-content/uploads/2008/islam08reality.pdf},

isbn = {978-0-7695-3173-1},

year  = {2008},

date = {2008-01-01},

urldate = {1000-01-01},

booktitle = {ICDCSW '08: Proceedings of the 2008 The 28th International Conference on Distributed Computing Systems Workshops},

pages = {204--209},

publisher = {IEEE Computer Society},

address = {Washington, DC, USA},

abstract = {Many applications of ad-hoc networks include intermittent connectivity. Anyone wishing to implement routing into her delay-tolerant network can select from a wide variation of options, but the choice is hard, as there is no strong comparative evidence to the relative performance of the algorithms. Every paper uses a different setting, mostly far from realistic. In our desire to improve the basis for decisions, we simulated a promising selection of DTN routing algorithms in three vastly different scenarios, all based on publicly available real-world traces. Using our open-source DTN simulator, we compare and analyse 11 routing techniques, then provide explanations for the behaviour and give advice for choosing a suitable mechanism.  To our own surprise, the results challenge the conventional wisdom gained from synthetic simulations and poses the question whether the world is ready for DTNs.

},

keywords = {Opportunistic Networks},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{Bauer2007Replica,

title = {Replica Placement and Location using Distributed Hash Tables},

author = {Daniel Bauer and Paul Hurley and Marcel Waldvogel},

url = {https://netfuture.ch/wp-content/uploads/2007/bauer07replica.pdf},

isbn = {0-7695-3000-1},

year  = {2007},

date = {2007-10-15},

urldate = {2007-10-15},

booktitle = {Proceedings of IEEE LCN},

pages = {315-324},

crossref = {DBLP:conf/lcn/2007},

abstract = {Interest in distributed storage is fueled by demand for reliability and resilience combined with decreasing hardware costs. Peer-to-peer storage networks based on distributed hash tables are attractive for their efficient use of resources and resulting performance. The placement and subsequent efficient location of replicas in such systems remain open problems, especially (1) the requirement to update replicated content, (2) working in the absence of global information, and (3) determination of the locations in a dynamic system without introducing single points of failure. We present and evaluate a novel and versatile technique, replica enumeration, which allows for controlled replication and replica access. The possibility of enumerating and addressing individual replicas allows dynamic updates as well as superior performance without burdening the network with state information, yet taking advantage of locality information when available. We simulate, analyze, and prove properties of the system, and discuss some applications.},

keywords = {Peer-to-Peer, Replication},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{Waldvogel2007Light-weight,

title = {Light-weight End-to-End QoS as DoS Prevention},

author = {Marcel Waldvogel and Tobias Köck},

url = {https://netfuture.ch/wp-content/uploads/2006/waldvogel06light-weight.pdf},

year  = {2007},

date = {2007-09-01},

urldate = {1000-01-01},

booktitle = {Proceedings of IEEE LCN 2007},

abstract = {Despite decades of QoS research and many years of DoS defence work, neither group of proponents have been able to get their results included into mainstream Internet service. It seems that demand for either solution exists, but individually, they seem to be just below the cost/ benefit threshold. This paper proposes a first step into a common solution, where combined and extended interests will hopefully allow us to surpass this threshold. While there are still some open issues, we hope to not only pro- pose a basic working mechanism but also provide fresh ideas to start thinking off the beaten path. Our main contribution is to create a lightweight, end-to-end binding between path and service, which is then used as a basis to associate fur- ther attributes and mechanisms to this binding. As a result, both DoS defence and QoS can be achieved with stateless routers and only with prior consent of receiving the end sys- tems, short, achieving several of the IntServ advantages in a DiffServ-style system, i.e., avoiding per-connection state.},

keywords = {Denial of Service, Quality of Service, Security},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{Hurley2007Bloom,

title = {Bloom Filters: One Size Fits All?},

author = {Paul Hurley and Marcel Waldvogel},

url = {https://netfuture.ch/wp-content/uploads/2007/waldvogel07bloom.pdf},

issn = {0742-1303},

year  = {2007},

date = {2007-06-17},

urldate = {1000-01-01},

booktitle = {Proceedings of IEEE LCN 2007},

journal = {lcn},

pages = {183-190},

abstract = {Bloom filters impress by their sheer elegance and have become a widely and indiscriminately used tool in network applications, although, as we show, their performance can often be far from optimal. Notably in application areas where false negatives are tolerable, other techniques can clearly be better. We show that, at least for a specific area in the parameter space, Bloom filters are significantly outperformed even by a simple scheme. We show that many application areas where Bloom filters are deployed do not require the strong policy of no false negatives and sometimes even prefer false negatives. We analyze, through modelling, how far Bloom filters are from the optimal and then examine application specific issues in a distributed web caching scenario. We hope to open up and seed discussion towards domain-specific alternatives to Bloom filters while perhaps sparking ideas for a general-purpose alternative.},

keywords = {Bloom Filters, Hash Tables},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{Kramis07jscsi,

title = {jSCSI – A Java iSCSI Initiator},

author = {Marc Kramis and Volker Wildi and Bastian Lemke and Sebastian Graf and Halldór Janetzko and Marcel Waldvogel},

url = {https://netfuture.ch/wp-content/uploads/2013/12/jscsi_slides.pdf},

year  = {2007},

date = {2007-01-01},

urldate = {1000-01-01},

booktitle = {Paper for: Jazoon'07 – Internationale Konferenz für Java-Technologie},

publisher = {Universität Konstanz},

abstract = {Accessing persistent storage from Java usually means talking to the file system through the frugal Java file system abstraction, i.e., the File class. Currently, there is no platform-independent way to directly talk to a single local or remote storage device, yet alone a device pool. jSCSI aims to fill this gap by implementing the iSCSI protocol right in Java. We believe that firstly, Java is mature enough to cleanly implement well-performing low-level storage protocols and secondly, that it would be very convenient to plug a terabyte-sized iSCSI RAID into the local network and immediately connect to it from any JVM.},

keywords = {Cloud Storage},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{Janetzko2006Exploring,

title = {Interactive Poster: Exploring Block Access Patterns of Native XML Storage},

author = {Halldór Janetzko and Daniel A. Keim and Marc Kramis and Florian Mansmann and Marcel Waldvogel},

url = {https://netfuture.ch/wp-content/uploads/2006/janetzko06exploring.pdf},

year  = {2006},

date = {2006-10-29},

urldate = {1000-01-01},

booktitle = {Proceedings of InfoVis 2006},

abstract = {Recent block-based native XML storage systems such as IDEFIX touch blocks according to the XQuery engine’s execution plan. The resulting access patterns are virtually unknown and potentially cause many expensive disk seeks. Visualization comes to the rescue when extensive log files must be analyzed – a tedious and difficult task. The dynamic time-based block-touch animation as well as the static block-type information of VISUAL IDEFIX foster the insight into the performance-critical internals of the XML storage and help to optimize both the block layout and the XQuery engine to speed up queries.},

keywords = {XML},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{Waldvogel2006Stealth,

title = {Stealth DoS},

author = {Marcel Waldvogel and Michael Muncan and Mahak Patidar},

url = {https://netfuture.ch/wp-content/uploads/2006/waldvogel06stealth.pdf},

year  = {2006},

date = {2006-09-28},

urldate = {1000-01-01},

booktitle = {Proceedings of IEEEslash IST Workshop on Monitoring, Attack Detection, and Mitigation (MonAM 2006)},

abstract = {Users and providers increasingly disagree on what Denial of Service (DoS) is. For example, an ISP might consider large multimedia downloads an attack to overload its infrastructure or have it pay high interconnection fees. On the other hand, a user will certainly consider selective bandwidth reduction that is used by ISPs as a countermea- sure, as a DoS measure. Given the nature of their business relationship, neither side is likely to openly admit that they are fighting each other. In this paper we attempt to formalise the concept of Stealth DoS, including listing mechanisms that may be used at high speed. We concentrate on mechanisms that might be used in one particular area, voice over IP (VoIP). We start evaluating them under the different aspects, including their cost, political suitability and the likelihood for countermeasures to succeed. We expect that this will give both sides better insight on their options and plea for peace, hopefully in an attempt to avoid and open war.},

keywords = {Denial of Service, Security},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{Gruen2006Pushing,

title = {Pushing XPath Accelerator to its Limits},

author = {Christian Grün and Alexander Holupirek and Marc Kramis and Marc H. Scholl and Marcel Waldvogel},

url = {https://netfuture.ch/wp-content/uploads/2006/gruen06pushing.pdf},

year  = {2006},

date = {2006-06-01},

urldate = {1000-01-01},

booktitle = {Proceedings of the First International Workshop on Performance and Evaluation of Data Management Systems (EXPDB 2006)},

publisher = {ACM},

abstract = {<p>Two competing encoding concepts are known to scale well with growing amounts of XML data: XPath Accelerator encoding implemented by MonetDB for in-memory documents and X-Hive's Persistent DOM for on-disk storage. We identified two ways to improve XPath Accelerator and present prototypes for the respective techniques: BaseX boosts inmemory performance with optimized data and value index structures while Idefix introduces native block-oriented persistence with logarithmic update behavior for true scalability, overcoming main-memory constraints.</p><p>An easy-to-use Java-based benchmarking framework was developed and used to consistently compare these competing techniques and perform scalability measurements. The established XMark benchmark was applied to all four systems under test. Additional fulltext-sensitive queries against the well-known DBLP database complement the XMark results. Not only did the latest version of X-Hive finally surprise with good scalability and performance numbers. Also, both BaseX and Idefix hold their promise to push XPath Accelerator to its limits: BaseX efficiently exploits available main memory to speedup XML queries while Idefix surpasses main-memory constraints and rivals the on-disk leadership of X-Hive. The competition between XPath Accelerator and Persistent DOM definitely is relaunched.</p>},

keywords = {XML},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{Bauer2004Bringing,

title = {Bringing Efficient Advanced Queries to Distributed Hash Tables},

author = {Daniel Bauer and Paul Hurley and Roman Pletka and Marcel Waldvogel},

url = {https://netfuture.ch/wp-content/uploads/2004/bauer04bringing.pdf},

year  = {2004},

date = {2004-11-01},

urldate = {1000-01-01},

booktitle = {Proceedings of IEEE LCN},

abstract = {Interest in distributed storage is fueled by demand for reliability and resilience combined with ubiquitous availability. Peer-to-peer (P2P) storage networks are known for their decentralized control, self-organization, and adaptation. Advanced searching for documents and resources remains an open problem. The flooding approach favored by some P2P networks is ineffiencient in resource usage, but more scalable and resource-efficient solutions based on Distributed Hash Tables (DHT) lack in query expressiveness and flexibility. In this paper, we address this issue and introduce new efficient, scalable, and completely distributed methods that strive to keep resource consumption by queries and index information as low as possible. We describe how to improve the handling of multiple subqueries combined through boolean set operators. The need for these operators is intensified by applications to go beyond simple exact keyword matches. We discuss, optimize, and analyze appropriate extensions to support range and prefix matching in DHTs.},

keywords = {Peer-to-Peer},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{Kind2003Role,

title = {The Role of Network Processors in Active Networks},

author = {Andreas Kind and Roman Pletka and Marcel Waldvogel},

url = {https://netfuture.ch/wp-content/uploads/2003/kind03role.pdf},

year  = {2003},

date = {2003-12-01},

urldate = {1000-01-01},

booktitle = {Proceedings of IWAN 2003},

pages = {18-29},

address = {Kyoto, Japan},

abstract = {Network processors (NPs) implement a balance between hardware and software that addresses the demand of performance and programmability in active networks (AN). We argue that this makes them an important player in the implementation and deployment of ANs. Besides a general introduction into the relationship of NPs and ANs, we describe the power of this combination in a framework for secure and safe capsule-based active code. We also describe the advantages of offloading AN control point functionality into the NP and how to execute active code in the data path efficiently. Furthermore, the paper reports on experiences about implementing active networking concepts on the IBM PowerNP network processor. },

keywords = {Active Networks, Network Processors, Quality of Service, Security},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{Pletka2003PURPLE,

title = {PURPLE: Predictive Active Queue Management Utilizing Congestion Information},

author = {Roman Pletka and Marcel Waldvogel and Soenke Mannal},

url = {https://netfuture.ch/wp-content/uploads/2003/pletka03purple.pdf},

year  = {2003},

date = {2003-10-01},

urldate = {1000-01-01},

booktitle = {Proceedings of IEEE LCN 2003},

pages = {21--30},

abstract = {Active Queue Management (AQM) is an attempt to find a delicate balance between two antagonistic Internet queuing requirements: First, buffer space should be maximized to accommodate the possibly huge transient bursts; second, buffer occupation should be minimum so as not to introduce unnecessary end-to-end delays. Traditional AQM mechanisms have been built on heuristics to achieve this balance, and have mostly done so quite well, but often require manual tuning or have resulted in slow convergence. In contrast, the PURPLE approach predicts the impact of its own actions on the behavior of reactive protocols and thus on the short-term future traffic without keeping per-flow state. PURPLE allows much faster convergence of the main AQM parameters, at least towards a local optimum, thereby smoothing and minimizing both congestion feedback and queue occupancy. To improve the quality of the prediction, we also passively monitor (using lightweight operations) information pertaining to the amount of congestion elsewhere in the network, for example, as seen by flows traversing this router.},

keywords = {},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{Caronni2003Establishing,

title = {Establishing Trust in Distributed Storage Providers},

author = {Germano Caronni and Marcel Waldvogel},

url = {https://netfuture.ch/wp-content/uploads/2003/caronni03establishing.pdf},

year  = {2003},

date = {2003-09-01},

urldate = {1000-01-01},

booktitle = {Proceedings of Third IEEE International Conference on Peer-to-Peer Computing (P2P 2003)},

abstract = {Corporate IT as well as individuals show increasing interest in reliable outsourcing of storage infrastructure. Decentralized solutions with their resilience against partial outages are among the most attractive approaches. Irrespective of the form of the relationship, be it based on a contract or on the more flexible cooperative model, the problem of verifying whether someone promising to store one's data actually does so remains to be solved, especially in the presence of multiple replicas. In this paper, we introduce a lightweight mechanism that allows the \textit{data originator} or a dedicated \textit{verification agent} to build up trust in the \textit{replica holder} by means of protocols that do not require prior trust or key establishment. We show how naive versions of the protocol do not prevent cheating, and then strengthen it by adding means that make it economically attractive to be honest. This provides a foundation for further work in providing trustworthy distributed storage.},

keywords = {Cloud Storage, Peer-to-Peer, Replication, Trust},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{Waldvogel2003Efficient,

title = {Efficient Buffer Management for Scalable Media-on-Demand},

author = {Marcel Waldvogel and Wei Deng and Ramaprabhu Janakiraman},

url = {https://netfuture.ch/wp-content/uploads/2003/waldvogel03efficient.pdf},

year  = {2003},

date = {2003-01-15},

urldate = {1000-01-01},

booktitle = {SPIE Multimedia Computing and Networking (MMCN 2003)},

address = {Santa Clara, CA, USA},

abstract = {<p>Widespread availability of high-speed networks and fast, cheap computation have rendered high-quality Media-on-Demand (MoD) feasible. Research on scalable MoD has resulted in many efficient schemes that involve segmentation and asynchronous broadcast of media data, requiring clients to buffer and reorder out-of-order segments efficiently for serial playout.</p><p>In such schemes, buffer space requirements run to several hundred megabytes and hence require efficient buffer management techniques involving both primary memory and secondary storage: while disk sizes have increased exponentially, access speeds have not kept pace at all.</p><p>The conversion of out-of-order arrival to in-order playout suggests the use of external memory priority queues, but their content-agnostic nature prevents them from performing well under MoD loads. In this paper, we propose and evaluate a series of simple heuristic schemes which, in simulation studies and in combination with our scalable MoD scheme, achieve significant improvements in storage performance over existing schemes.</p>},

keywords = {Multicast, Video-on-Demand},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{Janakiraman2003Indra,

title = {Indra: A Peer-to-Peer Approach to Network Intrusion Detection and Prevention},

author = {Ramaprabhu Janakiraman and Marcel Waldvogel and Qi Zhang},

url = {https://netfuture.ch/wp-content/uploads/2003/janakiraman03indra.pdf},

year  = {2003},

date = {2003-01-01},

urldate = {1000-01-01},

booktitle = {Proceedings of IEEE WETICE 2003},

address = {Linz, Austria},

abstract = {While the spread of the Internet has made the network ubiquitous, it has also rendered networked systems vulnerable to malicious attacks orchestrated from anywhere. These attacks or intrusions typically start with attackers infiltrating a network through a vulnerable host and then launching further attacks on the local network or Intranet. Attackers rely on increasingly sophisticated techniques like using distributed attack sources and obfuscating their network addresses. On the other hand, software that guards against them remains rooted in traditional centralized techniques, presenting an easily-targeted single point of failure. Scalable, distributed network intrusion prevention techniques are sorely needed. We propose Indra---a distributed scheme based on sharing information between trusted peers in a network to guard the network as a whole against intrusion attempts. We present initial ideas for running Indra over a peer-to-peer infrastructure to distribute up-to-date rumors, facts, and trust information in a scalable way.},

keywords = {Denial of Service, Security, Trust},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{Pletka2003Closed-Loop,

title = {Closed-Loop Congestion Control for Mixed Responsive and Non-Responsive Traffic},

author = {Roman Pletka and Andreas Kind and Marcel Waldvogel and Soenke Mannal},

url = {https://netfuture.ch/wp-content/uploads/2003/pletka03closedloop.pdf},

year  = {2003},

date = {2003-01-01},

urldate = {1000-01-01},

booktitle = {Proceedings of Globecom 2003},

abstract = {Today's known and widely used active queue management (AQM) schemes do not differentiate between packets from responsive (e.g., TCP sessions) and non-responsive traffic (e.g., UDP). This results in further widening the gap of unfair advantage already inherent to non-responsive traffic, as the responsive sender will significantly reduce its future transmit rate as a result of the congestion signals. As a simple work-around, responsive and non-responsive traffic are often assigned distinct AQM parameters. This approach however requires tuning for each traffic class that potentially depends on the current or expected offered load. In other words, responsiveness and TCP-friendliness cannot be estimated easily—not at last due to short-lived TCP sessions. In this paper we propose a closed-loop congestion control (CLCC) scheme on top of an existing AQM scheme to achieve fair bandwidth distribution among concurrent responsive and non-responsive traffic. The new scheme has the advantage that it does not need to estimate the level of responsiveness of traffic. We analyze our scheme on top of an existing rate-based AQM scheme known to approximate max-min fairness, and by means of simulations show that our extension significantly improves fair bandwidth allocation for responsive and non-responsive traffic. The simulation results have been verified with a prototype implementation on the IBM PowerNP 4GS3 network processor.},

keywords = {Control Engineering, Fast Routers, Traffic Engineering},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{Waldvogel2002Efficient,

title = {Efficient Topology-Aware Overlay Network},

author = {Marcel Waldvogel and Roberto Rinaldi},

url = {https://netfuture.ch/wp-content/uploads/2003/waldvogel03efficient.pdf},

year  = {2002},

date = {2002-10-01},

urldate = {1000-01-01},

booktitle = {Proceedings of ACM HotNets-I},

abstract = {Peer-to-peer (P2P) networking has become a household word in the past few years, being marketed as a work-around for server scalability problems and ``wonder drug'' to achieve resilience. Current widely-used P2P networks rely on central directory servers or massive message flooding, clearly not scalable solutions. Distributed Hash Tables (DHT) are expected to eliminate flooding and central servers, but can require many long-haul message deliveries. We introduce Mithos, an content-addressable overlay network that only uses minimal routing information and is directly suitable as an underlay network for P2P systems, both using traditional and DHT addressing. Unlike other schemes, it also efficiently provides locality-aware connectivity, thereby ensuring that a message reaches its destination with minimal overhead. Mithos provides for highly efficient forwarding, making it suitable for use in high-throughput applications. Paired with its ability to have addresses directly mapped into a subspace of the IPv6 address space, it provides a potential candidate for native deployment. Additionally, Mithos can be used to support third-party triangulation to quickly select a close-by replica of data or services.},

keywords = {Peer-to-Peer},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{Janakiraman2002Fuzzycast:,

title = {Fuzzycast: Efficient Video-on-Demand over Multicast},

author = {Ramaprabhu Janakiraman and Marcel Waldvogel and Lihao Xu},

url = {https://netfuture.ch/wp-content/uploads/2002/janakiraman02fuzzycast.pdf},

year  = {2002},

date = {2002-06-01},

urldate = {1000-01-01},

booktitle = {Proceedings of INFOCOM},

pages = {920-929},

address = {New York, NY, USA},

abstract = { Server bandwidth has been identified as a major bottleneck in large Video-on-Demand (VoD) systems. Using multicast delivery to serve popular content helps increase scalability by making efficient use of server bandwidth. In addition, recent research has focused on proactive schemes in which the server periodically multicasts popular content without explicit requests from clients. Proactive schemes are attractive because they consume bounded server bandwidth irrespective of client arrival rate. In this work, we describe Fuzzycast, a scalable periodic multicast scheme that uses simple techniques to provide video on demand at reasonable client start-up times while consuming optimal server bandwidth. We present a theoretical analysis of its bandwidth and client buffer requirements and prove its optimality. We study the effect of variable bitrate (VBR) media on Fuzzycast performance and propose a simple extension to transmit VBR media over constant rate channels. Finally, we solve the problem of partitioning a transmission over multiple multicast groups by considering it as a specific instance of a more widely encountered resource trade-off. },

keywords = {Multicast, Video-on-Demand},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{Norden2002Imprecise,

title = {Imprecise Multicast Routing for Scalable Information Distribution},

author = {Samphel Norden and Marcel Waldvogel},

url = {https://netfuture.ch/wp-content/uploads/2002/norden02imprecise.pdf},

year  = {2002},

date = {2002-02-01},

urldate = {1000-01-01},

booktitle = {Proceedings of International Zurich Seminar (IZS) 2002},

pages = {14-1 -- 14-6},

address = {Zurich, Switzerland},

abstract = {Typically, multicast data distribution uses rendezvous points (PIM, CBT), multicast distribution tree building protocols, and multicast forwarding. Whereas the first two approaches have been extensively studied, scaling multicast forwarding state without increasing forwarding complexity has not been addressed in detail. Having a scalable strategy for aggregation of multicast forwarding state is essential for inter-domain multicast which could have any number of concurrent multicast groups, especially in applications such as event notification and web cache invalidation mechanisms. We first present the essential characteristics of a scalable multicast routing mechanism. We then introduce and analyze, according to these metrics, a scalable aggregation mechanism for multicast-based update and change distribution based on imprecise (too generous) aggregation. Our mechanism is simple to implement, requires no additional information about the groups, and allows important savings in routing table size and routing protocol overhead, at a minimal expense in additional network and end-system traffic.},

keywords = {Bloom Filters, Fast Routers, Multicast},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{Waldvogel2002GOSSIB,

title = {GOSSIB vs. IP Traceback Rumors},

author = {Marcel Waldvogel},

url = {https://netfuture.ch/wp-content/uploads/2002/waldvogel02gossib.pdf},

year  = {2002},

date = {2002-01-01},

urldate = {1000-01-01},

booktitle = {18th Annual Computer Security Applications Conference (ACSAC 2002)},

pages = {5--13},

abstract = { To identify sources of distributed denial-of-service attacks, path traceback mechanisms have been proposed. Traceback mechanisms relying on probabilistic packet marking (PPM) have received most attention, as they are easy to implement and deploy incrementally. In this paper, we introduce a new concept, namely groups of strongly similar birthdays (GOSSIB), that can be used by to obtain effects similar to a successful birthday attack on PPM schemes. The original and most widely known IP traceback mechanism, compressed edge fragment sampling (CEFS), was developed by Savage et al. We analyze the effects of an attacker using GOSSIB against CEFS and show that the attacker can seed misinformation much more effiently than the network is able to contribute real traceback information. Thus, GOSSIB will render PPM effctively useless. It can be expected that GOSSIB has similar effcts on other PPM traceback schemes and that standard modifiations to the systems will not solve the problem.},

keywords = {Denial of Service, Security},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{Norden2001Routing,

title = {Routing Bandwidth Guaranteed Paths with Restoration in Label Switched Networks},

author = {Samphel Norden and Milind M. Buddhikot and Marcel Waldvogel and Subhash Suri},

url = {https://netfuture.ch/wp-content/uploads/2001/norden01routing.pdf},

year  = {2001},

date = {2001-11-01},

urldate = {1000-01-01},

booktitle = {Proceedings of IEEE International Conference on Network Protocols (ICNP 2001)},

pages = {71-79},

address = {Riverside, CA, USA},

abstract = { Label switched networks have become increasingly attractive to both network providers and customers. By creating aggregate, bandwidth-reserved flows, these networks are known for their routing flexibility, predictable bandwidth usage, and quality-of-service (QoS) provisioning. This flexibility in routing enables fault-persistent QoS reservations, where connectivity and allotted bandwidth remains available, even if some links or network nodes fail. The automatic switch-over from a now-defunct path to a new, working path is known as restoration. Restoring bandwidth-guaranteed paths requires allocation of resources to be used in presence of faults, so-called backup paths. In this paper, we investigate distributed algorithms for routing with backup restoration. Specifically, we propose a new concept of Backup Load Distribution Matrix, that captures partial network state, greatly reducing the amount of routing information maintained and transmitted while achieving efficient bandwidth usage. We present and simulate two new distributed routing algorithms, which provide significant improvements in rejection rates and provide substantial savings in call setup time compared to existing algorithms.},

keywords = {Traffic Engineering},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{Suri2001Profile-Based,

title = {Profile-Based Routing: A New Framework for MPLS Traffic Engineering},

author = {Subhash Suri and Marcel Waldvogel and Priyank Ramesh Warkhede},

editor = {Fernando Boavida},

url = {https://netfuture.ch/wp-content/uploads/2001/suri01profilebased.pdf},

year  = {2001},

date = {2001-09-01},

urldate = {1000-01-01},

booktitle = {Quality of future Internet Services},

number = {2156},

pages = {138-157},

publisher = {Springer Verlag},

address = {Berlin},

series = {Lecture Notes in Computer Science},

abstract = { We present a new algorithm and framework for dynamic routing of bandwidth guaranteed flows. The problem is motivated by the need to dynamically set up bandwidth guaranteed paths in carrier and ISP networks. Traditional routing algorithms such as minimum hop routing or widest path routing do not take advantage of any knowledge about the traffic distribution or ingress-egress pairs, and therefore can often lead to severe network underutilization. Our work is inspired by the recently proposed ``minimum interference routing'' algorithm (MIRA) of Kodialam and Lakshman, but it improves on their approach in several ways. Our main idea is to use a ``traffic profile'' of the network, obtained by measurements or service level agreements (SLAs), as a rough predictor of the future traffic distribution. We use this profile to solve a multicommodity network flow problem, whose output is used both to guide our online path selection algorithm as well as impose admission control. The offline multicommodity solution seems very effective at distributing the routes and avoiding bottlenecks around hot spots. In particular, our algorithm can anticipate a flow's blocking effect on groups of ingress-egress pairs, while MIRA only considers one ingress-egress pair at a time. Our simulation results show that the new algorithm outperforms shortest path, widest path, and minimum interference routing algorithms on several metrics, including the fraction of requests routed and the fraction of requested bandwidth routed. Finally, the framework is quite general and can be extended in numerous ways to accommodate a variety of traffic management priorities in the network. },

keywords = {MPLS, Quality of Service, Traffic Engineering},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{Braun2001Layered,

title = {Layered Protocol Wrappers for Internet Packet Processing in Reconfigurable Hardware},

author = {Florian Braun and John Lockwood and Marcel Waldvogel},

url = {https://netfuture.ch/wp-content/uploads/2001/braun01layered.pdf},

year  = {2001},

date = {2001-08-01},

urldate = {1000-01-01},

booktitle = {Proceedings of IEEE Hot Interconnects 9},

address = {Stanford, CA, USA},

abstract = { A library of layered protocol wrappers has been developed that process Internet packets in reconfigurable hardware. These wrappers can be used with a reprogrammable network platform called the Field Programmable Port Extender (FPX) to rapidly prototype hardware circuits for processing Internet packets. We present a framework to streamline and simplify the development of networking applications that process ATM cells, AAL5 frames, Internet Protocol (IP) packets and UDP datagrams directly in hardware.},

keywords = {Fast Routers, FPGA},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{Pendarakis2001ALMI,

title = {ALMI: An Application Level Multicast Infrastructure},

author = {Dimitris Pendarakis and Sherlia Shi and Dinesh Verma and Marcel Waldvogel},

url = {https://netfuture.ch/wp-content/uploads/2001/pendarakis01almi.pdf},

year  = {2001},

date = {2001-03-01},

urldate = {1000-01-01},

booktitle = {Proceedings of the 3rd USENIX Symposium on Internet Technologies and Systems (USITS '01)},

pages = {49-60},

address = {San Francisco, CA, USA},

abstract = {The IP multicast model allows scalable and efficient multi-party communication, particularly for groups of large size. However, deployment of IP multicast requires substantial infrastructure modifications and is hampered by a host of unresolved open problems. To circumvent this situation, we have designed and implemented ALMI, an application level group communication middleware, which allows accelerated application deployment and simplified network configuration, without the need of network infrastructure support. ALMI is tailored toward support of multicast groups of relatively small size (several 10s of members) with many to many semantics. Session participants are connected via a virtual multicast tree, which consists of unicast connections between end hosts and is formed as a minimum spanning tree (MST) using application-specific performance metric. Using simulation, we show that the performance penalties, introduced by this shift of multicast to end systems, is a relatively small increase in traffic load and that ALMI multicast trees approach the efficiency of IP multicast trees. We have also implemented ALMI as a Java based middleware package and performed experiments over the Internet. Experimental results show that ALMI is able to cope with network dynamics and keep the multicast tree efficient. },

keywords = {Multicast, Peer-to-Peer},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{Braun2001Reconfigurable,

title = {Reconfigurable Router Modules Using Network Protocol Wrappers},

author = {Florian Braun and John Lockwood and Marcel Waldvogel},

url = {https://netfuture.ch/wp-content/uploads/2001/braun01reconfigurable.pdf},

year  = {2001},

date = {2001-01-01},

urldate = {1000-01-01},

booktitle = {Field-Programmable Logic and Applications (FPL)},

pages = {254--263},

address = {Belfast, Northern Ireland},

abstract = { A library of layered protocol wrappers has been developed that process Internet packets in reconfigurable hardware. These wrappers can be used with a reprogrammable network platform called the Field Programmable Port Extender (FPX) to rapidly prototype hardware circuits for processing Internet packets. We present a framework to streamline and simplify the development of networking applications that process ATM cells, AAL5 frames, Internet Protocol (IP) packets and UDP datagrams directly in hardware. },

keywords = {Fast Routers, FPGA},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{Braun2001Fast,

title = {Fast Incremental CRC Updates for IP over ATM networks},

author = {Florian Braun and Marcel Waldvogel},

url = {https://netfuture.ch/wp-content/uploads/2001/braun01fast.pdf},

year  = {2001},

date = {2001-01-01},

urldate = {1000-01-01},

booktitle = {Proceedings of 2001 IEEE Workshop on High Performance Switching and Routing (HPSR 2001)},

address = {Dallas, TX, USA},

abstract = {In response to the increasing network speeds, many operations in IP routers and similar devices are being made more efficient. With the advances in other areas of packet processing, the verification and regeneration of cyclic redundancy check (CRC) codes of the data link layer is likely to become a bottleneck in the near future. In this paper, we present a mechanism to defer CRC verification without compromising reliability. This opens the possibility of incremental updates of the CRC. We introduce a new high-speed technique and present efficient implementations, speeding up CRC processing by a factor of 15. Although the paper and analysis focuses on IP over ATM, the scheme applies to a much wider set of network protocols.},

keywords = {CRC, Fast Routers},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{Shi2001Dimensioning,

title = {Dimensioning Server Access Bandwidth and Multicast Routing in Overlay Networks},

author = {Sherlia Shi and Jon Turner and Marcel Waldvogel},

url = {https://netfuture.ch/wp-content/uploads/2001/shi01dimensioning.pdf},

year  = {2001},

date = {2001-01-01},

urldate = {1000-01-01},

booktitle = {Prceedings of NOSSDAV 2001},

pages = {83-92},

abstract = { Application-level multicast is a new mechanism for enabling multicast in the Internet. Driven by the fast growth of network audio/video streams, application-level multicast has become increasingly important for its efficiency of data delivery and its ability of providing value-added services to satisfy application specific requirements. From a network design perspective, application-level multicast differs drastically from traditional IP multicast in its network cost model and routing strategies. We present these differences and formulate them as a network design problem consisting of two parts: one is bandwidth assignment in the overlay network, the other is load-balancing multicast routing with delay constraints. We use analytical methods and simulations to show that our design solution is a valid and cost-effective approach. Simulation results show that we are able to achieve network utilization within 10% of the best possible utilization while keeping the session rejection rate low.},

keywords = {Multicast, Traffic Engineering},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{Waldvogel2001Efficient,

title = {Efficient Media-on-demand over Multiple Multicast Groups},

author = {Marcel Waldvogel and Ramaprabhu Janakiraman},

url = {https://netfuture.ch/wp-content/uploads/2004/norden04routing1.pdf},

year  = {2001},

date = {2001-01-01},

urldate = {1000-01-01},

booktitle = {Proceedings of Globecom 2001},

address = {San Antonio, Texas, USA},

abstract = { Using multicast for serving popular movies on demand reduces load on the server and the network by eliminating redundant packet transmission. To permit clients to arrive at times of their choosing, periodic rebroadcast is necessary. In addition, splitting the transmission over multiple multicast groups reduces the cost of rebroadcasting by allowing clients to unsubscribe from groups in which they are no longer interested.</p><p>The focus of this paper is to develop techniques for efficient Media-on-Demand delivery to asynchronous clients over multiple multicast groups. We start by describing an existing periodic multicast technique that is near-optimal in terms of server bandwidth. Given a small number of groups $alpha$, we then show how to distribute content over these groups in a way that minimizes network impact. We present a theoretical analysis of the performance gains and compare these predictions with simulations over real and generated network topologies. We find that using even a small number of multicast groups provides significant reduction in overall network bandwidth.},

keywords = {Multicast, Video-on-Demand},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{Waldvogel2001EKA,

title = {EKA: Efficient Keyserver using ALMI},

author = {Marcel Waldvogel and Radhesh Mohandas and Sherlia Shi},

url = {https://netfuture.ch/wp-content/uploads/2001/waldvogel01eka.pdf},

year  = {2001},

date = {2001-01-01},

urldate = {1000-01-01},

booktitle = {Proceedings of IEEE WET ICE Workshop on Enterprise Security},

pages = {237-246},

address = {Cambridge, MA, USA},

abstract = { The keyserver network serves as a repository of OpenPGP keys, providing replication throughout the Internet. It currently uses an inefficient and insufficient protocol to keep its nodes synchronized: highly redundant network traffic and excessive overhead due to several thousand e-mail messages per day. Under these conditions, even short network outages cause massive mail server overloads and losses, resulting in continuously diverging databases. In this paper, we present a new protocol to achieve complete synchronization efficiently and automatically, drastically reducing the need for manual intervention. Our protocol transmits only the updates and uses multicast to optimize the amount of data sent. Since support for native multicast is not widely available in the underlying network and current Internet multicast does not scale well, we base our keyserver on ALMI. ALMI is a middleware for reliable applicationlevel multicast, providing scalable join/leave notification of neighbors, significantly reducing the complexity of the application. As a part of this work, we have also implemented a keyserver software which uses our protocol and an efficient RDBMS back-end to hold the keys. },

keywords = {Multicast, Security},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{Waldvogel2000Multi-Dimensional,

title = {Multi-Dimensional Prefix Matching Using Line Search},

author = {Marcel Waldvogel},

url = {https://netfuture.ch/wp-content/uploads/2000/waldvogel00multidimensional.pdf},

year  = {2000},

date = {2000-11-01},

urldate = {1000-01-01},

booktitle = {Proceedings of IEEE Local Computer Networks},

pages = {200-207},

address = {Tampa, FL, USA},

abstract = {With the increasing popularity of firewalls, virtual private networks (VPNs) and Quality of Service (QoS) routing, packet classification becomes increasingly important in the Internet. The high-performance solutions known so far strongly rely on certain properties of the filter database to match against, such as a small number of distinct prefixes or the absence of conflicts. In this paper, we present Line Search as a two-dimensional generalization of the one-dimensional binary search on prefix lengths, exploiting the advantage given by the different approach therein. This algorithm also works best on the filter databases that are expected to occur most often, but degrades gracefully when these assumptions no longer hold. We also show how to efficiently extend the algorithm to a complete five-dimensional Internet Protocol (IP) and transport header match.},

keywords = {Fast Routers, Hash Tables, Quality of Service},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{Shi2000Rate-based,

title = {A Rate-based End-to-end Multicast Congestion Control Protocol},

author = {Sherlia Shi and Marcel Waldvogel},

url = {https://netfuture.ch/wp-content/uploads/2000/shi00ratebased.pdf},

year  = {2000},

date = {2000-01-01},

urldate = {1000-01-01},

booktitle = {Proceedings of ISCC 2000},

pages = {678-686},

address = {Antibes, France},

abstract = {Current reliable multicast protocols do not have scalable congestion control mechanisms and this deficiency leads to concerns that multicast deployment may endanger stability of the network. In this paper, we present a sender-based approach for multicast congestion control targeted towards reliable bulk data transfer. We assume that there are a few bottleneck links in a large scale multicast group at any time period and these bottlenecks persist long enough to be identified and adapted to. Our work focus on dynamically identifying the worst congested path in the multicast tree and obtaining TCP-friendly throughput on this selected path. We devise novel selection (amongst receivers) and aggregation (over time) methods to achieve our goal. The response time of our protocol is then compatible to TCP once the worst path is identified. Only when switching between worst paths, the protocol response time is relaxed to multiple RTTs (less than 10) for the reasons of scalability and stability. We use the network simulator (NS2) to validate and evaluate our congestion control algorithm with both drop-tail and RED gateways. },

keywords = {Multicast, Quality of Service},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{Buddhikot1999Space,

title = {Space Decomposition Techniques for Fast Layer-4 Switching},

author = {Milind M. Buddhikot and Subhash Suri and Marcel Waldvogel},

editor = {Joseph D. Touch and James P. G. Sterbenz},

url = {https://netfuture.ch/wp-content/uploads/1999/buddhikot99space.pdf},

isbn = {0-7923-8690-6},

year  = {1999},

date = {1999-01-01},

urldate = {1000-01-01},

booktitle = {Protocols for High Speed Networks IV (Proceedings of PfHSN '99)},

pages = {25-41},

publisher = {Kluwer Academic Publishers},

address = {Salem, MA, USA},

abstract = { Packet classification is the problem of matching each incoming packet at a router against a database of filters, which specify forwarding rules for the packets. The filters are a powerful and uniform way to implement new network services such as firewalls, Network Address Translation (NAT), Virtual Private Networks (VPN), and per-flow or class-based Quality of Service (QOS) guarantees. While several schemes have been proposed recently that can perform packet classification at high speeds, none of them achieves fast worst-case time for adding or deleting filters from the database. In this paper, we present a new scheme, based on space decomposition, whose search time is comparable to the best existing schemes, but which also offers fast worst-case filter update time. The three key ideas in this algorithm are as follows: (1) innovative data-structure based on quadtrees for a hierarchical representation of the recursively decomposed search space, (2) fractional cascading and precomputation to improve packet classification time, and (3) prefix partitioning to improve update time. Depending on the actual requirements of the system this algorithm is deployed in, a single parameter can be used to tradeoff search time for update time. Also, this algorithm is amenable to fast software and hardware implementation.},

keywords = {Fast Routers, Quality of Service, Traffic Engineering},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{Srinivasan1998Fast,

title = {Fast and Scalable Layer Four Switching},

author = {V. Srinivasan and George Varghese and Subhash Suri and Marcel Waldvogel},

url = {https://netfuture.ch/wp-content/uploads/1998/srinivasan98fast.pdf},

year  = {1998},

date = {1998-09-01},

urldate = {1000-01-01},

booktitle = {Proceedings of ACM SIGCOMM},

pages = {191-202},

abstract = { In Layer Four switching, the route and resources allocated to a packet are determined by the destination address as well as other header fields of the packet such as source address, TCP and UDP port numbers. Layer Four switching unifies firewall processing, RSVP style resource reservation filters, QoS Routing, and normal unicast and multicast forwarding into a single framework. In this framework, the forwarding database of a router consists of a potentially large number of filters on key header fields. A given packet header can match multiple filters, so each filter is given a cost, and the packet is forwarded using the least cost matching filter. In this paper, we describe two new algorithms for solving the least cost matching filter problem at high speeds. Our first algorithm is based on a grid-of-tries construction and works optimally for processing filters consisting of two prefix fields (such as destination-source filters) using linear space. Our second algorithm, cross-producting, provides fast lookup times for arbitrary filters but potentially requires large storage. We describe a combination scheme that combines the advantages of both schemes. The combination scheme can be optimized to handle pure destination prefix filters in 4 memory accesses, destination-source filters in 8 memory accesses worst case, and all other filters in 11 memory accesses in the typical case.},

keywords = {Fast Routers, Hash Tables, Quality of Service},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{Waldvogel1998Scalable,

title = {Scalable Best Matching Prefix Lookups},

author = {Marcel Waldvogel and George Varghese and Jon Turner and Bernhard Plattner},

url = {https://netfuture.ch/wp-content/uploads/1998/waldvogel98scalable.pdf},

year  = {1998},

date = {1998-06-30},

urldate = {1000-01-01},

booktitle = {Proceedings of PODC '98},

pages = {311},

address = {Puerto Vallarta, México},

abstract = {All global routing protocols use hierarchies to allow scaling to a world wide community while keeping the routing database size manageable. Databases of variable length prefixes are a powerful tool for providing this in a flexible manner, but require a Longest Prefix Matching algorithm. In this paper, we report a fundamentally new solution that is both algorithmically interesting and practical.



Our scheme is based on doing binary search on hash tables organized by prefix lengths, and scales very well as address and routing table sizes increase: independent of the table size, it requires a worst case time of log_{2}(\textit{address bits}) hash lookups. With the current Internet Protocol, which uses 32 bit addresses, at most 5 hash lookups are needed; for the upcoming 128 bit addresses of the next generation Internet Protocol (IPv6), 7 lookups suffice. Several refinements, including specializing the Binary Search with every match, considerably reduce the average number of hash search steps to less than 2.},

keywords = {Fast Routers},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{Caronni1998Efficient,

title = {Efficient Security for Large and Dynamic Multicast Groups},

author = {Germano Caronni and Marcel Waldvogel and Dan Sun and Bernhard Plattner},

url = {https://netfuture.ch/wp-content/uploads/1998/caronni98efficient.pdf},

year  = {1998},

date = {1998-06-01},

urldate = {1000-01-01},

booktitle = {Proceedings of the IEEE 7th International Workshop on Enabling Technologies: Infrastructure for Collaborative Enterprises (WET ICE '98)},

address = {Palo Alto, CA, USA},

abstract = { Proposals for multicast security that have been published so far are complex, often require trust in network components or are inefficient. In this paper we propose a series of novel approaches for achieving scalable security in IP multicast, providing privacy and authentication on a group-wide basis. They can be employed to efficiently secure multi-party applications where members of highly dynamic groups of arbitrary size may participate. Supporting dynamic groups implies that newly joining members must not be able to understand past group communications, and that leaving members may not follow future communications. Key changes are required for all group members when a leave or join occurs, which poses a problem if groups are large. The algorithms presented here require no trust in third parties, support either centralized or fully distributed management of keying material, and have low complexity (O(log N) or less). This grants scalability even for large groups. },

keywords = {Multicast, Security},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{Waldvogel1997Scalable,

title = {Scalable High Speed IP Routing Table Lookups},

author = {Marcel Waldvogel and George Varghese and Jon Turner and Bernhard Plattner},

url = {https://netfuture.ch/wp-content/uploads/1997/waldvogel97scalable.pdf},

year  = {1997},

date = {1997-08-28},

urldate = {1000-01-01},

booktitle = {Proceedings of ACM SIGCOMM},

pages = {25-36},

abstract = {Internet address lookup is a challenging problem because of increasing routing table sizes, increased traffic, higher speed links, and the migration to 128 bit IPv6 addresses. IP routing lookup requires computing the best matching prefix, for which standard solutions like hashing were believed to be inapplicable. The best existing solution we know of, BSD radix tries, scales badly as IP moves to 128 bit addresses. Our paper describes a new algorithm for best matching prefix using binary search on hash tables organized by prefix lengths. Our scheme scales very well as address and routing table sizes increase: independent of the table size, it requires a worst case time of log_{2}(\textit{address bits}) hash lookups. Thus only 5 hash lookups are needed for IPv4 and 7 for IPv6. We also introduce Mutating Binary Search and other optimizations that, for a typical IPv4 backbone router with over 33,000 entries, considerably reduce the average number of hashes to less than 2, of which one hash can be simplified to an indexed array access. We expect similar average case behavior for IPv6.},

keywords = {Fast Routers, Hash Tables},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{Decasper1997Crossbow,

title = {Crossbow --- A Toolkit for Integrated Services over Cell Switched IPv6},

author = {Daniel S. Decasper and Marcel Waldvogel and Zubin Dittia and Adiseshu Hari and Guru Parulkar and Bernhard Plattner},

url = {https://netfuture.ch/wp-content/uploads/1997/decasper97crossbow.pdf},

year  = {1997},

date = {1997-05-01},

urldate = {1000-01-01},

booktitle = {Proceedings of the IEEE ATM '97 workshop},

address = {Lisboa, Portugal},

abstract = {The project Crossbow provides a framework to investigate services and mechanisms including resource management and packet scheduling for multimedia/multicast applications. In particular the Internet Protocol version 6 (IPv6, IP next generation, IPng) protocol suite on top of ATM is considered to demonstrate possible synergy between ATM and IPv6. The presented architecture includes IPv6 and RSVP, running on BSD Unix using the 1.2 Gbps APIC (ATM Port Interconnect Controller) chip, as well as support for Ethernet networks.},

keywords = {Fast Routers, Quality of Service},

pubstate = {published},

tppubtype = {inproceedings}

}