Results 231 to 240 of about 492,885 (287)
Some of the next articles are maybe not open access.

Greedy Packet Scheduling

SIAM Journal on Computing, 1991
Scheduling packets to be forwarded over a link is an important subtask of the routing process in both parallel computing and in communication networks. This paper investigates the simple class of greedy scheduling algorithms, namely, algorithms that always forward a packet if they can.
Israel Cidon   +3 more
openaire   +2 more sources

Packet scheduling with fragmentation

Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies, 2003
We investigate a scheduling problem in a TDMA environment where packets may be fragmented. Our model of the problem is derived from a scheduling problem present in data over CATV networks, where a slotted TDMA channel is used to carry both real-time and best-effort traffic.
Nir Naaman, Raphael Rom
openaire   +2 more sources

Packet Scheduling

ACM SIGACT News, 2021
Online packet scheduling with deadlines is one of the fundamental models in buffer management. Recently, the author together with Chrobak, Jez, and Sgall (SODA 2019) designed an optimal ϕ-competitive algorithm for this problem, where ϕ ≈1.618 is the golden ratio.
openaire   +2 more sources

VWQGRR: A Novel Packet Scheduler

Sixth International Conference on Networking (ICN'07), 2007
In this paper, we propose a novel grouping strategy of group round robin and an O(1) complexity scheduling algorithm called virtual weighted queue group round robin. Simulation and implementation experiments show that our algorithm can provide better end-to-end delay than traditional group round robin.
Linhua Zhong, Jin Xu, Xianlei Wang
openaire   +1 more source

Towards Programmable Packet Scheduling

Proceedings of the 14th ACM Workshop on Hot Topics in Networks, 2015
Packet scheduling in switches is not programmable; operators only choose among a handful of scheduling algorithms implemented by the manufacturer. In contrast, other switch functions such as packet parsing and header processing are becoming programmable [10, 3, 6].
Anirudh Sivaraman   +9 more
openaire   +1 more source

Multisession Video Packet Scheduling

2014
The main objective of this paper is to deliver quality video at the receiver end using the proposed scheduling schemes. The video is compressed for video streaming process, which may cause loss of packets (or) frames. Each video packet has different levels of contribution to improve the video quality at the receiver side. To overcome these problems the
R. Arockia Xavier Annie   +2 more
openaire   +1 more source

Packet scheduling for Multipath TCP

2015 Seventh International Conference on Ubiquitous and Future Networks, 2015
Multipath TCP (MPTCP) has been an emerging transport protocol as it can greatly improve application throughput by utilizing multiple network interfaces at the same time, e.g., both of WiFi and 3G/LTE. While MPTCP is generally beneficial for long-lived flows, it shows worse performance than SPTCP that exploits the best path when the flow size is small ...
Jaehyun Hwang, Joon Yoo
openaire   +2 more sources

Experience-Based Packet Scheduler

Proceedings of the The International Conference on Engineering & MIS 2015, 2015
The object of this research is to develop a system that provides fairness among users and at the same time that helps to maximize the data transmission of whole system by optimizing the base station packet planners which are used telecommunication systems.
Yağcıoğlu, Mert, Bayat, Oğuz
openaire   +1 more source

Packet Scheduling with QoS Differentiation

Wireless Personal Communications, 2002
This article focuses on the Quality of Service (QoS) achieved by packet scheduling. A packet scheduling algorithm, which can differentiate the QoS among user and service classes, is presented. The algorithm can be tuned from signal to interference ratio (C/I) based scheduling to Round Robin and beyond.
Jeroen Wigard   +4 more
openaire   +1 more source

Mixed Criteria Packet Scheduling

2007
Packet scheduling in networks with quality of service constraints has been extensively studied as a single criterion scheduling problem. The assumption underlying single criterion packet scheduling is that the value of all packets can be normalized to a single scale, even in cases when packets have different requirements.
Chad R. Meiners, Eric Torng
openaire   +2 more sources

Home - About - Disclaimer - Privacy