Packet scheduling with fragmentation

Naaman, Nir; Rom, Raphaël

doi:10.1109/infcom.2002.1019285

Cited by 21 publications

(10 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Menakerman and Rom [20] and Naaman and Rom [24] were the first to develop algorithms for bin packing with item fragmentation, however, the problems studies in [20] and [24] are different from our problems. For a version of BP-SPF in which the number of bins, N , is given, and the objective is to minimize the total cost incurred by fragmentation, the paper [20] studies the performance of simple algorithms such as First-Fit, Next-Fit, and First-Fit-Decreasing, and shows that for any instance which can be packed in N bins using f * splits of items, each of these algorithms might end up using f * + N − 1 splits.…”

Section: Fernandez De La Vega and Luekermentioning

confidence: 88%

See 1 more Smart Citation

Approximation Schemes for Packing with Item Fragmentation

2007

View full text Add to dashboard Cite

Section: Fernandez De La Vega and Luekermentioning

confidence: 88%

“…This thesis focused on the offline version of the problems. Menakerman and Rom [20] and Naaman and Rom [24] gave analysis of simple online algorithms. It would be interesting to improve the CHAPTER 8.…”

Section: Future Workmentioning

confidence: 99%

Approximation Schemes for Packing with Item Fragmentation

2007

View full text Add to dashboard Cite

“…If this hypothesis is satisfied, we propose a variant of NF, Next Fit with Cuts (NFC) as an algorithmic solution. A similar approach was used for another purpose under the name of NF f in [10], [11]. First, the capacities of bin classes are sorted in decreasing order.…”

Section: A Next Fit With Cuts (Nfc) For the Auxiliary Problemmentioning

confidence: 99%

A packing problem approach to energy-aware load distribution in Clouds

Carli¹,

Henriot²,

Cohen³

et al. 2016

Sustainable Computing: Informatics and Systems

View full text Add to dashboard Cite

International audienceThe Cloud Computing paradigm consists in providing customers with virtual services of the quality which meets customers’ requirements. The efficiency of infrastructure exploitation may be expressed by the electrical energy consumption of computing centers, amongst others.We propose to model the energy consumption of private Clouds by a variant of the Bin Packing problem which we analyze next from a theoretical point of view. We advance on-line and off-line approximation algorithms to solve our problem to balance the load either on-the-fly or at the planning stage. In addition to the computation of the approximation factors of these two algorithms, we evaluate their performance experimentally. The quality of the results is encouraging, which makes a packing approach a serious candidate to model energy-aware load balancing in Cloud Computing

show abstract

“…The main difference between our work and this body of research (using GAP terminology) is that we study the benefits of, as well as algorithms for, exploiting the ability to satisfy the packing requirement of every job by splitting this requirement among several machines. Several works [20], [21] considered splittable-assignment of objects to bins, with added overhead (depending on the specific model). Our model allows for such splittable-assignment but incurs no overheads, thus making it generally applicable.…”

Section: Related Workmentioning

confidence: 99%

Cellular multi-coverage with non-uniform rates

Gurewitz

Sandomirsky

Scalosub

2014

IEEE INFOCOM 2014 - IEEE Conference on Computer Communications

View full text Add to dashboard Cite

Recent advances in the standardization of 4G cellular networks introduce the notion of multi-coverage, where multiple base stations may collaboratively satisfy the demands of mobile users. We provide a theoretical model for studying such multi-coverage environments, in highly heterogeneous settings, where users demands and profits may vary, as can base stations' capacities and the rates with which they can service the users.Whereas previous works provided solutions that were only applicable to scenarios where rates are uniform throughout the network, or allowed a mobile user to be serviced by at most one base station, we present several algorithms for the multi-coverage problem in the presence of non-uniform rates, and analyze their performance. We complete our study by a simulation study that further validates our results and provides further insight into algorithm design, depending on the users' characteristics.

show abstract

Packet scheduling with fragmentation

Cited by 21 publications

References 15 publications

Approximation Schemes for Packing with Item Fragmentation

Approximation Schemes for Packing with Item Fragmentation

A packing problem approach to energy-aware load distribution in Clouds

Cellular multi-coverage with non-uniform rates

Contact Info

Product

Resources

About