English  |  正體中文  |  简体中文  |  Items with full text/Total items : 54367/62174 (87%)
Visitors : 13391911      Online Users : 370
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 > 電機資訊學院 > 資訊工程學系 > 期刊論文 >  Adaptive scheduling algorithm for TDM switching systems


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


    Title: Adaptive scheduling algorithm for TDM switching systems
    Authors: Chen,Wen-Tsuen
    Liu,Huai-Jen
    教師: 陳文村
    Date: 1995
    Publisher: Institute of Electrical and Electronics Engineers Inc
    Relation: Communications, IEEE Transactions on
    Volume 43,Issue 234,Feb-Mar-Apr 1995 Page(s):651-658
    Keywords: Switching systems
    Adaptive algorithms
    Time division multiplexing
    Telecommunication traffic
    Packet switching
    Scheduling
    Computational complexity
    Switching networks
    Abstract: In this paper, we consider the scheduling problem in time-division multiplexed (TDM) switching systems. In previous works, the interdependence between traffic demands in two consecutive frames is neglected, and scheduling algorithms found up to now have time complexities O(N5) or O(N4.5), where N is the switch size. However, in many applications like voice or video communications, if a source transmits a packet to a destination in a frame, it is highly probable that it will also transmit a packet to the same destination in the next frame. So it is not necessary to schedule incoming packets for every frame if we can preserve all the switching patterns for the nearest scheduled frame and update the patterns appropriately according to the changes of traffic demands. The adaptive algorithm proposed in this paper assigns time slots to packets according to the changes of traffic demands. This algorithm has the worst case time complexity O(N2 L), where L is the TDM frame length. Comparing the time complexity of the adaptive algorithm with those of previous scheduling algorithms, the adaptive algorithm can perform better than previous scheduling algorithms when N is large and/or L is small. Since traffic demands in consecutive frames are expected to be interdependent in many applications, the proposed algorithm may offer as an efficient alternative for scheduling time slots in these applications.
    Relation Link: http://ieeexplore.ieee.org/Xplore/dynhome.jsp
    URI: http://nthur.lib.nthu.edu.tw/handle/987654321/12877
    Appears in Collections:[資訊工程學系] 期刊論文
    [通訊工程研究所] 期刊論文
    [電腦與通訊科技研發中心] 期刊論文

    Files in This Item:

    File Description SizeFormat
    2030201010002.pdf863KbAdobe PDF896View/Open


    在NTHUR中所有的資料項目都受到原著作權保護,僅提供學術研究及教育使用,敬請尊重著作權人之權益。若須利用於商業或營利,請先取得著作權人授權。
    若發現本網站收錄之內容有侵害著作權人權益之情事,請權利人通知本網站管理者(smluo@lib.nthu.edu.tw),管理者將立即採取移除該內容等補救措施。

    SFX Query

    與系統管理員聯絡

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