Concept

Packet switching

Related publications (457)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Switch Detection in Genetic Regulatory Networks

Giancarlo Ferrari Trecate

This paper considers piecewise affine models of genetic regulatory networks and focuses on the problem of detecting switches among different modes of operation in gene expression data. This task constitutes the first step of a procedure for the complete id ...

Springer-Verlag2007

Least-Cost Opportunistic Routing

Martin Vetterli, Matthias Grossglauser, Henri Julien Dubois-Ferrière

In opportunistic routing, each node maintains a group of candidate relays to reach a particular destination, and transmits packets to any node in this group. If a single candidate relay receives the packet, it becomes the effective relay to forward the pac ...

2007

Adaptive media streaming over multipath networks

Dan Jurca

With the latest developments in video coding technology and fast deployment of end-user broadband internet connections, real-time media applications become increasingly interesting for both private users and businesses. However, the internet remains a best ...

EPFL2007

Exact Capacity Scaling of Extended Wireless Networks

Olivier Lévêque, Ayfer Özgür Aydin

n source and destination pairs randomly located in an area extending linearly with n want to communicate with each other. Signals transmitted from one user to another at distance r apart are subject to a power attenuation of r^{-alpha} and random phase cha ...

2007

Bottleneck Discovery and Overlay Management in Network Coded Peer-to-Peer Systems

Christina Fragouli, Suhas Diggavi

The performance of peer-to-peer (P2P) networks depends critically on the good connectivity of the overlay topology. In this paper we study P2P networks for content distribution (such as Avalanche) that use randomized network coding techniques. The basic id ...

2007

Packet Media Streaming with Imprecise Rate Estimation

Pascal Frossard, Dan Jurca

We address the problem of delay-constrained streaming of multimedia packets over dynamic bandwidth channels. Efficient streaming solutions generally rely on the knowledge of the channel bandwidth, in order to select the media packets to be transmitted, acc ...

2007

An Accountability Interface for the Internet

Olga Irzak

The Internet provides no information on the fate of transmitted packets, and end systems cannot determine who is responsible for dropping or delaying their traffic. As a result, they cannot verify that their ISPs are honoring their service level agreements ...

2007

Loss and Delay Accountability for the Internet

Olga Irzak

2007

Non-cooperative behavior in wireless networks

Mark Felegyhazi

Existing cellular networks are centrally managed and require a tremendous initial investment. With the advancement of new wireless technologies, the operators of traditional networks have to face new competition. New technologies make it possible to provid ...

EPFL2007

Least-Cost Opportunistic Routing

Martin Vetterli, Matthias Grossglauser, Henri Julien Dubois-Ferrière

In opportunistic routing, each node maintains a group of candidate next-hops to reach a particular destination, and transmits packets to any node in this group. The choice of candidate next-hops at each node is a key question that is central to the perform ...

2007