Results 241 to 250 of about 492,885 (287)
Some of the next articles are maybe not open access.
Packet Scheduling and Congestion Control
2009In the framework of Next-Generation Networks (NGNs), the IP-based Radio Access Networks (RANs) component, though representing one of the most attractive aspects of NGNs, is also the weakest part. The wireless interface is in fact the critical factor in end-to-end Quality of Service (QoS) support due in particular to the fluctuations of radio channel ...
Giambene, Giovanni +4 more
openaire +2 more sources
A Packet-by-Packet Scheduling Algorithm for Wireless Multimedia Systems
2007 IEEE 66th Vehicular Technology Conference, 2007In this paper, we propose a packet-by-packet scheduling algorithm which grants priority to each packet instead of a user. The proposed scheduler classifies packets inside of each user into three classes such as emergency, near emergency, and non-emergency packets based on packet delay ratio, and applies different scheduling schemes to grant priority in
Jinyoung Oh, Jin-Yup Hwang, Youngnam Han
openaire +1 more source
Packet scheduling in a low latency optical packet switch
2010 International Conference on High Performance Switching and Routing, 2010In this paper, we study packet scheduling in the OpCut switch, a recently proposed optical switching architecture that can be adopted for high-performance parallel computers. The key feature of the OpCut switch is that it allows packets to cut-through the switch whenever possible, such that packets experience minimum delay.
Lin Liu 0004 +2 more
openaire +1 more source
Optimal packet scheduling in UTRA-TDD
IEEE Communications Letters, 2003In UTRA-TDD, packets with different formats and quality-of-service (QoS) requirements are sent across the air interface organized into radio frames. We propose a frame-by-frame exact downlink scheduling algorithm based on dynamic programming, considering different traffic classes with their QoS levels.
AGNETIS A. +4 more
openaire +3 more sources
Greedy Packet Scheduling on Shortest Paths
Journal of Algorithms, 1993Summary: We investigate the simple class of greedy scheduling algorithms, that is, algorithms that always forward a packet if they can. Assuming that only one packet can be delivered over a link in a single step and that the routes traversed by a set of packets are distance optimal (``shortest paths''), we prove that the time required to complete ...
Yishay Mansour, Boaz Patt-Shamir
openaire +1 more source
2008 18th International Conference Radioelektronika, 2008
This paper deals with the bit rate allocation methods, which are parts of the packet scheduling process. This process, together with access control, congestion control and others, ensures QoS in UMTS. In this paper, a fair throughput packet scheduling algorithm and two versions of fair resources packet scheduling algorithm are described.
Petr Kejik, Stanislav Hanus
openaire +1 more source
This paper deals with the bit rate allocation methods, which are parts of the packet scheduling process. This process, together with access control, congestion control and others, ensures QoS in UMTS. In this paper, a fair throughput packet scheduling algorithm and two versions of fair resources packet scheduling algorithm are described.
Petr Kejik, Stanislav Hanus
openaire +1 more source
Packet-Level Slot Scheduling MAC Protocol in Underwater Acoustic Sensor Networks
IEEE Internet of Things Journal, 2021Yan Wei, Xiaoxiao Zhuo, Fengzhong Qu
exaly
Dynamic Multilevel Priority Packet Scheduling Scheme for Wireless Sensor Network
IEEE Transactions on Wireless Communications, 2013Lutful Karim, Nidal Nasser, Tarik Taleb
exaly

