Let G = (N, A) be a network with a designated source node s, a designated sink node t, and a finite integral capacity uij < U on each arc (ij) E A. An elementary K-flow is a flow of K units from s to t such that the flow on each arc is 0 or 1. A K-route flow is a flow from s to t that may be expressed as a non-negative linear sum of elementary Kflows. In this paper, we show how to determine a m...

In this paper, we continue our development of algorithms used for topological network discovery. We present native P system versions of two fundamental problems in graph theory: finding the maximum number of edgeand node-disjoint paths between a source node and target node. We start from the standard depth-first-search maximum flow algorithms, but our approach is totally distributed, when initi...

Abstract: This paper studies the mathematical modelling of Internet congestion control. Differently to previous models, which consider either the link capacity or the node processing capability as the constraints, here we take both of them into account, i.e., the aggregate flow rate on a link cannot exceed the link capacity and the aggregate flow rate at a node is limited by the node processing...

This work presents a performance evaluation of single node and subdomain communication schemes available in EdgeCFD, an implicit edgebased coupled fluid flow and transport code for solving large scale problems in modern clusters. A natural convection flow problem is considered to assess performance metrics. Tests, focused in single node multi-core performance, show that past Intel Xeon processo...

The following discussion is based on [5, 1] and, with regard to [2], is relevant to the discussions in Chapter 5 and in Section 6.6 on multihop wireless systems. Consider a network with a set of N nodes and L links. Let α(l) be the transmitting node and ω(l) be the receiving node of link l. Each node n maintains a set of J packet queues, Xn, one for each flow. A flow j is determined by a destin...

The vast majority of traditional control strategies aim at the scenario that the propagation is driven by reaction processes from nodes to all neighbours. A novel and effective control strategy for restraining epidemic spreading in the situation that epidemic pathways are defined and driven by traffic flows is proposed in this paper. It is performed by deleting edges in proper order according t...

Non-Newtonian models with shear-thinning viscosity are commonly used to solve a variety of complex flow problems. A new finite-volume discretisation based upon an unstructured grid is used to integrate the differential form of the Lattice Boltzmann equation (ULBE) with a shear-dependent viscosity, using a cell-vertex finite-volume technique. The unknown fields are placed at the nodes of the mes...

A broad class of CSMA protocols use synchronized contention in which nodes periodically contend at intervals of fixed duration. Both analysis and operation of these protocols assume perfect clock synchronization. However, in practice, clocks are not perfectly synchronized and drifts can vary widely, depending on the synchronization mechanism used in the network. We introduce an analytical model...

In modern power system, voltage stability is a major concern. To maintain voltage stability, it is desirable to assess effect of any unforeseen events and identify the nodes which are more sensitive. The most important task for distribution engineer is to efficiently simulate the system so that effective corrective actions can be taken. Load flow analysis is one of the techniques to simulate th...