Concept

Round-robin (informatique)

Publications associées (67)

Correlation-Aware Packet Scheduling in Multi-Camera Networks

Pascal Frossard, Thomas Maugey, Laura Toni

In multiview applications, multiple cameras acquire the same scene from different viewpoints and produce correlated video streams. This results in large amounts of highly redundant data. In order to save resources, it is critical to handle properly this co ...

Ieee-Inst Electrical Electronics Engineers Inc2014

Packet Scheduling in Multicamera Capture Systems

Pascal Frossard, Thomas Maugey, Laura Toni

In multiview video services, multiple cameras acquire the same scene from different perspectives, which results in correlated video streams. This generates large amounts of highly redundant data, which need to be properly handled during encoding and transm ...

2014

An effective mathematical formulation for the unidirectional cluster-based quay crane scheduling problem

Jingmin Chen

The quay crane scheduling problem plays an important role in the paradigm of port container terminal management, due to the fact that it closely relates to vessel berthing time. In this paper, we focus on the study of a special strategy for the cluster-bas ...

Elsevier Science Bv2014

Decentralized list scheduling

Nicolas Gabriel Gast, Denis Trystram

Classical list scheduling is a very popular and efficient technique for scheduling jobs for parallel and distributed platforms. It is inherently centralized. However, with the increasing number of processors, the cost for managing a single centralized list ...

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

Zeta: Scheduling Interactive Services with Partial Execution

James Richard Larus, Sameh Mohamed Elnikety, Chenyu Yan

This paper presents a scheduling model for a class of interactive services in which requests are time bounded and lower result quality can be traded for shorter execution time. These applications include web search engines, finance servers, and other inter ...

ACM2012

Multi-path content delivery: Efficiency analysis and optimization algorithms

The paper studies the benefits of multi-path content delivery from a rate-distortion efficiency perspective. We develop an optimization framework for computing transmission schedules for streaming media packets over multiple network paths that maximize the ...

Academic Press Inc Elsevier Science2012

Correlation-aware packet scheduling for multi-camera streaming

Pascal Frossard, Thomas Maugey, Laura Toni

In multi-view applications, multiple cameras acquire the same scene from different perspectives, which results in correlated video streams. It becomes important to exploit this correlation at the acquisition side (i.e., in the source coding) or at the rece ...

2012

Simple schedules for half-duplex networks

Christina Fragouli, Siddhartha Brahma

We consider the diamond network where a source communicates with the destination through N non-interfering half-duplex relays. Deriving a simple approximation to the capacity of the network, we show that simple schedules having exactly two states and avoid ...

Ieee2012

Exploiting the Path Propagation Time Differences in Multipath Transmission with FEC

Maciej Kurant

We consider a transmission of a delay-sensitive data stream (e. g., a video call) from a single source to a single destination. The reliability of this transmission may suffer from bursty packet losses - the predominant type of failures in today's Internet ...

2011

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