147 search results - page 3 / 30 » The External Network Problem with Edge- or Arc-Connectivity ... |
SIAMCOMP
2010
13 years 23 days ago
2010
The (undirected) Steiner Network problem is: given a graph = ( , ) with edge/node-weights and edge-connectivity requirements { ( , ) : , }, find a minimumweight subgraph of conta...
GLOBECOM
2006
IEEE
14 years 2 days ago
2006
IEEE
— This paper examines burst contention resolution problems in optical burst switching (OBS) networks. Since burst contentions take place i) when the network is congested by incre...
ANCS
2005
ACM
13 years 11 months ago
2005
ACM
Network edge packet-processing systems, as are commonly implemented on network processor platforms, are increasingly required to support a rich set of services. These multi-servic...
INFOCOM
2005
IEEE
13 years 11 months ago
2005
IEEE
— We consider the problem of link scheduling in a sensor network employing a TDMA MAC protocol. Our link scheduling algorithm involves two phases. In the first phase, we assign ...
PERCOM
2006
ACM
14 years 5 months ago
2006
ACM
A recent flooding algorithm [1] guaranteed correctness for networks with dynamic edges and fixed nodes. The algorithm provided a partial answer to the highly dynamic network (HDN)...