English  |  正體中文  |  简体中文  |  Items with full text/Total items : 54367/62174 (87%)
Visitors : 15030396      Online Users : 76
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTHU 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
    National Tsing Hua University Institutional Repository > 歷任校長 > 陳文村 (2006-2010)  > 期刊論文 >  A High-Throughput Cell Scheduling Algorithm for Delay-Sensitive Traffics in Broadband Switching Systems

    Please use this identifier to cite or link to this item: http://nthur.lib.nthu.edu.tw/dspace/handle/987654321/81475

    Title: A High-Throughput Cell Scheduling Algorithm for Delay-Sensitive Traffics in Broadband Switching Systems
    Authors: W. T. Chen;Huai-Jen Liu;Yeong-Tsong Tsay
    教師: 陳文村
    Date: 1992
    Publisher: Institute of Information Science Academia Sinica
    Relation: Journal of Information Science and Engineering, Institute of Information Science Academia Sinica, Volume 8, Issue 4, Dec. 1992, Pages 603-620
    Keywords: output contention, bandwidth allocation, cell scheduling, broadband integrated services digital network (BISDN), asynchronous transfer modde (ATM), ATM switching, sorting network, routing network
    Abstract: In this paper, we consider the output contention problem with the objective of increasing the throughput for asynchronous fransfer mode (ATM) switching systems with delay-sensitive traffic. We propose a cell scheduling algorithm to increase the throughput of a switching system. The maximum throughput is increased by up to 0.949. The efficiency, (output trunk utilization)/(input trunk utilization), is almost equal to 100%, and it is independent of the switch size and the traffic load. The cell scheduling algorithm is also shown to be able to provide high throughput not only for delay-sensitive traffic but also for traffic which can tolerate longer queueing delay. The mean cell waiting time of delay-sensitive traffic is reduced. That is, delay-sensitive traffic is transmitted as soon as possible. In previous works, the switching network usually has consisted of a sorting network followed by a routing network. However, in the switching system implemented with our cell scheduling algorith, it is sufficient for a sorting network to establish input/output paths through it simultaneously without conflicts, and it is not necessary to append a routing network to a sorting network. With our cell scheduling algorithm, it is impossible for any out-of -sequence cells to be received by the destinations on an input/output path. This, in turn, leads to the design of simpler protocols for the synchronization of real-time services such as voice and video communications. Consequently, our algorithm may offer an effective alternative for an ATM switching system.
    Relation Link: http://www.iis.sinica.edu.tw/page/jise/1992/199212_06.html
    URI: http://nthur.lib.nthu.edu.tw/dspace/handle/987654321/81475
    Appears in Collections:[陳文村 (2006-2010) ] 期刊論文
    [資訊工程學系] 期刊論文

    Files in This Item:

    File Description SizeFormat


    SFX Query


    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback