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...

An off-line methodology for simultaneously estimating dynamic origin-destination matrices without using assignment matrices that incorporates within day transition equations is presented. The proposed formulation and solution approach extend a calibration method recently developed that directly uses the output of any network loading model (such as a dynamic traffic assignment or simulation mode...

of Dissertation Presented to the Graduate School of the University of Florida in Partial Fulfillment of the Requirements for the Degree of Doctor of Philosophy FAIR PACKET SCHEDULING AND BANDWIDTH MANAGEMENT IN WIRELESS NETWORKS By Ying Jian December 2008 Chair: Shigang Chen Major: Computer Engineering Our study focused on fair packet scheduling and bandwidth management in CSMA/CA based wireles...

This paper investigates day-to-day dynamics in urban traffic network induced by departure time dynamics in commuter decisions. This investigation relaxes some key restrictions regarding fixed departure time and equilibrium assumptions to analyze the stability and performance of urban traffic networks over a multiple day planning horizon. A simulation-based framework is developed to analyze day-...

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...

Wireless mesh networks have attracted increasing attention and deployment as a high-performance and low-cost solution to last-mile broadband Internet access. Traffic routing plays a critical role in determining the performance of a wireless mesh network. To investigate the best routing solution, existing work proposes to formulate the mesh network routing problem as an optimization problem. In ...

many efforts have been made to model the the hot deformation (dynamic recrystallization) flow curves of different materials. phenomenological constitutive models, physical-based constitutive models and artificial neural network (ann) models are the main methods used for this purpose. however, there is no report on the modeling of warm deformation (dynamic spheroidization) flow curves of any kin...

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...

Abstract : In this paper , we apply the stochastic dynamic programming to approximate the mean project completion time in dynamic Markov PERT networks. It is assumed that the activity durations are independent random variables with exponential distributions, but some social and economical problems influence the mean of activity durations. It is also assumed that the social problems evolve in ac...

The emergence of Delay Tolerant Networks (DTNs) has culminated in a new generation of wireless networking. New communication paradigms, which use dynamic interconnectedness as people encounter each other opportunistically, lead towards a world where digital traffic flows more easily. We focus on humanto-human communication in environments that exhibit the characteristics of social networks. Thi...