Competitive router scheduling with structured data

Theoretical Computer Science, Volume 530, 2014, Pages 12-22.

Cited by: 10|Bibtex|Views25|Links
EI
Keywords:
competitive router schedulingoverloaded communication linkwhole superpacketgeneral model encompasseson-line algorithmMore(7+)

Abstract:

We consider the task of transmitting structured information over bounded-capacity links. Our information model is a stream of basic units called superpackets that are broken into k packets each. To model the possible structure and redundancy of the superpackets, we assume that for each superpacket there is a collection of minimal subsets ...More

Code:

Data:

Your rating :
0

 

Tags
Comments