2013 IEEE 12th International Symposium on Network Computing and Applications 2013
DOI: 10.1109/nca.2013.46
|View full text |Cite
|
Sign up to set email alerts
|

Media Streams Planning with Transcoding

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
7
0

Year Published

2014
2014
2017
2017

Publication Types

Select...
4
1

Relationship

1
4

Authors

Journals

citations
Cited by 5 publications
(7 citation statements)
references
References 28 publications
0
7
0
Order By: Relevance
“…9: for each logical link l ∈ L L do 10: loadLimit l = min h∈physical(l) (loadLimit h ) 11: for each application node v ∈ V A do 12: calculate load v,res of each resource by all streams 13: nodeOverload v = max(max res∈Res (load v,res ), 1) Calculation of loads and limits on physical links (Ln. 4) requires O( L H · S ) time.…”
Section: B Main Algorithm Loopmentioning
confidence: 99%
See 4 more Smart Citations
“…9: for each logical link l ∈ L L do 10: loadLimit l = min h∈physical(l) (loadLimit h ) 11: for each application node v ∈ V A do 12: calculate load v,res of each resource by all streams 13: nodeOverload v = max(max res∈Res (load v,res ), 1) Calculation of loads and limits on physical links (Ln. 4) requires O( L H · S ) time.…”
Section: B Main Algorithm Loopmentioning
confidence: 99%
“…Average results from the 600 runs are shown in Table I solution, and it was always found within one second. In our previous work [11], we could solve the problem for 11 sites in 1:n scheme and 7 sites in m:n scheme, but we needed 5 seconds to do so.…”
Section: Experimental Evaluationmentioning
confidence: 99%
See 3 more Smart Citations