In this paper, the problem of finding the decentralized flow control of a BCMP network is investigated. The packets of each of the users correspond to different classes of customers. The servers in the network are exponential and serve packets with FIFO policy. Each network user operates with either a state-dependent arrival rate (i.e. an arrival rate which depends upon the number of the user's...

In this paper, we consider to apply a primal-dual proximal point algorithm to the multicommodity network flow problem. A remarkable feature of the algorithm consists in how to find an approximate saddle point of the augmented Lagrangian of the problem. In particular, at each iteration, an approximate solution of the subproblem always satisfies the flow conservation equations for all commodities...

A formal model for an analysis of an information flow in interconnection networks is presented. It is based on timed process algebra which can express also network properties. The information flow is based on a concept of deducibility on composition. Robustness of systems against network timing attacks is defined. A variety of different security properties which reflect different security requi...

Centralitymeasures, or at least popular interpretations of thesemeasures,make implicit assumptions about the manner in which traffic flows through a network. For example, some measures count only geodesic paths, apparently assuming that whatever flows through the network only moves along the shortest possible paths. This paper lays out a typology of network flows based on two dimensions of vari...

We present an achievable rate for general deterministic relay networks, with broadcasting at the transmitters and interference at the receivers. In particular we show that if the optimizing distribution for the information-theoretic cut-set bound is a product distribution, then we have a complete characterization of the achievable rates for such networks. For linear deterministic finite-field m...

The main goal of this project is to investigate the network flow allocation (routing) problem, and devise a practical algorithm for its solution. Particularly, we plan to investigate the trade-off between the algorithm’s optimality and its implementability; therefore, obtaining an 2-suboptimal solution would be sufficient, if this will speed-up convergence or simplify the overall algorithm. Thi...

Network flow problems are central problems in operations research, computer science, and engineering and they arise in many real world applications. Starting with early work in linear programming and spurred by the classic book of Ford and Fulkerson [26], the study of such problems has led to continuing improvements in the efficiency of network flow algorithms. In spite of the long history of t...

Recent network analysis research has made remarkable progress on studying complex networks in a social context with machine learning techniques. One example of such a complex network is the system data of the New York Citibike bike sharing program, which consists of the data from 49 million bike trips in New York City since July 2013. By inspecting the dataset, we find out that significantly mo...

In this paper, motivated by applications of ordinary (distance) spanners in communication networks and to address such issues as bandwidth constraints on network links, link failures, network survivability, etc., we introduce a new notion of flow spanner, where one seeks a spanning subgraph H = (V,E′) of a graph G = (V,E) which provides a “good” approximation of the source-sink flows in G. We f...

conventional passive distribution networks are changing to modern active distribution networks which are not radial. conventional load flow methods should be modified for new distribution networks analysis. in modern distribution networks distributed generation (dg) units are embedded with conventional and/or renewable resources. dg units are generally modeled as pv or pq nodes which inject ...