English  |  正體中文  |  简体中文  |  Items with full text/Total items : 66984/66984 (100%)
Visitors : 23028584      Online Users : 497
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version


    Please use this identifier to cite or link to this item: http://ir.lib.ncu.edu.tw/handle/987654321/8392


    Title: 具遲到者支援功能之網際網路簡報系統;The Telepresentation System over Internet with Latecomers Support
    Authors: 楊政遠;Zeng-Yuan Yang
    Contributors: 資訊工程研究所
    Keywords: 即時媒體通訊協定;數位媒體廣播;網路排程;頻寬利用;最佳熱門電影廣播演算法;現場直播之遲到者支援;IP群播;網路簡報系統;Scalable binomial broadcasting scheme;Live harmonic broadcasting scheme;Live;Optimal hot VOD broadcasting scheme;Recast-on-recording model;Live telepresentation with latecomers support;Real-time transport protocol (RTP);IP multicasting;Telepresentation system
    Date: 2000-07-05
    Issue Date: 2009-09-22 11:25:46 (UTC+8)
    Publisher: 國立中央大學圖書館
    Abstract: 今日先進的網際網路網路簡報系統已成為方便的知識傳播工具。聽眾可以在不同的地點收看及時的網路簡報,或是用隨選點播的方式來收看已儲存的網路簡報。然現今的系統皆無法支援網路簡報之遲到者。網路簡報的遲到者所遭遇的困擾一如上課遲到者一般,遲到者將無法完整的參與會議。所以,我們將在本論文中提出新的 recast-on-recording 模型來解決遲到者問題;同時,我們的recast-on-recording模型可以涵蓋四種不同型態的網路簡報應用。 我們所採用的方法是運用計算機同步處理數位媒體資料的能力,將正在錄影的現場網路簡報,從頭開始播放給遲到者。對遲到者而言,我們的recast-on-recording 模型就如同專為每一個遲到者舉行私人的簡報。對於提供遲到者服務的系統而言,為每一位遲到者提供單一的網路簡報的行為,和提供熱門視訊服務的伺服器的存取行為雷同。因此,我們相信熱門隨選視訊服務的研究將提供本研究的良好基礎,並認知我們研究的重心在於如何更有效率地對有限的資源加以運用。於此,在本論文中我們用演繹的方法推論了harmonic broadcasting scheme 是相同的平均等待時間下的最省網路頻寬的熱門隨選視訊的廣播演算法。然而,現場直播節目的媒體特性相異於已儲存的影片;現今,並沒有任一種已經發展的廣播演算法可以完全的解決現場直播節目的再廣播的問題。所以我們提出time skew scheduling 與 scalable cycling 兩種策略來解決上述之問題,並因此發展出新的scalable binomial broadcasting scheme演算法來處理現場直播節目的遲到者問題。 在本論文中我們提出三層式的系統架構來實現recast-on-recording 模型,此三層式的系統架構除了可以提高系統的可擴充性外亦節省了長途通訊的費用。為了驗證recast-on-recording 模型的可行性,我們在Microsoft 的Win32平台上實現了我們的系統 ─ Listener。Listener 運用了frames/samples interleaves 的技術在共享式的序列傳輸實體網路媒體上模擬出平行且獨佔的通道觀念,並用網際網路的IP multicasting的機制在廣域的TCP/IP網路上模擬出廣播的通訊型態。現今,我們的系統原形採用了fast data 的廣播演算法來提供即時、隨選的網路簡報服務,其效能實驗的實測結果將附在本論文中。 Nowadays, the mature Internet infrastructure makes the telepresentation as being a feasible daily routine. People attend to live telepresentation or retrieve the recorded presentation from video server on-demand. However, due to many reasons, people may be late to join in the scheduled live telepresentation. We, therefore, propose a recast-on-recording model and hierarchical architecture to solve this problem and mitigate the gap between four, independent application domains of telepresentation dimension. Under our recast-on-recording model, the system provides a distinct, partially recorded, copy of on-going live telepresentation from the beginning to every latecomer. These recasting operations are similar to the behaviors of a VOD server providing popular movie services. After investigating VOD researches, we recognize our essential issue is how to schedule resources of system and network more efficiently. We, therefore, first dedicate ourselves to pursuit the lowest bound of bandwidth requirements of cyclical broadcasting scheme for popular video services. Our deductions, in an analytical manner, are based on the basic restriction of stream media
    Appears in Collections:[資訊工程研究所] 博碩士論文

    Files in This Item:

    File SizeFormat
    0KbUnknown745View/Open


    All items in NCUIR are protected by copyright, with all rights reserved.

    社群 sharing

    ::: Copyright National Central University. | 國立中央大學圖書館版權所有 | 收藏本站 | 設為首頁 | 最佳瀏覽畫面: 1024*768 | 建站日期:8-24-2009 :::
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback  - 隱私權政策聲明