Let G = (V, E) be an weighted undirected graph on n vertices and m edges, and let dG be its shortest path metric. We present two simple deterministic algorithms for approximating ...
We consider a class of queueing networks referred to as “generalized constrained queueing networks” which form the basis of several different communication networks and inform...
Packet sampling is widely used in network monitoring. Sampled packet streams are often used to determine flow-level statistics of network traffic. To date there is conflicting e...
Bruno F. Ribeiro, Donald F. Towsley, Tao Ye, Jean ...
In many energy-constrained wireless sensor networks, nodes cooperatively forward correlated sensed data to data sinks. In order to reduce the communication cost (e.g. overall ener...
Junning Liu, Micah Adler, Donald F. Towsley, Chun ...
— This paper addresses the problem of classifying places in the environment of a mobile robot into semantic categories. We believe that semantic information about the type of pla...