3 citations · 3 across the 4 of their papers we have counts for
Showing cs.NIShow all
3 papers · 1 filter
cs.NI2018★ 3 cited
Shortest Path and Maximum Flow Problems Under Service Function Chaining Constraints
Gamal Sallam, Gagan R. Gupta, Bin Li +1
With the advent of Network Function Virtualization (NFV), Physical Network Functions (PNFs) are gradually being replaced by Virtual Network Functions (VNFs) that are hosted on gene…
cs.NI2015
Node-based Service-Balanced Scheduling for Provably Guaranteed Throughput and Evacuation Time Performance
Yu Sang, Gagan R. Gupta, Bo Ji
This paper focuses on the design of provably efficient online link scheduling algorithms for multi-hop wireless networks. We consider single-hop traffic and the one-hop interferenc…
cs.NI2009
Node Weighted Scheduling
Gagan Raj Gupta, Sujay Sanghavi, Ness B. Shroff
This paper proposes a new class of online policies for scheduling in input-buffered crossbar switches. Our policies are throughput optimal for a large class of arrival processes wh…