Name
Abstract | ||
|---|---|---|
In this paper we study the video streaming bandwidth of peer-to-peer streaming networks where the underlying topology is a complex network. We focus on the maximal streaming rate and how it depends on the type of network. We consider networks such as small world networks, scale free networks, locally connected networks and random networks. The experimental results indicate that a more connected graph does not necessarily imply a higher streaming rate, whereas properties such as the existence of a Hamiltonian path from the source do. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1109/ISCAS.2009.5118080 | Taipei |
Keywords | Field | DocType |
bandwidth allocation,complex networks,graph theory,peer-to-peer computing,random processes,telecommunication network topology,video streaming,Hamiltonian path,bandwidth allocation,complex network topology,graph theory,locally connected network,peer-to-peer video streaming,random network,scale free network,small world network | Random graph,Tree (graph theory),Peer-to-peer,Computer science,Small-world network,Evolving networks,Computer network,Network topology,Scale-free network,Complex network,Distributed computing | Conference |
ISBN | Citations | PageRank |
978-1-4244-3828-0 | 0 | 0.34 |
References | Authors | |
6 | 8 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Lyrial Chism | 1 | 0 | 0.34 |
| Xiaoqing He | 2 | 0 | 0.34 |
| Liquan Huang | 3 | 1 | 0.96 |
| Ashraf Ibrahim | 4 | 0 | 0.34 |
| Christopher Jones | 5 | 0 | 0.34 |
| Yan Shu | 6 | 0 | 0.34 |
| Chai Wah Wu | 7 | 330 | 67.62 |
| Zhenghua Fu | 8 | 575 | 44.56 |