3 citations · 9 across the 21 of their papers we have counts for
4 papers · 1 filter
Matching through Embedding in Dense Graphs
Nitish K. Panigrahy, Prithwish Basu, Don Towsley
Finding optimal matchings in dense graphs is of general interest and of particular importance in social, transportation and biological networks. While developing optimal solutions…
Resource Allocation in One-dimensional Distributed Service Networks with Applications
Nitish K. Panigrahy, Prithwish Basu, Philippe Nain +4
We consider assignment policies that allocate resources to users, where both resources and users are located on a one-dimensional line. First, we consider unidirectional assignment…
On the Analysis of Spatially Constrained Power of Two Choice Policies
Nitish K. Panigrahy, Prithwish Basu, Don Towsley +2
We consider a class of power of two choice based assignment policies for allocating users to servers, where both users and servers are located on a two-dimensional Euclidean plane.…
Proximity Based Load Balancing Policies on Graphs: A Simulation Study
Nitish K. Panigrahy, Thirupathaiah Vasantam, Prithwish Basu +1
Distributed load balancing is the act of allocating jobs among a set of servers as evenly as possible. There are mainly two versions of the load balancing problem that have been st…