English  |  正體中文  |  简体中文  |  Items with full text/Total items : 72887/72887 (100%)
Visitors : 23098360      Online Users : 506
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/8675

    Title: 針對串流應用程式所設計的低延遲及高效率的封包排程;Low Latency and Efficient Packet Scheduling for Streaming Applications
    Authors: 賴旭德;Hsu-Te Lai
    Contributors: 資訊工程研究所
    Keywords: 即時應用程式;封包排程;packet scheduling;real-time application;streaming;queuing
    Date: 2003-06-24
    Issue Date: 2009-09-22 11:32:47 (UTC+8)
    Publisher: 國立中央大學圖書館
    Abstract: 即時性的應用程式(Real-Time Applications)需要有足夠的頻寬預留才可運作順暢。Class Based Queue (CBQ), Nested Deficit Round Robin(NDRR)之類的封包排程方式主要就是針對頻寬保留所設計的。然而這些方式會造成網路封包的延遲時間的不穩定,而使得應用程式需要使用更大的封衝區來播放媒體串流(media stream)。即時性應用程式大體來說希望有較小的封包延遲。然而長及不穩定的封包延遲時間會危及到服務品質(Quality of Service)。目前有些封包排程方式可以使封包的延遲時間相當穩定,但是它們需要知道每個串流(flow)的細節。GPS (General Processor Sharing)-like的封包排程方式並沒有考量到串流資料實際的運作情形。一條經過許多路由器所遞送的串流不會是非常平順的。而GPS-like的封包排程方式還到這些不平順的串流時會產生額外的封包延遲時間。在這篇論文中,我們提出了一個可以針對串流應用程式(streaming applications)提供低延遲及有效率的封包排程方式名為LLEPS,以保證串流應用程式可以運作順暢。 Adequate bandwidth allocations and strict delay requirements are critical for real time applications. Packet scheduling algorithms like Class Based Queue (CBQ), Nested Deficit Round Robin (Nested-DRR) are designed to ensure the bandwidth reservation function. However, they might cause unsteady packet latencies and introduce extra application handling overhead, such as allocating a large buffer for playing the media stream. High and unstable latency of packets might jeopardize the corresponding Quality of Service since real-time applications prefer low playback latency. Existing scheduling algorithms which keep latency of packets stable require knowing the details of individual flows. GPS (General Processor Sharing)-like algorithms does not consider the real behavior of a stream. A real stream is not perfectly smooth after forwarded by routers. GPS-like algorithms will introduce extra delay on the stream which is not perfectly smooth. This thesis presents an algorithm which provides low latency and efficient packet scheduling service for streaming applications called LLEPS.
    Appears in Collections:[資訊工程研究所] 博碩士論文

    Files in This Item:

    File SizeFormat

    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  - 隱私權政策聲明