Filters








11,355 Hits in 6.5 sec

Off-Line Algorithms for Minimizing Total Flow Time in Broadcast Scheduling [chapter]

Wun-Tat Chan, Francis Y. L. Chin, Yong Zhang, Hong Zhu, Hong Shen, Prudence W. H. Wong
2005 Lecture Notes in Computer Science  
We study the off-line broadcast scheduling problem to minimize total (or average) flow time.  ...  In the single channel case, we also give a simple linear-time approximation algorithm to minimize average flow time, which achieves an additive (k − 1)/2-approximation.  ...  Note that an optimal schedule that minimizes the total flow time is also an optimal schedule that minimizes the average flow time.  ... 
doi:10.1007/11533719_33 fatcat:4fcqtbs6k5amlfvhmirxlmxgqi

Title A dynamic programming approach of finding an optimal broadcast schedule in minimizing total flow time A Dynamic Programming Approach of Finding an Optimal Broadcast Schedule in Minimizing Total Flow Time * Computing and Combinatorics Conference as "Off-line Algorithms for Minimizing the Total Flow Time in Broadcast Scheduling

Wt Chan, Fyl Chin, Y Zhang, H Zhu, H Shen, Wong, Wun-Tat Chan, Francis Chin, Yong Zhang, Hong Zhu, Hong Shen, Prudence Wong
2006 Citation Journal Of Combinatorial Optimization   unpublished
We study the problem of (off-line) broadcast scheduling in minimizing total flow time and propose a dynamic programming approach to compute an optimal broadcast schedule.  ...  The optimal schedule can be computed in O(k 3 (n+k) k−1) time for the case that the server has a single broadcast channel.  ...  This paper is the first to give algorithms for finding optimal broadcast schedules that minimize total flow time.  ... 
fatcat:3yolcco3gvfsnomkochszihaba

A dynamic programming approach of finding an optimal broadcast schedule in minimizing total flow time

Wun-Tat Chan, Francis Y. L. Chin, Yong Zhang, Hong Zhu, Hong Shen, Prudence W. H. Wong
2006 Journal of combinatorial optimization  
We study the problem of (off-line) broadcast scheduling in minimizing total flow time and propose a dynamic programming approach to compute an optimal broadcast schedule.  ...  The optimal schedule can be computed in O(k 3 (n+k) k−1 ) time for the case that the server has a single broadcast channel.  ...  This paper is the first to give algorithms for finding optimal broadcast schedules that minimize total flow time.  ... 
doi:10.1007/s10878-006-7128-7 fatcat:hqxfbyjvg5dk5iqd6gpcyyj2q4

On Burst Transmission Scheduling in Mobile TV Broadcast Networks

Mohamed Hefeeda, Cheng-Hsin Hsu
2010 IEEE/ACM Transactions on Networking  
In mobile TV broadcast networks, the base station broadcasts TV channels in bursts such that mobile devices can receive a burst of traffic and then turn off their radio frequency circuits till the next  ...  In this paper, we prove that the burst scheduling problem for TV channels with arbitrary bit rates is NP-complete.  ...  Since we assume that each burst incurs a fixed overhead T o , for a given frame length p, minimizing the RF circuit on-time is equivalent to minimizing total number of bursts in each frame because it minimizes  ... 
doi:10.1109/tnet.2009.2030326 fatcat:n4fu6w3mujgdrk3xtgjcvw4hzu

A note on on-line broadcast scheduling with deadlines

Xin Han, He Guo, Dawei Yin, Yong Zhang
2009 Information Processing Letters  
Most of the previous works on on-line broadcast scheduling focus on minimizing the flow time [1] [2] [3] [4] [6] [7] [8] 11 ].  ...  The main objectives are minimizing the flow time (response time) and maximizing the total throughput, i.e., the number of satisfied requests. Previous results.  ... 
doi:10.1016/j.ipl.2008.10.002 fatcat:3k5eotvtwnf4nake2tzcbdn3ju

Energy optimization in mobile TV broadcast networks

Mohamed Hefeeda, Cheng-Hsin Hsu
2008 2008 International Conference on Innovations in Information Technology  
In this paper, we formulate the problem of determining the optimal burst schedules for broadcasting multiple TV channels.  ...  Using this simplification, we propose and analyze an optimal burst scheduling algorithm.  ...  We use the fact that we established in the proof of Theorem 1: minimizing energy consumption is the same as minimizing the total number of bursts in each frame.  ... 
doi:10.1109/innovations.2008.4781676 fatcat:vqchdkvmxbfsjafajawy222h6i

An Age-Of-Information Perspective on Decentralized Congestion Control in Vehicular Networks

Ion Turcanu, Andrea Baiocchi, Nikita Lyamin, Alexey Vinel
2021 2021 19th Mediterranean Communication and Computer Networking Conference (MedComNet)  
In this paper, we provide a comprehensive performance evaluation of the main state-ofthe-art broadcast rate control algorithms from the point of view of channel load, utilization efficiency, and information  ...  A major effort has been spent, especially by standardization bodies, to define congestion control algorithms for the vehicular networking environment.  ...  Connected Intelligent Vehicles in Smart Cities -SafeSmart" project (2019-2023), Swedish Innovation Agency (VINNOVA) in the framework of "Emergency Vehicle Traffic Light Pre-emption in Cities -EPIC" project  ... 
doi:10.1109/medcomnet52149.2021.9501273 fatcat:zbhakb4pljbhdfmss7c7kjxk3u

Scheduling Algorithms for Tree-Based Data Collection in Wireless Sensor Networks [chapter]

