In this paper we extend the technique provided in [6] to allow the determination of lower bounds on the broadcasting and gossiping time required by the so-called «restricted» protocols. Informally, a protocol is (i,o)-restricted at a given processor if every outgoing activation of an arc depends on at most i previous incoming activations and...
-
January 1999 (v1)ReportUploaded on: December 3, 2022
-
November 2002 (v1)Report
In this paper we present a new model able to combine quality of service and mobility aspects in wireless ATM networks. Namely, besides the hop count and load parameters of the basic ATM layouts, we introduce a new notion of distance, that estimates the time needed to reconstruct the virtual channel of a wireless user when it moves through the...
Uploaded on: December 3, 2022 -
February 19, 2010 (v1)Journal article
We study the performances of Nash equilibria in isolation games, a class of competitive location games recently introduced in Zhao et al. (Proc. of the 19th International Symposium on Algorithms and Computation (ISAAC), pp. 148–159, 2008). For all the cases in which the existence of Nash equilibria has been shown, we give tight or...
Uploaded on: December 3, 2022 -
2008 (v1)Journal article
International audience
Uploaded on: December 4, 2022 -
June 2003 (v1)Journal article
In this paper we consider a combinatorial problem consisting in finding an acyclic orientation of a graph which minimizes the maximum number of changes of orientations along a given set of dipaths. A change of orientation along a dipath occurs when two consecutive arcs are discordly oriented. Such maximum number of changes of orientations is...
Uploaded on: December 3, 2022 -
June 1997 (v1)Conference paper
International audience
Uploaded on: February 22, 2023 -
June 1997 (v1)Conference paper
International audience
Uploaded on: December 3, 2022 -
September 5, 2010 (v1)Journal article
International audience
Uploaded on: December 3, 2022 -
January 1, 2010 (v1)Book section
In an optical network using the wavelength division multiplexing (WDM) technology, routing a request consists in assigning it a route in the physical network and a wavelength. If each request uses $1/g$ of the bandwidth of the wavelength, we will say that the grooming factor is $g$. That means that on a given edge of the network we can groom...
Uploaded on: December 3, 2022