An important problem in both wireless and wired communication networks is to be able to efficiently multicast information to a group of network sites. Multicasting reduces the transmission overhead of both wireless and wired networks and the time it takes for all the nodes in the subset to receive the information. Since transmission bandwidth is a scarce commodity especially in wireless network...

In this paper we study the NP-complete problem of finding small k-dominating sets in general graphs, which allow k−1 nodes to fail and still dominate the graph. The classic minimum dominating set problem is a special case with k = 1. We show that the approach of having at least k dominating nodes in the neighborhood of every node is not optimal. For each α > 1 it can give solutions k α times la...

In this paper, we consider systems that can be modeled as directed acyclic graphs such that nodes represent components of the system and directed edges represent fault propagation between components. Some components can be equipped with alarms that ring when they detect faulty (abnormal) behavior. We study algorithms that attempt to minimize the number of alarms to be placed so that a fault at ...

We consider a distributed computing framework where the distributed nodes have different communication capabilities, motivated by the heterogeneous networks in data centers and mobile edge computing systems. Following the structure of MapReduce, this framework consists of Map computation phase, Shuffle phase, and Reduce computation phase. The Shuffle phase allows distributed nodes to exchange i...

This paper investigates minimum time and minimum cost path problems in street networks regulated by periodic traffic lights. We show that the minimum time path problem is polynomially solvable. On the other hand, minimum cost path problems are generally NP-hard. Special, realistic, cases which are polynomially solvable are discussed. Dynamic shortest path problems often arise in transportation ...

Let G = (V; E) be an undirected graph with a capacity function u : E!< + and let S 1 ; S 2 ; : : : ; S k be k commodities, where each S i consists of a pair of nodes. A set X of nodes is called feasible if it contains no S i , and a cut (X; X) is called feasible if X is feasible. Several optimization problems on feasible cuts are shown to be NP-hard. A 2-approximation algorithm for the minimum-...

Given a graph with edge costs, the power of a node is the maximum cost of an edge leaving it, and the power of a graph is the sum of the powers of its nodes. Motivated by applications in wireless networks, we consider several fundamental undirected network design problems under the power minimization criteria. The Minimum-Power Edge-Cover (MPEC) problem is: given a graph G = (V, E) with edge co...

we report a case of a 68-year-old female who was a known case of diabetes mellitus and chronic liver disease and presented with complaints of dry cough and other constitutional symptoms since one month. during initial investigations, the patient was found to have peripheral blood eosinophilia. upon investigating further,the patient was found to have mediastinal lymphadenopathy and fine-needle a...

Given a set of terminals, each associated with a positive number denoting the traffic to be routed to a central terminal (root), the Capacitated Minimum Spanning Tree (CMST) problem asks for a minimum spanning tree, spanning all terminals, such that the amount of traffic routed from a subtree, linked to the root by an edge, does not exceed the given capacity constraint . The CMST problem is NP-...

In this paper, we propose a new minimum total communication distance (TCD) algorithm and an optimal TCD algorithm for broadcast in a 2-dimension mesh. The former generates a minimum TCD from a given source node, and the latter guarantees a minimum TCD among all the possible source nodes. These algorithms can be generalized to a d-dimensional mesh or torus. TCD can potentially be used as a measu...