Filters








229 Hits in 4.8 sec

Approximating call-scheduling makespan in all-optical networks

Luca Becchetti, Miriam Di Ianni, Alberto Marchetti-Spaccamela
2004 Journal of Discrete Algorithms  
We study the problem of routing and scheduling requests of limited durations in all-optical networks with restrictions on the number of available wavelengths on each link.  ...  We also propose different approximation algorithms for stars, trees and in trees of rings.  ...  The scheduling of calls of limited durations in all-optical networks has been considered in [4] for chains and rings; the authors propose approximation algorithms with ratios 5 and 12 + ε respectively  ... 
doi:10.1016/j.jda.2004.04.008 fatcat:6eopeel6l5fhlb36bd2w2i3p3u

Approximating Call-Scheduling Makespan in All-Optical Networks [chapter]

Luca Becchetti, Miriam Di Ianni, Alberto Marchetti-Spaccamela
2000 Lecture Notes in Computer Science  
We study the problem of routing and scheduling requests of limited durations in an all-optical network.  ...  Independently from the relationship with path coloring we propose different approximation algorithms for call scheduling in trees and in trees of rings.  ...  The scheduling of calls of limited durations in all-optical networks has been considered in [4] for chains and rings.  ... 
doi:10.1007/3-540-40064-8_3 fatcat:pipp733zozb25fypjixnx4daxe

Approximation Algorithms for Routing and Call Scheduling in All-Optical Chains and Rings [chapter]

Luca Becchetti, Miriam Di Ianni, Alberto Marchetti-Spaccamela
1999 Lecture Notes in Computer Science  
Scheduling calls with minimum makespan has been considered in non optical networks.  ...  We study the problem of routing and scheduling requests of limited durations in an all-optical network.  ...  Conclusions In this paper we have considered the Call Scheduling problem in all-optical, networks.  ... 
doi:10.1007/3-540-46691-6_15 fatcat:6zxi5fl7bjbclcftvn6rkpkehy

Approximation algorithms for routing and call scheduling in all-optical chains and rings

Luca Becchetti, Miriam Di Ianni, Alberto Marchetti-Spaccamela
2002 Theoretical Computer Science  
We study the problem of routing and scheduling requests of limited durations in an all-optical network.  ...  The goal is minimizing the overall time needed to serve all requests. We propose constant approximation algorithms for both ring and chain networks.  ...  Conclusions In this paper, we have considered the call scheduling problem in all-optical, networks.  ... 
doi:10.1016/s0304-3975(01)00255-9 fatcat:w3sajopqavebjftoqckb2lvtoy

Competitive analysis for online scheduling in software-defined optical WAN

Su Jia, Xin Jin, Golnaz Ghasemiesfeh, Jiaxin Ding, Jie Gao
2017 IEEE INFOCOM 2017 - IEEE Conference on Computer Communications  
The goal of the scheduling problem is to minimize the makespan (the time to finish all transfers) or the total sum of completion times.  ...  This paper presents approximation algorithms and theoretical analysis for the online transfer scheduling problem over optical WANs.  ...  There is a family of scheduling problems called scheduling with conflicts (called non-clairvoyant scheduling) [23] , in which jobs could be in conflict with each other and no two jobs in conflict can  ... 
doi:10.1109/infocom.2017.8056969 dblp:conf/infocom/JiaJGDG17 fatcat:csqvjbyewfhdpiq4ehq3y43pdq

Subject Index

2004 Journal of Discrete Algorithms  
Approximating schedules for dynamic process graphs efficiently, 471; Approximating call- scheduling makespan in all-optical networks, 501 Scheduling problems Structural properties and tractability  ...  Compact directed acyclic word graphs for a slid- ing window, 33 Optical networks Approximating call-scheduling makespan in all- optical networks, 501 Origami Packing two disks into a polygonal environment  ... 
doi:10.1016/s1570-8667(04)00076-0 fatcat:3igwdxr5pba53eev4y6a2jzgie

Spectrum Assignment in Mesh Elastic Optical Networks

Mahmoud Fayez, Iyad Katib, George N. Rouskas, H. M. Faheem
2015 2015 24th International Conference on Computer Communication and Networks (ICCCN)  
Spectrum assignment has emerged as the key design and control problem in elastic optical networks.  ...  We have shown that spectrum assignment in networks of general topology is a special case of scheduling multiprocessor tasks on dedicated processors.  ...  The algorithm then repeatedly calls two procedures, ScheduleTasks() and AdvanceTime(), until all the tasks in list L have been scheduled (i.e., until L becomes empty).  ... 
doi:10.1109/icccn.2015.7288470 dblp:conf/icccn/FayezKRF15 fatcat:wp2hubrszzeszperuu7wr4pr4e

Scheduling of Independent Dedicated Multiprocessor Tasks [chapter]

