95
Voted
NETWORKS
2008
15 years 11 days ago
2008
Minimizing the number of add-drop multiplexers (ADMs) in a unidirectional SONET ring can be formulated as a graph decomposition problem. When traffic requirements are uniform and ...
NETWORKS
2008
15 years 11 days ago
2008
113
Voted
NETWORKS
2008
15 years 11 days ago
2008
101
Voted
NETWORKS
2008
15 years 11 days ago
2008
108
click to vote
NETWORKS
2008
15 years 11 days ago
2008
In a problem arising in grooming for two-period optical networks, it is required to decompose the complete graph on n vertices into subgraphs each containing at most C edges, so t...
112
Voted
NETWORKS
2008
15 years 11 days ago
2008
In this paper, we present a combined study of price competition and traffic control in a congested network. We study a model in which service providers own the routes in a network...
94
Voted
NETWORKS
2008
15 years 11 days ago
2008
Node pruning is a commonly used technique for solution acceleration in a dynamic programming network. In pruning, nodes are adaptively removed from the dynamic programming network...
82
Voted
NETWORKS
2008
15 years 11 days ago
2008
In this paper, we develop a method to count the number of spanning trees in certain classes of double fixed-step loop networks with nonconstant steps. More specifically our techni...
74
Voted
NETWORKS
2008
15 years 11 days ago
2008
