Long-hop TCP flows undergo throughput degradation when contending with short-hop TCP flows in a multi-hop wireless network due to collision related losses. Long hop flows compared to the short hop flows have to contend for the medium more number of times and hence suffer more number of collisions. In this paper, we propose a network coding scheme based on the timed network coding to improve the...

Let G be a simple, undirected graph. A special network N, called a balanced network, is constructed from G such that maximum matchings and f-factors in G correspond to maximum flows in N. A max-balancedflow-min-balanced-cut theorem is proved for balanced networks. It is shown that Tutte’s Factor Theorem is equivalent to this network flow theorem, and that f-barriers are equivalent to minimum ba...

This work addresses two problems concerning continuous dynamic flows. A model is presented for a network that incorporates continuous time-varying flows, link capacities, node storage capacities, as well as time dependent link delays. It is an enhancement of previous results which do not incorporate time varying link delays. We present a generalized min-cut max-flow theorem for that model. A se...

This paper examines the interaction among short-lived and long-lived TCP flows in a test network that can be operated as an ordinary best effort or as a Differentiated Services (DS) enabled network, and shows how TCP service can be improved by isolating TCP flows based on their different characteristics. The target of the measurements was to investigate the interaction among TCP flows having si...

A water distribution network is subjected to various abnormal conditions such as pipe breaks, pump failures, excessive demands etc. in the design period. Under such conditions, the network may not be able to meet required demands at desired pressures, and becomes deficient. Traditional network analysis assumes nodal demands to be satisfied and available nodal pressures are calculated. However, ...

There is considerable interest in applications which transport isochronous data across a network, for example teleconferencing or Voice over IP applications. These applications require a network which provides Quality of Service (QoS) guarantees. While there are various networks which provide some form of QoS, there has been little investigation into the allocation of resources to network flows...

This paper deals with resource unconstrained project scheduling problems with the objective of maximizing the net present value (NPV) of project cash flows. Here we present a heuristic algorithm named as differential procedure (Dif_AOA). In order to evaluate the efficiency of this algorithm, networks with node numbers between 10-1000 and network complexity coefficients between 1.3-6.6 have be...

This paper deals with resource unconstrained project scheduling problems with the objective of maximizing the net present value (NPV) of project cash flows. Here we present a heuristic algorithm named as differential procedure (Dif_AOA).&#10In order to evaluate the efficiency of this algorithm, networks with node numbers between 10-1000 and network complexity coefficients between 1.3-6.6 have ...

The necessity of using and studying models that are similar to reality leads to the development of new network flows, generalizing the already known network structures. The multiterminal network flow is a natural development of the classical flow with one source and one sink and fixed upper limits of the flow function on each arc [1, 2]. There exists a number of engineering and economic problem...