In this thesis, a new live video broadcasting service, called LIVING, is introduced. And we find that ALM is a good solution to realize this service. However, because LIVING runs in mobile environment, there exist some mobility problems which make ALM systems unstable.
To minimize the impacts of mobility, we analyze and describe the problem in mathematics form. Then, a system design is proposed based on issues users may concern. The simulations show that our design is scalable and suitable for different proportion of mobile nodes. What’s more, some parameters are evaluated and the results help us decide appropriate parameter values in the system. Finally, we implement the system on Java platform and ITRI PCA respectively. It performs well and we conclude that this service is interesting and practicable.
Although LIVING performs well, there are interesting topics left for future work. First, we have to consider the lack of CPU computation power, memory or power supply on low level mobile devices. It is important to improve the performance so that LIVING can work well on these devices. What’s more, the combination of LIVING and IM (Instant Messaging) is an attractive application. When we login IM, real-time live videos can be seen directly from friends list. That will make LIVING more convenient and easier to use. Additionally, there are other exciting applications we can or cannot imagine, such as personal real-time live TV stations, real-time live 3D baseball games, etc. We believe that the age of LIVING is coming, and LIVING is living in the living world!
- 42 -
參 考 文 獻
[1] A. Ganjam, H. Zhang, “Internet Multicast Video Delivery,” the IEEE, 2005.
[2] X. Hei, C. Liang, J. Liang, Y. Liu, K. W. Ross, “A Measurement Study of a Large-Scale P2P IPTV System,” IPTV Workshop, International World Wide Web Conference, 2006.
[3] Napster, <http://www.napster.com/>.
[4] Gnutella.com, <http://www.gnutella.com/>.
[5] I. Stoica, R. Morris, D. Karger, M. F. Kaashoek, and H. Balakrishnan, “Chord: A scalable peer-to-peer lookup service for Internet applications,” ACM SIGCOMM San Diego, CA, Aug. 2001.
[6] S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker, “A scalable content-addressable network,” ACM SIGCOMM, San Diego, CA, Aug. 2001, pp.
161–172.
[7] S. Deering, "Multicast routing in internetworks and extended LANs," ACM SIGCOMM, Aug. 1988.
[8] Internet Group Management Protocol, RFC 1112, RFC 2236.
[9] Distance Vector Multicast Routing Protocol, RFC 1075.
[10] Protocol Independent Multicast, RFC 2362, RFC 3973.
[11] P. Francis, “Yoid: Extending the Internet multicast architecture,”
<http://www.icir.org/yoid/>, 2000.
[12] Y. Chu, S. G. Rao, H. Zhang, “A case for end system multicast,” ACM SIGMETRICS, 2000.
[13] J. Jannotti, D. Gifford, K. L. Johnson, M. F. Kaashoek, and J. W. O'Toole, Jr., “Overcast:
Reliable multicasting with an overlay network,” OSDI, 2000.
[14] L. Mathy, R. Canonico, D. Hutchison, “An overlay tree building control protocol,” Intl.
workshop on Networked Group Communication, 2001.
[15] S. Ratnasamy, M. Handley, R. Karp, S. Shenker, “Application-level multicast using content-addressable networks,” NGC, 2001.
[16] D. A. Helder, S. Jamin, “End-host multicast communication using switch-trees protocols,” GP2PC, 2002.
[17] B. Zhang, S. Jamin, L. Zhang, “Host multicast: A framework for delivering multicast to end users,” IEEE INFOCOM, 2002.
[18] S. Banerjee, Bobby Bhattacharjee, C. Kommareddy, “Scalable application layer
- 43 -
multicast,” ACM SIGCOMM, Pittsburgh, PA, 2002.
[19] D. Tran, K. Hua, T. Do, “ZIGZAG: An Efficient Peer-to-Peer Scheme for Media Streaming,” tech. rep. Orlondo: Univ. Central FL, CS-UCF 2002, 2002.
[20] V. N. Padmanabhan, H. J. Wang, P. A. Chou. “Resilient Peer-to-Peer Streaming,”
Technical Report MSR-TR-2003-11, Microsoft Research, Redmond, WA, 2003.
[21] S. Banerjee, B. Bhattacharjee, “A comparative study of application layer multicast protocols,” unpublished report.
[22] A. El-Sayed, V. Roca, L. Mathy, “A survey of protocols for an alternative group communication service,” IEEE Network, 2003.
[23] C. Abad, W. Yurcik, R. H. Campbell, “A survey and comparison of end-system overlay multicast solutions suitable for network centric warfare,” SPIE, 2004.
[24] S. W. Tan, G. Waters, J. Crawford, “A performance comparison of self-organising application layer multicast overlay construction techniques,” Computer Communications, 2006.
[25] J. Konemann, “Approximation Algorithms for Minimum-cost Low-degree Subgraphs,”
PhD Thesis (Computer Science). CMU, 2003.
[26] S. Y. Shi, J. S. Turner, M. Waldvogel, “Dimensioning server access bandwidth and multicast routing in overlay networks,” Proc. NOSSDAV, 2001.
[27] N. M. Malouch, Z. Liu, D. Rubenstein, S. Sahu, “A graph theoretical approach to bounding delay in proxy-assisted, end-system multicast,” Proc. IWQoS, 2002.
[28] K. Albrecht, R. Arnold, M. Gahwiler, R. Wattenhofer, “Aggregating Information in Peer-to-Peer Systems for Improved Join and Leave,” Proc. of the Fourth International Conference on Peer-to-Peer Computing (P2P'04), 2004.
[29] National Center for High-Performance Computing, Taiwan Advanced Research &
Education Network, Network Operation Center <http://noc.twaren.net/>.
[30] The PC Guide <http://www.pcguide.com/ref/ram/timingAccess-c.html>.
[31] C. Faloutsos, P. Faloutsos, M. Faloutsos, “On power-law relationships of the internet topology,” ACM SIGCOMM, 1999.
[32] J. Winick, C. Jin, Q. Chen, S. Jamin, Inet Topology Generator, available from:
<http://topology.eecs.umich.edu/inet/>.
[33] T. Camp, J. Boleng, V. Davies “A survey of mobility models for ad hoc network research,” Wireless Communications and Mobile Computing, 2002.
[34] N. Banerjee, W. Wu, S.K. Das, “Mobility Support in Wireless Internet”, IEEE Wireless
- 44 -
Communications, 2003.
[35] S. Y. Shi, J. S. Turner, M. Waldvogel, “Dimensioning server access bandwidth and multicast routing in overlay networks,” 11th International Workshop on Network and Operating Systems Support for Digital Audio and Video (NOSSDAV), 2001.
[36] IETF SIP working group, <http://www.ietf.org/html.charters/sip-charter.html>.
- 45 -
- 46 -
自 傳
黃名杰，成功大學資訊工程系學士，現就讀交通大學資訊科學與工程研究 所，主要的研究興趣為點對點同儕網路（Peer-to-Peer Networks）。