نتایج جستجو برای: delay scheduling

تعداد نتایج: 194318  

2002
Thu Ngo-Quynh

There exist a Model of Proportional Jitter Differentiated Service and Proportional Delay Differentiated Serivce, which provides proportional jitter or proportional delay between different classes. This first approach is very appropriated for high-speed networks because it does not require the implementation of the proportional jitter scheduling algorithms at all the routers in the network but o...

Journal: :Journal of Multimedia 2006
Ou Yang Jianhua Lu

IEEE 802.16 networks are going to provide broadband wireless access with quality of service (QoS) guarantee. In all of services, real-time video traffic plays an impeditive role because of its varying bit-rate and stringent delay constraint. To the best of our knowledge, no call admission control (CAC) and scheduling schemes cover throughput expectation, delay constraint and fairness requiremen...

2008
Anand Nagar

Active and programmable networks change the functionality of routers and switches by using VPN endpoints and active packets. The authors present a new packet scheduling scheme called active scheduling to control and maintain QoS parameters in virtual private networks (VPNs) within the confines of adaptive and programmable networks. In active scheduling a VPN endpoint on the router monitors the ...

2017
Yin Sun C. Emre Koksal Ness B. Shroff

We study a class of scheduling problems, where each job is divided into a batch of unit-size tasks and these tasks can be executed in parallel on multiple servers with New-Better-than-Used (NBU) service time distributions. While many delay optimality results are available for single-server queueing systems, generalizing these results to the multi-server case has been challenging. This motivated...

2011
Erik Jenelius Lars-Göran Mattsson David Levinson

The delay costs of traffic disruptions and congestion and the value of travel time reliability are typically evaluated using single trip scheduling models, which treat the trip in isolation of previous and subsequent trips and activities. In practice, however, when activity scheduling to some extent is flexible, the impact of delay on one trip will depend on the actual and predicted travel time...

Journal: :CoRR 2010
Prasun Chowdhury Iti Saha Misra

This paper proposes a fair and efficient QoS scheduling scheme for IEEE 802.16 BWA systems that satisfies both throughput and delay guarantee to various real and non-real time applications. The proposed QoS scheduling scheme is compared with an existing QoS scheduling scheme proposed in literature in recent past. Simulation results show that the proposed scheduling scheme can provide a tight Qo...

2017
Ramachandran VIJAYARANI Lakshmanan NITHYANANDAN

Carrier aggregation (CA) in long-term evolution advanced (LTE-A) networks is a promising tool for providing bandwidth extension for high data rate communication. In CA, the efficient scheduling of carriers has imposed a new challenge in the design of delay-sensitive carrier scheduling for mobile multimedia applications. In this paper, a new dynamic slot-based carrier scheduling scheme has been ...

2016
Pallavi P. Bambal Deepak C. Mehetre

Wireless sensor network concept consist sensor nodes which are developed in the specific area senses and transmit data point to point. Delay constraint is the important point in the WSN. The delay guaranteed scheduling and flow control in WSN. Delay guaranteed are important for delay sensitive applications in WSN, Where data delivery is required in a timely manner e.g packet are send if they do...

2001
Haining Wang Chia Shen Kang G. Shin

This paper presents a new scheduling scheme to support premium service in the Differentiated Service (DiffServ) architecture. It is based on weighted packet scheduling policies such as weighted round robin or fair queueing. The key feature of the new scheduling scheme is to change the scheduling weights of Behavior Aggregates adaptively. By adaptively adjusting the weights according to the dyna...

2009
Dong-Sung Kim Dong-Hyuk Choi Prasant Mohapatra

This paper proposes a new scheduling method to obtain a maximum allowable delay bound for a scheduling of networked discrete control systems. The proposed method is formulated in terms of linear matrix inequalities (LMI) and can give a much less conservative delay bound than the existing methods. An event based network scheduling method is presented based on the delay bound obtained through the...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید