東華大學圖書館 |

Language: English

Help

回圖書館首頁

手機版館藏查詢

Back

Switch To: Labeled | MARC Mode | ISBD

Competitive queuing policies for pac...

Columbia University.

Linked to FindBook

Google Book

Amazon

博客來

Competitive queuing policies for packet scheduling.

Record Type:	Electronic resources : Monograph/item
Title/Author:	Competitive queuing policies for packet scheduling./
Author:	Li, Fei.
Description:	80 p.
Notes:	Advisers: Clifford Stein; Jay Sethuraman.
Contained By:	Dissertation Abstracts International68-11B.
Subject:	Computer Science. -
Online resource:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3292141
ISBN:	9780549350286

Competitive queuing policies for packet scheduling.
Li, Fei.

Competitive queuing policies for packet scheduling. - 80 p.

Advisers: Clifford Stein; Jay Sethuraman.

Thesis (Ph.D.)--Columbia University, 2008.

In the Internet, all information is aggregated into packets. The computers connected to the Internet communicate with each other by means of exchanging packets. All packets travel through communication links and network switches. If a burst of packets arrives at the same time, a network switch cannot transmit all of them on the fly. Inside a network switch, there are some output buffer(s). Arriving packets are queued in the output buffer(s), waiting to be delivered.

ISBN: 9780549350286Subjects--Topical Terms:

626642
Computer Science.

Competitive queuing policies for packet scheduling.
LDR:03089nmm 2200313 a 45 001 866706
005 20100802
008 100802s2008 ||||||||||||||||| ||eng d
020 $a 9780549350286
035 $a (UMI)AAI3292141
035 $a AAI3292141
040 $a UMI $c UMI
100 1 $a Li, Fei. $3 1035368
245 1 0 $a Competitive queuing policies for packet scheduling.
300 $a 80 p.
500 $a Advisers: Clifford Stein; Jay Sethuraman.
500 $a Source: Dissertation Abstracts International, Volume: 68-11, Section: B, page: 7439.
502 $a Thesis (Ph.D.)--Columbia University, 2008.
520 $a In the Internet, all information is aggregated into packets. The computers connected to the Internet communicate with each other by means of exchanging packets. All packets travel through communication links and network switches. If a burst of packets arrives at the same time, a network switch cannot transmit all of them on the fly. Inside a network switch, there are some output buffer(s). Arriving packets are queued in the output buffer(s), waiting to be delivered.
520 $a Most current Internet switches adopt the First-In-First-Out (FIFO) buffering policy. Using the FIFO buffering policy, network switches send packets in the same order as they arrive. FIFO buffering policy cannot provide assured data transmission for time-critical applications or mission-critical applications due to unpredictable packet loss, end-to-end delay, out-of-order delivery, and jitter.
520 $a In the past ten years, there is rapid growth of network traffic and time-critical applications. The diversity of applications results in unpredictable packet flows and heterogeneous network traffic, and motivates us to study buffer management at the switch levels for providing better Quality of Service (QoS). The difficulty of achieving better QoS in the existing Internet infrastructure without sacrificing high resource utilization remains open.
520 $a In this thesis, we study a model in the Differentiated Services (DiffServ) QoS infrastructure, which is called the "bounded-delay model". We characterize packets by their deadlines by which they should be sent, and their payoffs when they are delivered on time. Our goal is to maximize the total value of packets sent by their deadlines. We design deterministic online packet scheduling algorithms for QoS queuing policies. We also develop novel and effective analysis techniques. Our algorithms perform better over existing solutions in terms of competitive ratio, which provides a worst-case performance guarantee for all traffic patterns. The ideas and approaches developed in this thesis explore the insights in similar online models with deadline constraints, and can be generalized and applied to other online scheduling problems.
590 $a School code: 0054.
650 4 $a Computer Science. $3 626642
690 $a 0984
710 2 $a Columbia University. $3 571054
773 0 $t Dissertation Abstracts International $g 68-11B.
790 $a 0054
790 1 0 $a Sethuraman, Jay, $e advisor
790 1 0 $a Stein, Clifford, $e advisor
791 $a Ph.D.
792 $a 2008
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3292141