The platform will undergo maintenance on Sep 14 at about 9:30 AM EST and will be unavailable for approximately 1 hour.
2009
DOI: 10.1109/tbc.2009.2020955
|View full text |Cite
|
Sign up to set email alerts
|

A Broadcasting Scheme for Selective Contents Considering Available Bandwidth

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
21
0

Year Published

2010
2010
2022
2022

Publication Types

Select...
5
4

Relationship

0
9

Authors

Journals

citations
Cited by 37 publications
(21 citation statements)
references
References 15 publications
0
21
0
Order By: Relevance
“…Generally, since users play several contents sequentially, state transition graphs are suitable to describe the sequence. In conventional methods, we have proposed a play-sequence graph to describe the structures of selective contents [3]. Here, we explain the play-sequence graph.…”
Section: Selective Contentsmentioning
confidence: 99%
“…Generally, since users play several contents sequentially, state transition graphs are suitable to describe the sequence. In conventional methods, we have proposed a play-sequence graph to describe the structures of selective contents [3]. Here, we explain the play-sequence graph.…”
Section: Selective Contentsmentioning
confidence: 99%
“…Contents Cumulated Broadcasting Considering Bandwidth (CCB-CB) method [15] reduces waiting time effectively by acquiring bandwidth identical to the data consumption rate.…”
Section: Related Workmentioning
confidence: 99%
“…As described above, several methods have been proposed to reduce interruption time [10]. However, no method exists in which a broadcast schedule is produced that considers data reception by telecommunication.…”
Section: Related Workmentioning
confidence: 99%