Learn More
In recent years much attention has been given to providing the proportional delay differentiation through the packet scheduling. The issue of the performance of the scheduling algorithms also increases in importance when the line speed increases significantly as a result of the optical technology. In this paper we propose an efficient packet scheduling(More)
Traditionally, the assignment problem between tasks and processors is worked out by scheduling methods. In this paper, we have an innovative idea to construct a problem-solving environment for computational grids. To bridge the gap between the parallel processing technology and the heterogeneous computing environment, the grid computing resources are(More)
Input buffered switches with virtual output queues (VOQ) design to avoid head-of-line problems, is a primary design of switches that can be scalable to very high speeds. However, this design requires a complex and iterative scheduling approach and does not meet quality of service (QoS) requirements during operation. In this paper, a three-dimensional(More)
The Internet Engineering Task Force (IETF) recommended the deployment of active queue management (AOM) in the Internet routers in 1998. There were more than 50 new AQM algorithms which have been proposed since 1999. They did not consider the server fairness problem caused by the proposed AQM mechanisms. However, it happens that one may intentionally, but in(More)
In this paper, we propose a multi-level hierarchical dynamic deficit round-robin (MLHDDRR) scheduling algorithm enhanced from the existing dynamic deficit round-robin (DDRR) for the support of differentiated services. The level of service differentiation can be changed simply by adjusting parameters. The MLHDDRR scheduler can deliver small delays for short(More)
This work analyzes the performance of the parallel packet switch (PPS) with a sliding window (SW) method under bursty data traffic. The PPS comprises multiple packet switches operating independently and in parallel. The typical PPS dispatch algorithm uses a round-robin method (RR) (Iyer, 2003). The class of PPS is characterized by deployment of parallel(More)