Publications

Next generation fixed wireless broadband networks are being increasingly deployed as mesh networks in order to provide and extend access to the internet.

Fast shared restoration is critical to the success of WDM mesh networking. A restricted form of sharing called K-sharing was recently proposed, which allows rapid, signaling-free restoration.

In this paper, we present novel routing and design algorithms for K-shared networks. We also show that a practical version of the routing problem is NP-Hard and present heuristics to solve it.

Routing and flow control mechanisms have been used in wide area, local area, and metropolitan area networks.

Routing and flow control mechanisms have been used in wide area, local area, and metropolitan area networks.

Shortest path algorithms such as SPF and CSPF are widely used in online traffic engineering where connections need to be set up one at a time as connection requests arrive sequentially.

Shortest path algorithms such as shortest path first (SPF) and constrained shortest path first (CSPF) are widely used in online traffic engineering where connections need to be set up one at a time

Energy conservation is drawing increasing attention in data networking.

Energy conservation is drawing increasing attention in data networking.

We study routing and scheduling in multihop wireless networks. When data is transmitted from its source node to its destination node it may go through other wireless nodes as intermediate hops.