#### Filter Results:

#### Publication Year

2004

2017

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Michele Flammini, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks
- ISAAC
- 2005

The problem of grooming is central in studies of optical networks. In graph-theoretic terms, this can be viewed as assigning colors to the lightpaths so that at most g of them (g being the grooming factor) can share one edge. The cost of a coloring is the number of optical switches (ADMs); each lightpath uses two ADM's, one at each endpoint, and in case g… (More)

- George B. Mertzios, Ignasi Sau, Mordechai Shalom, Shmuel Zaks
- IEEE/ACM Transactions on Networking
- 2010

The placement of regenerators in optical networks has become an active area of research during the last few years. Given a set of lightpaths in a network <i>G</i> and a positive integer <i>d</i>, regenerators must be placed in such a way that in any lightpath there are no more than <i>d</i> hops without meeting a regenerator. The cost function we consider… (More)

- Michele Flammini, Mordechai Shalom, Shmuel Zaks
- J. Parallel Distrib. Comput.
- 2006

- Michele Flammini, Gianpiero Monaco, +4 authors Shmuel Zaks
- 2009 IEEE International Symposium on Parallel…
- 2009

We consider a scheduling problem in which a bounded number of jobs can be processed simultaneously by a single machine. The input is a set of n jobs J = {J<inf>1</inf>, … , J<inf>n</inf>}. Each job, J<inf>j</inf>, is associated with an interval [s<inf>j</inf>, c<inf>j</inf>] along which it should be processed. Also given is the… (More)

- Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks
- Euro-Par
- 2008

SONET ADMs are dominant cost factors in WDM/SONET rings. Whereas most previous papers on the topic concentrated on the number of wavelengths assigned to a given set of lightpaths, more recent papers argue that the number of ADMs is a more realistic cost measure. Some of these works discuss various heuristic algorithms for this problem, and the best known… (More)

- Arman Boyaci, Tinaz Ekim, Mordechai Shalom, Shmuel Zaks
- ArXiv
- 2013

Given a tree and a set P of non-trivial simple paths on it, Vpt(P) is the VPT graph (i.e. the vertex intersection graph) of the paths P of the tree T , and Ept(P) is the EPT graph (i.e. the edge intersection graph) of P. These graphs have been extensively studied in the literature. Given two (edge) intersecting paths in a graph, their split vertices is the… (More)

- Mordechai Shalom, Walter Unger, Shmuel Zaks
- FUN
- 2007

- George B. Mertzios, Mordechai Shalom, Ariella Voloshin, Prudence W. H. Wong, Shmuel Zaks
- 2012 IEEE 26th International Parallel and…
- 2012

We consider the following fundamental scheduling problem in which the input consists of n jobs to be scheduled on a set of identical machines of bounded capacity g (which is the maximal number of jobs that can be processed simultaneously by a single machine). Each job is associated with a start time and a completion time, it is supposed to be processed from… (More)

- Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks
- J. Parallel Distrib. Comput.
- 2006

We consider the problem of grooming paths in all-optical networks with tree topology so as to minimize the switching cost, measured by the total number of used ADMs. We first present efficient approximation algorithms with approximation factor of 2 ln(δ · g) + o(ln(δ · g)) for any fixed node degree bound δ and grooming factor g, and 2 ln g + o(ln g) in… (More)