Sciweavers

94 search results - page 7 / 19
» Convex analysis of generalized flow networks
Sort
View
83
Voted
IWCMC
2010
ACM
15 years 2 months ago
Estimating routing symmetry on single links by passive flow measurements
The assumption of routing symmetry is often embedded into traffic analysis and classification tools. This paper uses passively captured network data to estimate the amount of tra...
Wolfgang John, Maurizio Dusi, Kimberly C. Claffy
SBCCI
2005
ACM
123views VLSI» more  SBCCI 2005»
15 years 3 months ago
Fault tolerance overhead in network-on-chip flow control schemes
Flow control mechanisms in Network-on-Chip (NoC) architectures are critical for fast packet propagation across the network and for low idling of network resources. Buffer manageme...
Antonio Pullini, Federico Angiolini, Davide Bertoz...
EOR
2006
107views more  EOR 2006»
14 years 9 months ago
Longest path analysis in networks of queues: Dynamic scheduling problems
In this paper, we develop an acyclic network of queues for the design of a dynamic flow shop, where each service station represents a machine. The orders arrive at the input stati...
Amir Azaron, Hideki Katagiri, Kosuke Kato, Masatos...
COCOON
2007
Springer
15 years 3 months ago
Connected Coloring Completion for General Graphs: Algorithms and Complexity
An r-component connected coloring of a graph is a coloring of the vertices so that each color class induces a subgraph having at most r connected components. The concept has been w...
Benny Chor, Michael R. Fellows, Mark A. Ragan, Igo...
NOMS
2008
IEEE
105views Communications» more  NOMS 2008»
15 years 4 months ago
Characterization of IP flows eligible for lambda-connections in optical networks
Abstract—The advance on data transmission in optical networks has allowed data forwarding decisions to be taken at multiple levels in the protocol stack (e.g., at network and opt...
Tiago Fioreze, Mattijs Oude Wolbers, Remco van de ...