914 search results - page 23 / 183 » Branch and Bound on the Network Model |
GLOBECOM
2006
IEEE
15 years 3 months ago
2006
IEEE
— We consider a ring topology with limited or full switching capability as deployed in high bandwidth metro optical networks and develop a model to estimate the probability of bl...
78
Voted
COR
2008
14 years 9 months ago
2008
In this paper a two-level hierarchical model for the location of concentrators and routers in computers networks is presented. Given a set of candidate locations and the capacitie...
113
Voted
SPAA
1994
ACM
15 years 1 months ago
1994
ACM
We analyze the performance of greedy routing for array networks by providing bounds on the average delay and the average number of packets in the system for the dynamic routing pr...
PCI
2005
Springer
15 years 3 months ago
2005
Springer
The increasing popularity of all-optical networks has led to extensive research on the routing and wavelength assignment problem, also termed as the Routing and Path Coloring probl...
111
click to vote
PE
2011
Springer
14 years 4 months ago
2011
Springer
We introduce a new solution technique for closed product-form queueing networks that generalizes the Method of Moments (MoM), a recently proposed exact algorithm that is several o...