Concept

QUIC

Publications associées (34)

MPTCP Is Not Pareto-Optimal: Performance Issues and a Possible Solution

Jean-Yves Le Boudec, Nicolas Gabriel Gast, Ramin Khalili, Miroslav Popovic

Multipath TCP (MPTCP) has been proposed recently as a mechanism for transparently supporting multiple connections to the application layer. It is under discussion at the IETF. We nevertheless demonstrate that the current MPTCP suffers from two problems: P1 ...

Ieee-Inst Electrical Electronics Engineers Inc2013

Is the Network Turing-Complete?

Dejan Kostic, Peter Peresini

Ensuring correct network behavior is hard. This is the case even for simple networks, and adding middleboxes only complicates this task. In this paper, we demonstrate a fundamental property of networks. Namely, we show a way of using a network to emulate t ...

2013

Low cost security for sensor networks

Christina Fragouli, Lorenzo Keller, Iris Safaka, Emre Atsan

We design and evaluate a lightweight encryption protocol suitable for sensor networks, that enables weak security in the presence of passive eavesdroppers. At every communication round, our protocol creates a key between each sensor node and the sink, by a ...

Institute of Electrical and Electronics Engineers Inc.2013

Adaptive Multiview Video Streaming: Challenges and Opportunities

Delivering multiview video content over present packet networks poses multiple challenges. First, the best effort nature of the Internet exposes media packets to variable bandwidth, loss, and delay as they traverse the network. Second, the prediction depen ...

Ieee-Inst Electrical Electronics Engineers Inc2013

MPTCP is not Pareto-Optimal: Performance Issues and a Possible Solution

Jean-Yves Le Boudec, Nicolas Gabriel Gast, Ramin Khalili, Utkarsh Upadhyay, Miroslav Popovic

MPTCP has been proposed recently as a mechanism for sup- porting transparently multiple connections to the applica- tion layer. It is under discussion at the IETF. We show, however, that the current MPTCP suffers from two prob- lems: (P1) Upgrading some TC ...

2012

Non-Pareto Optimality of MPTCP: Performance Issues and a Possible Solution

Jean-Yves Le Boudec, Nicolas Gabriel Gast, Ramin Khalili, Utkarsh Upadhyay, Miroslav Popovic

MPTCP has been proposed as a mechanism to support transparently multiple connections to the application layer and is under discussion at the IETF. It can use effectively the available bandwidth and it improves throughput and fairness, compared to independe ...

2012

Empirical Performance Evaluation of Data Dissemination Mechanisms for Spot Applications

Jean-Yves Le Boudec, Alaeddine El Fawal, Adel Aziz

We evaluate, by measurements on a real testbed, the performance of networking services required for spot applications. We call a “spot application” an application for smartphones (such as “Ad-hoc Flash Sales”) that disseminates information in a local neigh ...

2012

Relational network-service clustering analysis with set evidences

Boi Faltings, Li Pu

Network administrators are faced with a large amount of network data that they need to sift through to analyze user behaviors and detect anomalies. Through a network monitoring tool, we obtained TCP and UDP connection records together with additional infor ...

2010

One Bit Is Enough: a Framework for Deploying Explicit Feedback Congestion Control Protocols

Dejan Kostic, Nedeljko Vasic

Since the bandwidth-delay products of Internet links keep increasing, issues with TCP's convergence time, throughput, and amount of queuing in these environments are becoming more pressing. As we move toward the next-generation Internet, it is important to ...

2009

ProtoPeer: from Simulation to Live Deployment in One Step

Karl Aberer, Wojciech Galuba, Zoran Despotovic

We present ProtoPeer, a peer-to-peer systems prototyping toolkit that allows for switching between the event driven simulation and live network deployment without changing any of the application code. ProtoPeer exports a set of APIs for message passing, me ...

2008

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search