Quality assurance of streaming data dissemination over p2p network
碩士 === 國立政治大學 === 資訊科學學系 === 98 === Numerous new network services arise with the advanced development of network technologies, such as real-time multimedia streaming services. But challenges to network environment come along with the enormous traffic of data flows and rigorous restriction to transm...
Main Authors: | , |
---|---|
Other Authors: | |
Format: | Others |
Language: | en_US |
Published: |
2009
|
Online Access: | http://ndltd.ncl.edu.tw/handle/52884648867925914992 |
id |
ndltd-TW-098NCCU5394021 |
---|---|
record_format |
oai_dc |
spelling |
ndltd-TW-098NCCU53940212015-10-13T18:20:58Z http://ndltd.ncl.edu.tw/handle/52884648867925914992 Quality assurance of streaming data dissemination over p2p network 在點對點網路上針對串流資料傳播的品質保證 Chiu, Wei Chung 邱威中 碩士 國立政治大學 資訊科學學系 98 Numerous new network services arise with the advanced development of network technologies, such as real-time multimedia streaming services. But challenges to network environment come along with the enormous traffic of data flows and rigorous restriction to transmission delay of real-time multimedia streaming services. Under this circumstance, conventional server-client topology suffers from serious packet loss and packet delay due to the overload of servers and their accessing links. Also, extra transmission delay may make packets fail to meet the requirement of real-timed services. Peer-to-peer network is more scalable than server-client model, and is much more tolerable to the transmission errors caused by node or link failures. More importantly, it effectively distributes load from the server to peers. As a consequence, peer-to-peer service architecture becomes very popular for real-time multimedia streaming services recently. Peer-to-peer networks are mostly formed in random fashion. As the size of network grows, packets may have to travel through numerous links to reach far-end receivers. The quality of data may be damaged by insufficient bandwidth of links. For real-time multimedia services, it is not acceptable to users if the cumulated packet delay exceeds a tolerable limit. Our research is trying to find a better topology to transmit multimedia data flows which makes the cumulated delay of the most-far-end user be tolerable and the damage of data quality is minimized. The problem is modeled as a MLDST problem, which is a NP-Complete problem. To solve the problem, we modified Dijkstra’s single-source shortest-path algorithm by bounding the node degree and adding delay constraint. The experiments were carried out on real network environment through PlanetLab. Experiments show that our algorithm outperforms traditional MST and shortest path spanning tree. Lien, Yao Nan 連耀南 2009 學位論文 ; thesis 46 en_US |
collection |
NDLTD |
language |
en_US |
format |
Others
|
sources |
NDLTD |
description |
碩士 === 國立政治大學 === 資訊科學學系 === 98 === Numerous new network services arise with the advanced development of network technologies, such as real-time multimedia streaming services. But challenges to network environment come along with the enormous traffic of data flows and rigorous restriction to transmission delay of real-time multimedia streaming services. Under this circumstance, conventional server-client topology suffers from serious packet loss and packet delay due to the overload of servers and their accessing links. Also, extra transmission delay may make packets fail to meet the requirement of real-timed services. Peer-to-peer network is more scalable than server-client model, and is much more tolerable to the transmission errors caused by node or link failures. More importantly, it effectively distributes load from the server to peers. As a consequence, peer-to-peer service architecture becomes very popular for real-time multimedia streaming services recently.
Peer-to-peer networks are mostly formed in random fashion. As the size of network grows, packets may have to travel through numerous links to reach far-end receivers. The quality of data may be damaged by insufficient bandwidth of links. For real-time multimedia services, it is not acceptable to users if the cumulated packet delay exceeds a tolerable limit.
Our research is trying to find a better topology to transmit multimedia data flows which makes the cumulated delay of the most-far-end user be tolerable and the damage of data quality is minimized. The problem is modeled as a MLDST problem, which is a NP-Complete problem. To solve the problem, we modified Dijkstra’s single-source shortest-path algorithm by bounding the node degree and adding delay constraint. The experiments were carried out on real network environment through PlanetLab. Experiments show that our algorithm outperforms traditional MST and shortest path spanning tree.
|
author2 |
Lien, Yao Nan |
author_facet |
Lien, Yao Nan Chiu, Wei Chung 邱威中 |
author |
Chiu, Wei Chung 邱威中 |
spellingShingle |
Chiu, Wei Chung 邱威中 Quality assurance of streaming data dissemination over p2p network |
author_sort |
Chiu, Wei Chung |
title |
Quality assurance of streaming data dissemination over p2p network |
title_short |
Quality assurance of streaming data dissemination over p2p network |
title_full |
Quality assurance of streaming data dissemination over p2p network |
title_fullStr |
Quality assurance of streaming data dissemination over p2p network |
title_full_unstemmed |
Quality assurance of streaming data dissemination over p2p network |
title_sort |
quality assurance of streaming data dissemination over p2p network |
publishDate |
2009 |
url |
http://ndltd.ncl.edu.tw/handle/52884648867925914992 |
work_keys_str_mv |
AT chiuweichung qualityassuranceofstreamingdatadisseminationoverp2pnetwork AT qiūwēizhōng qualityassuranceofstreamingdatadisseminationoverp2pnetwork AT chiuweichung zàidiǎnduìdiǎnwǎnglùshàngzhēnduìchuànliúzīliàochuánbōdepǐnzhìbǎozhèng AT qiūwēizhōng zàidiǎnduìdiǎnwǎnglùshàngzhēnduìchuànliúzīliàochuánbōdepǐnzhìbǎozhèng |
_version_ |
1718030434058633216 |