@incollection{furht_harmonic_2008,
	title = {Harmonic {Broadcasting} {Protocol}},
	copyright = {©2008 Springer-Verlag},
	isbn = {978-0-387-74724-8 978-0-387-78414-4},
	url = {http://link.springer.com/referenceworkentry/10.1007/978-0-387-78414-4_335},
	abstract = {DefinitionHarmonic broadcasting divides a video into equal-size segments.Harmonic broadcasting (HB) [1] was initiated to divide the video into N equal-size segments and transmit them into logical channels of decreasing bandwidth. As illustrated in Fig. 1, the ith videosegment is put on the ith channel with a bandwidth of C/i. Client starts receiving data from each segment stream after it begins to download the first segment of the video.Harmonic Broadcasting Protocol. Figure 1.Harmonic broadcasting protocol.Thus, the total bandwidth allocated for the video is given byBHB=∑i=1NCiBHB=∑i=1NCiB\_\{HB\} = {\textbackslash}sum{\textbackslash}limits\_\{i = 1\}{\textasciicircum}N \{\{C\} {\textbackslash}over \{i\}\} (1)When the client is ready to consume Si, it will have received i−1 slots of data from that segment and the last slot of that segment can be received during the segment playout time. If L is the length of the video, the start-up time THB is equal toTHB=LNTHB=LNT\_\{HB\} = \{L {\textbackslash}over N\} (2)The buffer requirement BufHB can be calculated by eqn. (3): ...},
	language = {en},
	urldate = {2016-05-03},
	booktitle = {Encyclopedia of {Multimedia}},
	publisher = {Springer US},
	editor = {Furht, Borko},
	year = {2008},
	note = {00000},
	pages = {280--280}
}

{"_id":"M7bCA8s4Awu9mzQHY","bibbaseid":"furht-harmonicbroadcastingprotocol-2008","authorIDs":[],"bibdata":{"bibtype":"incollection","type":"incollection","title":"Harmonic Broadcasting Protocol","copyright":"©2008 Springer-Verlag","isbn":"978-0-387-74724-8 978-0-387-78414-4","url":"http://link.springer.com/referenceworkentry/10.1007/978-0-387-78414-4_335","abstract":"DefinitionHarmonic broadcasting divides a video into equal-size segments.Harmonic broadcasting (HB) [1] was initiated to divide the video into N equal-size segments and transmit them into logical channels of decreasing bandwidth. As illustrated in Fig. 1, the ith videosegment is put on the ith channel with a bandwidth of C/i. Client starts receiving data from each segment stream after it begins to download the first segment of the video.Harmonic Broadcasting Protocol. Figure 1.Harmonic broadcasting protocol.Thus, the total bandwidth allocated for the video is given byBHB=∑i=1NCiBHB=∑i=1NCiB_\\HB\\ = \\textbackslashsum\\textbackslashlimits_\\i = 1\\\\textasciicircumN \\\\C\\ \\textbackslashover \\i\\\\ (1)When the client is ready to consume Si, it will have received i−1 slots of data from that segment and the last slot of that segment can be received during the segment playout time. If L is the length of the video, the start-up time THB is equal toTHB=LNTHB=LNT_\\HB\\ = \\L \\textbackslashover N\\ (2)The buffer requirement BufHB can be calculated by eqn. (3): ...","language":"en","urldate":"2016-05-03","booktitle":"Encyclopedia of Multimedia","publisher":"Springer US","editor":[{"propositions":[],"lastnames":["Furht"],"firstnames":["Borko"],"suffixes":[]}],"year":"2008","note":"00000","pages":"280–280","bibtex":"@incollection{furht_harmonic_2008,\n\ttitle = {Harmonic {Broadcasting} {Protocol}},\n\tcopyright = {©2008 Springer-Verlag},\n\tisbn = {978-0-387-74724-8 978-0-387-78414-4},\n\turl = {http://link.springer.com/referenceworkentry/10.1007/978-0-387-78414-4_335},\n\tabstract = {DefinitionHarmonic broadcasting divides a video into equal-size segments.Harmonic broadcasting (HB) [1] was initiated to divide the video into N equal-size segments and transmit them into logical channels of decreasing bandwidth. As illustrated in Fig. 1, the ith videosegment is put on the ith channel with a bandwidth of C/i. Client starts receiving data from each segment stream after it begins to download the first segment of the video.Harmonic Broadcasting Protocol. Figure 1.Harmonic broadcasting protocol.Thus, the total bandwidth allocated for the video is given byBHB=∑i=1NCiBHB=∑i=1NCiB\\_\\{HB\\} = {\\textbackslash}sum{\\textbackslash}limits\\_\\{i = 1\\}{\\textasciicircum}N \\{\\{C\\} {\\textbackslash}over \\{i\\}\\} (1)When the client is ready to consume Si, it will have received i−1 slots of data from that segment and the last slot of that segment can be received during the segment playout time. If L is the length of the video, the start-up time THB is equal toTHB=LNTHB=LNT\\_\\{HB\\} = \\{L {\\textbackslash}over N\\} (2)The buffer requirement BufHB can be calculated by eqn. (3): ...},\n\tlanguage = {en},\n\turldate = {2016-05-03},\n\tbooktitle = {Encyclopedia of {Multimedia}},\n\tpublisher = {Springer US},\n\teditor = {Furht, Borko},\n\tyear = {2008},\n\tnote = {00000},\n\tpages = {280--280}\n}\n\n","editor_short":["Furht, B."],"key":"furht_harmonic_2008","id":"furht_harmonic_2008","bibbaseid":"furht-harmonicbroadcastingprotocol-2008","role":"editor","urls":{"Paper":"http://link.springer.com/referenceworkentry/10.1007/978-0-387-78414-4_335"},"downloads":0,"html":""},"bibtype":"incollection","biburl":"http://www.telemidia.puc-rio.br/~alan/files/all.bib","creationDate":"2020-03-03T14:08:14.599Z","downloads":0,"keywords":[],"search_terms":["harmonic","broadcasting","protocol"],"title":"Harmonic Broadcasting Protocol","year":2008,"dataSources":["jAxurbvLP8q5LTdLa"]}