quality of service (qos) refers to a set of rules or techniques that help the network administrators use the available network resources optimally to manage the effects of congestion and to treat the applications according to their needs. the differentiated services architecture (diffserv) allows providing quality of service to users. the major diffserv premise is that individual flows with sim...

Scheduling algorithm is a key technology in satellite switching system with input-buffer. In this paper, a new scheduling algorithm and its realization are proposed. Based on Crossbar switching fabric, the algorithm adopts serial scheduling strategy and adjusts the output port arbitrating strategy for the better equity of every port. Consequently, it increases the matching probability. The algo...

Avoiding delay jitter is essential to achieve high throughput for TCP. In particular, delay spikes can cause spurious timeouts. Such timeouts force TCP into slow-start, which may reduce congestion window sizes drastically. Consequently, there may not always be data available for transmission on bottleneck links. For HS-DSCH, jitter can occur due to varying interference. Also, properties of the ...

Enhanced Uplink operation of WCDMA-UMTS systems utilizes fast Node B scheduling and a short Transmission Time Interval (TTI) of 2ms. The scheduling decisions are based on Scheduling Information (SI) sent from each User Equipment (UE) to the Node B. The weakness of the existing scheduling framework is that the SI does not include information regarding the delay sensitivity of each traffic flow, ...

We apply simulation to evaluate the performance of scheduling according to an alternating FCFS/SJF service order, in particular concerning performance metrics other than delay. Metrics related to social justice, also referred to as quantitative fairness measures, are investigated. We focus on two types of situations that have been previously identified to provoke and increase queued customers’ ...

-Many packet scheduling mechanisms have been proposed to provide rate and delay control to flows. The mechanisms providing strict delay bounds require per-flow state and complex packet classification, which hamper their deployment on a large scale. This paper presents a scheduling mechanism for delay control that does not require per-flow state in interior network nodes (a.k.a. corestateless ne...

While a number of scheduling policies achieve the maximum throughput region, the average delay minimization problem for cellular broadcast systems still awaits its complete solution. To this end, we introduce a scheduling policy which decomposes the cross-layer delay optimization problem into two subproblems: allocation of physical resources and user priority management. The first subproblem is...

This paper considers the scheduling problem in a new slotted optical network called Time-Domain Wavelength Interleaved network (TWIN). The TWIN architecture possesses interesting properties, which may offer solutions for next-generation optical networks. Besides, better Quality of Service (QoS) could be achieved in TWIN by minimizing two parameters: queueing delay and delay variance. However, t...

0140-3664/$ see front matter 2010 Elsevier B.V. A doi:10.1016/j.comcom.2010.01.018 * Corresponding author. Tel.: +65 67904512; fax: + E-mail addresses: [email protected] (Y. Yi Poo). Ethernet passive optical networks (EPONs) are being designed to deliver different quality of service (QoS) to carry heterogeneous traffic of end users. For this purpose, hierarchical scheduling is needed for up...

In this paper, we focus on a packet scheduling algorithm exploiting multiuser diversity in wireless networks. We compare the delay performance of individual user under the scheduling algorithm exploiting multiuser diversity with that under the round-robin scheduling algorithm in order to reveal the characteristics of the scheduling algorithm exploiting multiuser diversity. For this purpose, we ...