@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{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{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{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{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{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}

}