activity
20172020
most citedA Game-Theoretic Approach to Multi-Objective Resource Sharing and Allocation in Mobile Edge Clouds

15 citations · 33 across the 5 of their papers we have counts for

collaborators

7 papers

cs.NI2020★ 2 cited

Let's Share: A Game-Theoretic Framework for Resource Sharing in Mobile Edge Clouds

Faheem Zafari, Kin K. Leung, Don Towsley +3

Mobile edge computing seeks to provide resources to different delay-sensitive applications. This is a challenging problem as an edge cloud-service provider may not have sufficient…

cs.GT2020

Resource Sharing in the Edge: A Distributed Bargaining-Theoretic Approach

Faheem Zafari, Prithwish Basu, Kin K. Leung +3

The growing demand for edge computing resources, particularly due to increasing popularity of Internet of Things (IoT), and distributed machine/deep learning applications poses a s…

cs.GT2018★ 15 cited

A Game-Theoretic Approach to Multi-Objective Resource Sharing and Allocation in Mobile Edge Clouds

Faheem Zafari, Jian Li, Kin K Leung +2

Mobile edge computing seeks to provide resources to different delay-sensitive applications. However, allocating the limited edge resources to a number of applications is a challeng…

cs.SI2018★ 11 cited

Network Classification in Temporal Networks Using Motifs

Kun Tu, Jian Li, Don Towsley +2

Network classification has a variety of applications, such as detecting communities within networks and finding similarities between those representing different aspects of the rea…

eess.SP2018★ 4 cited

Quickest Detection of Dynamic Events in Networks

Shaofeng Zou, Venugopal V. Veeravalli, Jian Li +1

The problem of quickest detection of dynamic events in networks is studied. At some unknown time, an event occurs, and a number of nodes in the network are affected by the event, i…

cs.NI2018★ 1 cited

Joint Data Compression and Caching: Approaching Optimality with Guarantees

Jian Li, Faheem Zafari, Don Towsley +2

We consider the problem of optimally compressing and caching data across a communication network. Given the data generated at edge nodes and a routing path, our goal is to determin…

cs.NI2017

Network Cache Design under Stationary Requests: Exact Analysis and Poisson Approximation

Nitish K. Panigrahy, Jian Li, Don Towsley +1

The design of caching algorithms to maximize hit probability has been extensively studied. In this paper, we associate each content with a utility, which is a function of either th…