Ozlem Durmaz Incel, Amitabha Ghosh, Bhaskar Krishnamachari
2010 Monographs in Theoretical Computer Science  
In this chapter, we survey contention-free Time Division Multiple Access (TDMA) based scheduling protocols for such data collection applications over tree-based routing topologies.  ...  We classify the algorithms according to their common design objectives, identifying the following four as the most fundamental and most studied with respect to data collection in WSNs: (i) minimizing schedule  ...  The authors present competitive ratios (a metric, in which the performance of an on-line algorithm is compared to the performance of an optimal off-line algorithm) for a simple algorithm that aims to balance  ... 
doi:10.1007/978-3-642-14849-1_14 dblp:series/eatcs/IncelGK11 fatcat:ccdypeszfre3jpnhr5l3siy44q

Broadcasting Video Streams Encoded With Arbitrary Bit Rates in Energy-Constrained Mobile TV Networks

Cheng-Hsin Hsu, Mohamed M Hefeeda
2010 IEEE/ACM Transactions on Networking  
in real time and scales to large scheduling problems.  ...  The base station needs to construct a transmission schedule for all bursts of different TV channels.  ...  The authors of [23] solve the problem of minimizing the weighted sum of the total task flow time and the preemption penalty, where the weight is ad hoc.  ... 
doi:10.1109/tnet.2009.2033058 fatcat:mxm2oqixovf65js6drcmm6docy

ON-DEMAND BOUNDED BROADCAST SCHEDULING WITH TIGHT DEADLINES

CHUNG KEUNG POON, FEIFENG ZHENG, YINFENG XU
2007 International Journal of Foundations of Computer Science  
However, we show that when there are maximum bounds on the number and weight of requests at any time in the system, the HEU algorithm is not optimal.  ...  We then propose a modified algorithm, VAR, which is optimal for this case.  ...  For our model, most of the previous works concentrate on minimizing the flow time where the flow time of a request is the time elapsed between its arrival and its completion.  ... 
doi:10.1142/s012905410700467x fatcat:by2hxqmtfvgzhffqekmeztsoxi

A Lifetime-Optimizing Approach to Routing Messages in Ad-hoc Networks [chapter]

Javed Aslam, Qun Li, Daniela Rus
2004 Network Theory and Applications  
We thank the anonymous reviewers for their suggestions.  ...  -9912193, Honda corporation, and the Sloan foundation; we are grateful for this support.  ...  of the optimal off-line routing algorithm under realistic conditions.  ... 
doi:10.1007/978-1-4613-0223-0_1 fatcat:wk63k5kagfevpcfnfv2jdgibhu

New Models and Algorithms for Throughput Maximization in Broadcast Scheduling [chapter]

Chandra Chekuri, Avigdor Gal, Sungjin Im, Samir Khuller, Jian Li, Richard McCutchen, Benjamin Moseley, Louiqa Raschid
2011 Lecture Notes in Computer Science  
A proxy server has to compute a probing schedule for the resources since it can probe a limited number of resources at each time step.  ...  However, the specific requirements of the applications motivate some generalizations and variants of previously studied metrics for broadcast scheduling.  ...  The first-in-first-out (FIFO) algorithm is 2-competitive in the online setting [2, 6, 8] and this is also the best known off-line approximation known.  ... 
doi:10.1007/978-3-642-18318-8_7 fatcat:2bt6khh77be4rpwxbmtlpvghrq

Optimal transmission schemes for parallel and fading Gaussian broadcast channels with an energy harvesting rechargeable transmitter

Omur Ozel, Jing Yang, Sennur Ulukus
2013 Computer Communications  
The optimal total transmit power allocation policy is found using a specific directional water-filling algorithm for fading broadcast channels.  ...  Under off-line knowledge of energy arrival and channel fading variations, we obtain the trade-off between the performances of the users by characterizing the maximum departure region in a given interval  ...  In [12] , optimal off-line packet scheduling for energy minimization is solved in a delay constrained single-user data link and in [13] , the framework is extended for multiple access, broadcast and  ... 
doi:10.1016/j.comcom.2012.04.010 fatcat:mc6l3pvkinb77btapf4ote67h4

Time Slicing in Mobile TV Broadcast Networks with Arbitrary Channel Bit Rates

C.-H. Hsu, M. Hefeeda
2009 IEEE INFOCOM 2009 - The 28th Conference on Computer Communications  
efficiently in real time.  ...  The base station needs to construct a transmission schedule for all bursts of different TV channels.  ...  The authors of [20] solve the problem of minimizing the weighted sum of the total task flow time and the preemption penalty, where the weight is adhoc.  ... 
doi:10.1109/infcom.2009.5062148 dblp:conf/infocom/HsuH09 fatcat:wfrl6tgoqzhonioq6j44zy7mde

A dynamic hybrid scheduling algorithm for heterogeneous asymmetric environments

Navrati Saxena, Cristina M. Pinotti, Kalyan Basu, Sajal K. Das
2005 International Journal of Parallel, Emergent and Distributed Systems  
One major advantage of this algorithm is dynamic computation of cut-off-point, used to segregate the popular and less-popular data items, without any prior knowledge or assumptions.  ...  The objective of this dissertation is to investigate and develop a novel hybrid scheduling platform by effectively combining broadcasting (push) of popular data and dissemination (pull) of less popular  ...  Then, for total push systems, the Multiple Broadcast Problem deals with finding the broadcast schedule on a multichannel environment which minimizes the Multiple Average Expected Delay (MAED), that is  ... 
doi:10.1080/17445760500094913 fatcat:dlatfsdkbngkxne2py22vr74dy
« Previous Showing results 1 — 15 out of 11,355 results