In this paper we introduce and investigate a new" path optimization problem which we denote as the All Hops Optimal Path AHOP problem. The problem involves identifying, for a...
In the MINIMUM BOUNDED DEGREE SPANNING TREE problem, we are given an undirected graph with a degree upper bound Bv on each vertex v, and the task is to find a spanning tree of min...
In wireless mesh networks such as WLAN (IEEE 802.11s) or WMAN (IEEE 802.11), each node should help to relay packets of neighboring nodes toward gateway using multi-hop routing mec...
We present a new planning algorithm that formulates the planning problem as a counting satisfiability problem in which the number of available solutions guides the planner determ...
— We consider the problem of serving multicast flows in a crossbar switch. We show that linear network coding across packets of a flow can sustain traffic patterns that cannot...