In this thesis, we propose two mechanisms, stream splitting and merging, to fully utilize the bandwidth in a mixed wired and wireless network. The two mechanisms implemented on a SVC Streaming Gateway (SSG) mainly exploit the characteristics of multi-layer SVC (Scalable Video Coding). In the stream splitting mechanism, the available bandwidth can be calculated on SSG, so that an adequate number of layers of a SVC stream can be determined for splitting. In the stream merging mechanism, when the available bandwidth is increased, a stream with more number of enhancement layers can be extracted to merge onto a stream with less number of layers. Additionally, when two streams pass through SSG concurrently, one stream may arrive at SSG faster due to different traffic conditions. If one stream with more SVC layers is faster than the one with less SVC layers, we buffer the packets of the faster stream on SSG, so that the buffered packets can be merged to the top of SVC layers of the slow stream. On the other hand, if one stream with more SVC layers is slower than the one with less SVC layers, to effectively merge the enhancement layers of the slow stream onto the faster stream, SSG will delay the packets of the faster stream to wait for the packets of the slow stream. Finally, we implement these two mechanisms on the Linux platform. In the experiments, we measure buffer delay, queue length, and the number of merged packets to demonstrate that the two proposed mechanisms can effectively improve the picture freeze-up and mosaic phenominon.
| Identifer | oai:union.ndltd.org:NSYSU/oai:NSYSU:etd-0701110-203534 |
| Date | 01 July 2010 |
| Creators | Hsieh, Yi-Chuen |
| Contributors | Chia-Hung Yeh, Tsung-Chuan Huang, Wei-Kuang Lai, Tsang-Ling Sheu, Zi-Tsan Chou |
| Publisher | NSYSU |
| Source Sets | NSYSU Electronic Thesis and Dissertation Archive |
| Language | Cholon |
| Detected Language | English |
| Type | text |
| Format | application/pdf |
| Source | http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0701110-203534 |
| Rights | restricted, Copyright information available at source archive |
Page generated in 0.0017 seconds