zbMATH — the first resource for mathematics

Geometry Search for the term Geometry in any field. Queries are case-independent.
Funct* Wildcard queries are specified by * (e.g. functions, functorial, etc.). Otherwise the search is exact.
"Topological group" Phrases (multi-words) should be set in "straight quotation marks".
au: Bourbaki & ti: Algebra Search for author and title. The and-operator & is default and can be omitted.
Chebyshev | Tschebyscheff The or-operator | allows to search for Chebyshev or Tschebyscheff.
"Quasi* map*" py: 1989 The resulting documents have publication year 1989.
so: Eur* J* Mat* Soc* cc: 14 Search for publications in a particular source with a Mathematics Subject Classification code (cc) in 14.
"Partial diff* eq*" ! elliptic The not-operator ! eliminates all results containing the word elliptic.
dt: b & au: Hilbert The document type is set to books; alternatively: j for journal articles, a for book articles.
py: 2000-2015 cc: (94A | 11T) Number ranges are accepted. Terms can be grouped within (parentheses).
la: chinese Find documents in a given language. ISO 639-1 language codes can also be used.

a & b logic and
a | b logic or
!ab logic not
abc* right wildcard
"ab c" phrase
(ab c) parentheses
any anywhere an internal document identifier
au author, editor ai internal author identifier
ti title la language
so source ab review, abstract
py publication year rv reviewer
cc MSC code ut uncontrolled term
dt document type (j: journal article; b: book; a: book article)
SingBroad: A scheduling scheme for broadcasting continuous multimedia data over a single channel. (English) Zbl 1188.68082
Summary: This work proposes a SingBroad protocol for broadcasting continuous multimedia data over a single channel. Let us consider a channel with bandwidth $a\cdot b$ Mbps where $a$ is a positive integer and $b$ Mbps is the same as the normal playback rate. The SingBroad protocol first divides a video with time length $L$ into $2^{a-1}-1$ equal-length segments and broadcasts these segments over the given single channel. The average waiting time of the SingBroad protocol is $L/(2a(2^{a-1}-1)/(a-1))$ and the buffer requirement is $((1+1/a)\cdot 2^{a-2}-1)/(2^{a-1}-1)$ of a video size. In terms of the average waiting time and the maximum buffer requirement, the SingBroad method outperforms the alternative broadcasting method when utilizing the same single channel.
68M20Performance evaluation of computer systems; queueing; scheduling
68M10Network design and communication of computer systems
Full Text: DOI