Evripidis Bampis, Massimiliano Caramia, Jiří Fiala, Aleksei V. Fishkin, Antonio Iovanella
2002 Lecture Notes in Computer Science  
Recently, in [12] , it has been proven that in the case when all tasks have unit processing time the problem cannot be approximated within a factor of m 1 2 −ε , neither for some ε > 0, unless P= NP; nor  ...  to minimize the makespan.  ...  We say that an algorithm A is a ρ-approximation algorithm for all problem instances it outputs a schedule with the makespan at most ρ · OP T , where OP T is the makespan of the optimal schedule.  ... 
doi:10.1007/3-540-36136-7_35 fatcat:mo42clnlibd3tpnx7t2mebkld4

The scheduling and wavelength assignment problem in optical WDM networks

E. Bampis, G.N. Rouskas
2002 Journal of Lightwave Technology  
We consider a scheduling problem, which we call the scheduling and wavelength assignment (SWA) problem, arising in optical networks that are based on the wavelength-divisionmultiplexing (WDM) technology  ...  Index Terms-Optical networks, packet scheduling, wavelength assignment, wavelength division multiplexing.  ...  Rouskas, Senior Member, IEEE Abstract-We consider a scheduling problem, which we call the scheduling and wavelength assignment (SWA) problem, arising in optical networks that are based on the wavelength-divisionmultiplexing  ... 
doi:10.1109/jlt.2002.1007930 fatcat:yf2uxxlf7fgitaclrxefbbo2pe

Optimizing mmWave Wireless Backhaul Scheduling

Edgar Arribas, Antonio Fernandez Anta, Dariuz Kowalski, Vincenzo Mancuso, Miguel Mosteiro, Joerg Widmer, Prudence W.H. Wong
2019 IEEE Transactions on Mobile Computing  
Plenty of work has been done in scheduling communications in related models, including different wireless and optical networks.  ...  We call such optimization problem mmWave Backhaul Scheduling (MMWBS).  ...  The length of such a schedule is called the makespan. In this paper, we use S to indicate a schedule and |S| for its makespan.  ... 
doi:10.1109/tmc.2019.2924884 fatcat:zpphbjy64nfxjk4om73zgbijqi

An open shop approach in approximating optimal data transmission duration in WDM networks [article]

Timotheos Aslanidis, Stavros Birmpilis
2017 arXiv   pre-print
In the past decade Optical WDM Networks (Wavelength Division Multiplexing) are being used quite often and especially as far as broadband applications are concerned.  ...  In this paper we have reduced PBS to Open Shop Scheduling and designed variations of polynomially solvable instances of Open Shop to approximate PBS.  ...  In WDM network an optic fiber may be split in a number of channels depending on the frequency. Each of these channels corresponds to a specific wavelength.  ... 
arXiv:1701.02030v1 fatcat:clluediyyzglzjcuwefbyq3w5u

Page 5258 of Mathematical Reviews Vol. , Issue 98H [page]

1998 Mathematical Reviews  
In the distributed scheduling problem, there are n agents, each with a task to schedule, and m processors; the problem is to schedule tasks on the processors so as to minimize the makespan.  ...  which has a mesh of optical buses as its communication network.  ... 

Workflow scheduling in e-Science networks

Eun-Sung Jung, Sanjay Ranka, Sartaj Sahni
2011 2011 IEEE Symposium on Computers and Communications (ISCC)  
We solve workflow scheduling problems in e-Science networks, whose goal is minimizing either makespan or network resource consumption by jointly scheduling heterogeneous resources such as compute and network  ...  We evaluate our algorithms against a well-known list scheduling algorithm in e-Science networks whose size is relatively small.  ...  CCR for all algorithm when the number of nodes in a workflow is 3 in the Abilene network Figure 7 . 7 Makespan vs.  ... 
doi:10.1109/iscc.2011.5983875 dblp:conf/iscc/JungRS11 fatcat:c5x353flz5eenailtmc2kuly7e

Routing equal-size messages on a slotted ring

Dariusz Dereniowski, Wiesław Kubiak
2011 Journal of Scheduling  
The due-dates are relative to the beginning of slots, not to the beginning of schedule. The problem consists in minimizing either the number of slots or the makespan of the schedule.  ...  We deal with the problem of routing messages on a slotted ring network in this paper.  ...  The topology of the DAVID network is a Wide Area Network consisting of several optical Metropolitan Area Networks (MAN).  ... 
doi:10.1007/s10951-011-0259-4 fatcat:l4f43zmsq5h4tlfktiwpkfcujq

Exploiting incomplete information to manage multiprocessor tasks with variable arrival rates

Paolo Dell'Olmo, Antonio Iovanella, Guglielmo Lulli, Benedetto Scoppola
2008 Computers & Operations Research  
In this paper a semion-line algorithm for scheduling multiprocessor tasks with partial information is proposed.  ...  We consider the case in which it is 1 possible to exploit probabilistic information and use this information to obtain better solutions in comparison with standard non clairvoyant on-line algorithms.  ...  Figure 1 :Figure 2 : 12 A passive-star-based local optical WDM network Multi-destination data packets and a transmission schedule. 2 MTS models with respect to available information: state of the art  ... 
doi:10.1016/j.cor.2006.09.005 fatcat:xzs5dxrbnjcl5fl3y5vcnbc57e
« Previous Showing results 1 — 15 out of 229 results