With development of digital multimedia, many applications, such as VoD, remote education, and so on, becomes a reality. Multimedia resource in education system becomes very rich. With the increasing number of multimed...
详细信息
The increasing demand for higher data rates on the internet requires routers that deliver high performance for high-speed connections. Nowadays high speed routers use the buffered crossbar switches, which have been th...
详细信息
In order to support different types of multimedia applications, the IEEE 802.16 standard defines different service classes with their associated Quality of Service (QoS) parameters. The scheduling algorithm is the cru...
详细信息
Moving is the key to modern life. Most things are in moving such as vehicles and user mobiles, so the need for high-speed wireless networks to serve the high demand of the wireless application becomes essential for an...
详细信息
Recent advances in wireless technologies open up new avenues toward many newer applications;however, existing wireless networks are not efficient enough to satisfy some new applications' requirements such as low e...
详细信息
Recent advances in wireless technologies open up new avenues toward many newer applications;however, existing wireless networks are not efficient enough to satisfy some new applications' requirements such as low energy consumption, high throughput, and low end-to-end delay. scheduling algorithms are promising for performance improvement by addressing the limitations of standard networking protocols. Due to the widespread deployments and applications of wireless networks, a significant number of scheduling algorithms has been proposed to improve network performance. In this paper, we provide a systematic comparison among proposed scheduling algorithm with an exhaustive, network-independent framework to ease the comparison among different scheduler design and highlight important challenges in the term of algorithmic parameters, computational order, accuracy, and overhead. We also study a set of schedulers in two main categories: low-power, and high-throughput, concerning our framework to extract the weakness and strength of each proposed method compared to other scheduling algorithms.
The main aim of long term evolution is to provide very high rate for downlink and uplink, better multimedia services and more user flexibility than the current cellular networks. There is a very important role of reso...
详细信息
Web-services have become most common IT enablers today. Cyber attacks such as the distributed denial of service (DDoS) attacks pose availability concerns which may result into service outages and consequently financia...
详细信息
algorithms synthesis is a new approach in the field of design and analysis of algorithms. Darlington (1978) presented a tree structure starting from a high level definition (by defining permutation function) as root-...
详细信息
algorithms synthesis is a new approach in the field of design and analysis of algorithms. Darlington (1978) presented a tree structure starting from a high level definition (by defining permutation function) as root-node and finally obtaining 6 terminal-nodes corresponding to each sorting algorithm he discussed. The algorithms-synthesis approach starts from a high level definition and ultimately results in the required algorithms. An attempt is made to synthesize some scheduling algorithms starting, as Darlington did, from a high level definition, and using program transformation techniques. Three scheduling algorithms are taken into the synthesis: 1. First-Come-First-Serve, 2. Round-Robin, and 3. Selfish-Round-Robin. The rules applied are mainly the unfolding-and-folding technique as examined by Burstall and Darlington (1977).
While fading effects have long been combatted in 2G wireless networks, primarily devoted to voice calls, they are now seen as an opportunity to increase the capacity of 3G networks that incorporate data traffic. The p...
详细信息
While fading effects have long been combatted in 2G wireless networks, primarily devoted to voice calls, they are now seen as an opportunity to increase the capacity of 3G networks that incorporate data traffic. The packet delay tolerance of data applications, such as file transfers and Web browsing for instance, allows the system flexibility in scheduling a user's packets. So-called opportunistic scheduling, which ensures transmission occurs when radio conditions are most favourable, is the key component of currently developed systems like cdma2000 IS-856 and UNITS HSDPA. We compare the performance of some scheduling schemes using a flow-level approach where the random evolution of the number of ongoing flows is explicitly taken into account. Copyright (C) 2005 AEIT.
In this paper, we consider the accessing of batched requests in a linear storage medium. The batch size is assumed fixed and the access probabilities of individual records known. For a given arrangement of records in ...
详细信息
暂无评论