• <th id="bmlp4"><address id="bmlp4"></address></th>

    <code id="bmlp4"><thead id="bmlp4"><bdo id="bmlp4"></bdo></thead></code>
    <listing id="bmlp4"></listing>
    <code id="bmlp4"></code>
    <th id="bmlp4"></th>
  • A Nearly Optimal Packet Scheduling Algorithm for Input Queued Switches with Deadline Guarantees
    【所屬類別】學術活動     【作者】管理員     【閱讀次數】     【發布時間】2014-06-20 08:53:29  


    A Nearly Optimal Packet Scheduling Algorithm for

    Input Queued Switches with Deadline Guarantees




    In order to guarantee quality of service, we consider how to schedule a set of packets buffered at input side of a switch such that maximum number of packets can be transmitted to their destined output ports before their deadlines. This problem has been proven NP-complete if three or more classes (distinct deadlines) are present in the set. Traditionally, the only way to deal with this problem is to use EDF (Earliest Deadline First) or similar methods.  In 2007, we proposed the first non-EDF method that can produce a much higher throughput by repeatedly applying an optimal algorithm for two classes. Recently, a mush high throughput has been reached by a new algorithm which does not use the deadlines as the priorities. This new algorithm provides approximation ratio 2 and superb average performance as well. It would provide a practical solution to the historically difficult problem. A related paper will appear in IEEE Transactions on Computers.


    Dr. Xiaojun Shen (沈孝鈞) received his bachelor degree in computer science in 1968 from Tsinghua University, and master degree in computer science in 1982 from Nanjing University of Science and Technology, China. He came to USA and received his Ph.D degree in computer science in 1989 from University of Illinois, Urbana-Champaign. He became a faculty member in the School of Computing and Engineering at UMKC since 1989. He has done research work in the fields of Discrete Mathematics, Computational Geometry, Parallel Processing, and Computer Networking. In addition to 30 conference papers, he has published more than 40 papers in prestigious journals including SIAM J. Computing, Discrete Mathematics, Discrete Applied Mathematics, IEEE/ACM Transactions on Networking, IEEE Transactions on Computers, IEEE Transactions on Communications, IEEE Transactions on Circuits and systems, Journal of Parallel and Distributed Computing, Theoretical Computer Science, Computer Networks, etc. He has also published a book, Essentials of Computer Algorithms (in Chinese). His current research focuses on packet scheduling for wired and wireless networks.

    著名的美籍華裔計算機科學家Xiaojun Shen(沈孝鈞)博士是美國密蘇里大學堪薩斯城分校的終身教授。他1968年畢業于清華大學,1982年取得華東工程學院(現南京理工大學)的計算機科學的碩士學位,1989年獲得Illinois大學Urbana-Champaign分校的計算機科學的博士學位。

    他的研究方向包括離散數學三亚娱乐官方平台、計算幾何、并行處理、計算機網絡,目前關注分布式計算和傳感器網絡。他的研究成果主要發表在 IEEE Transactions on Computers”, “IEEE/ACM Transactions on Networking”, “IEEE Transactions on Communications”, “IEEE Transactions on Circuits and systems”, SIAM Journal on Computing”, Discrete Mathematics”, “Discrete Applied Mathematics”, “Journal of Parallel and Distributed Computing”等刊物三亚娱乐官方平台。

    鑒于其成果的廣泛影響,他多次應邀擔任計算機科學國際學術會議的chairsession chair三亚娱乐官方平台,并多次應邀在加拿大、澳大利亞等國的高校及我國多所985三亚娱乐官方平台、211高校、中國科學院研究生院和國家研究機構講學。