In this paper we present a dynamic bandwidth allocation algorithm for EPON, which makes use of the Multipoint Control Protocol (MPCP) with threshold reporting and with interand intra-ONU priority scheduling. Three varieties of this algorithm are compared, by means of a detailed simulation program, regarding average packet delay for several priorities, delay variation for constant bit rate (CBR)...

In this paper, we propose a framework for QoS support in the IEEE 802.16 Mesh network. For performance improvement over the two basic scheduling schemes recommended in the standard, centralized and distributed scheduling, the framework adopts the idea of BS-controlled route selection and delay-based scheduling. Core mechanisms including mapping of IP QoS classes to 802.16 QoS types, admission c...

This letter presents a novel improved delay estimation methodology during scheduling in high level synthesis (HLS) for application specific computing. In general during delay estimation from scheduling during HLS, only functional unit delay is considered. However for current generation of complex digital systems, interconnects (switching elements) also play a very vital role in effective delay ...

Need for high speed internet connectivity has lead to a substantial research in switching systems. Buffered crossbar switches have received a lot of attention from both research and industrial communities due of its flexibility and scalability. Designing a scheduling algorithm for buffered crossbar switches without starvation is a major challenge as of now. In this paper, we proposed a Delay ba...

We consider the problem of designing scheduling schemes for networks with arbitrary topology and scheduling constraints. We address the optimality of scheduling schemes for packet networks in terms of throughput, delay and fairness. Specifically, we design two scheduling schemes. The first one achieves simultaneous throughput and delay optimization. The second scheme provides fairness. We desig...

Robust optimisation is a well established concept to deal with uncertainty. In particular, recovery-robust models are suitable for real-world contexts, where a certain amount of recovery – although limited – is often available. In this paper we describe a general framework to optimise event-based problems against delay propagation. We also present a real-world application to train platforming i...

One of the key components in the design of optical burst-switched nodes is the development of channel scheduling algorithms that can efficiently handle data burst contentions. Traditional scheduling techniques use approaches such as wavelength conversion and buffering to resolve burst contention. In this paper, we propose non-preemptive scheduling algorithms that use burst segmentation to resol...

Disk scheduling is one of the main responsibilities of Operating System. OS manages hard disk to provide best access time. All major Disk scheduling algorithms incorporate seek time as the only factor for disk scheduling. The second factor rotational delay is ignored by the existing algorithms. This research paper considers both factors, Seek Time and Rotational Delay to schedule the disk. Our ...

CPU scheduling for multimedia applications has received a lot of recent mtention. While previous fair share schedulers are able to provide real-lime perfonnance guarantees, they do not consider application priority in their scheduling decisions. An important consequence is that delay and rate guarantees are coupled together, so that low delay cannot be achieved simultaneously with low rate. In ...