相关论文: Optimal Resource Allocation for Network Protection…
In this paper we consider several problems concerning packet routing in distributed systems. Each problem is formulated using terms from Graph Theory and for each problem we present efficient, novel, algorithmic techniques for computing…
Software Defined Networking (SDN) brings numbers of advantages along with many challenges. One particular concern is on the control-plane resilience, while the existing protection approaches proposed for SDN networks mainly focus on…
This article studies a problem of strategic network inspection, in which a defender (agency) is tasked with detecting the presence of multiple attacks in the network. An inspection strategy entails monitoring the network components,…
In optical-processing-enabled network, transitional lightpaths crossing the same node could be optically encoded to each other to achieve greater spectral efficiency. In this context, we present a new research problem, entitled, routing,…
We study a problem of fundamental importance to ICNs, namely, minimizing routing costs by jointly optimizing caching and routing decisions over an arbitrary network topology. We consider both source routing and hop-by-hop routing settings.…
Competition and collaboration are at the heart of multi-agent probabilistic spreading processes. The battle on public opinion and competitive marketing campaigns are typical examples of the former, while the joint spread of multiple…
We consider the problem of optimally allocating resources across a set of transmitters and receivers in a wireless network. The resulting optimization problem takes the form of constrained statistical learning, in which solutions can be…
A general open problem in networking is: what are the fundamental limits to the performance that is achievable with some given amount of resources? More specifically, if each node in the network has information about only its $1$-hop…
Adding edges between layers of interconnected networks is an important way to optimize the spreading dynamics. While previous studies mostly focus on the case of adding a single edge, the theoretical optimal strategy for adding multiple…
The problem of exact repair of a failed node in multi-hop networked distributed storage systems is considered. Contrary to the most of the current studies which model the repair process by the direct links from surviving nodes to the new…
Rumor propagation in social networks undermines social stability and public trust, calling for interventions that are both effective and resource-efficient. We develop a node-level, time-varying optimal intervention framework that allocates…
In this work, we formulate and study a data dissemination problem, which can be viewed as a generalization of the index coding problem and of the data exchange problem to networks with an arbitrary topology. We define $r$-solvable networks,…
Studies on the propagation of malware in mobile networks have revealed that the spread of malware can be highly inhomogeneous. Platform diversity, contact list utilization by the malware, clustering in the network structure, etc. can also…
The problem of finding the optimal set of source nodes in a diffusion network that maximizes the spread of information, influence, and diseases in a limited amount of time depends dramatically on the underlying temporal dynamics of the…
This paper studies the optimal resource allocation problem within a multi-agent network composed of both autonomous agents and humans. The main challenge lies in the globally coupled constraints that link the decisions of autonomous agents…
The vast majority of strategies aimed at controlling contagion processes on networks considers the connectivity pattern of the system as either quenched or annealed. However, in the real world many networks are highly dynamical and evolve…
In this paper, we study distributed storage problems over unidirectional ring networks. A lower bound on the reconstructing bandwidth to recover total original data for each user is proposed, and it is achievable for arbitrary parameters.…
We study distributed optimization problems over a network when the communication between the nodes is constrained, and so information that is exchanged between the nodes must be quantized. This imperfect communication poses a fundamental…
Spreading processes represent a very efficient tool to investigate the structural properties of networks and the relative importance of their constituents, and have been widely used to this aim in static networks. Here we consider simple…
We study the problem of storing a data object in a set of data nodes that fail independently with given probabilities. Our problem is a natural generalization of a homogenous storage allocation problem where all the nodes had the same…