This paper proposes the use of a Swarm Intelligence based approach (SITA) for Task Allocation and scheduling in a dynamically reconfigurable environment such as the computational Grid. SITA is a massively distributed task allocation algorithm that draws inspiration from the hugely efficient foraging and food hunting paradigm of ants. We employ the ant colony optimization (ACO), a population bas...

Future satellite communication systems proposed use geosynchronous (GEO) satellites, medium earth orbit (MEO), and low earth orbit (LEO) constellations with fast packet switching and quality of service (QoS) provisioning. In this paper, we present broadband GEO, MEO and LEO satellite network QoS models and simulated performance results. This paper proposes a new method of bandwidth allocation d...

Driver behavior under congestion pricing is analyzed in this study to evaluate the effects of alternative congestion pricing schemes. The analysis, which is based on stated-preference survey results, focuses on time allocation, departure time choice and route choice when a congestion pricing scheme is implemented on toll roads. A unique feature of the model system of this study is that departur...

Driver behavior under congestion pricing is analyzed in this study to evaluate the effects of alternative congestion pricing schemes. The analysis, which is based on stated-preference survey results, focuses on time allocation, departure time choice and route choice when a congestion pricing scheme is implemented on a toll road. A unique feature of the model system of this study is that departu...

We consider non-cooperative unsplittable congestion games where players share resources, and each player’s strategy is pure and consists of a subset of the resources on which it applies a fixed weight. Such games represent unsplittable routing flow games and also job allocation games. The congestion of a resource is the sum of the weights of the players that use it and the player’s cost functio...

Network utility maximization is a well-accepted theoretical framework that describes how congestion controls cooperate to achieve an ideal sending rate allocation, for given functions of senders and constraints the network. These network are expressed as “cost” in framework. In practice, most control mechanisms obtain feedback different from framework's “cost.” This article focuses on explicit ...

Transport protocols must accommodate diverse application needs as well as network requirements. As a result, TCP has evolved over time with new congestion control algorithms such as support for generalized AIMD, background flows, and multipath. On the other hand, explicit congestion control algorithms have shown to be more efficient. However, they are inherently more rigid because they rely on ...

Congestion occurs at a bottleneck along an Internet path; multiple flows between the same sender and receiver pairs can benefit from using only a single congestion control instance when they share the same bottleneck. These benefits include the ability to control the rate allocation between flows and reduced overall delay (multiple congestion control instances cause more queuing delay than one ...

Congestion occurs at a bottleneck along an Internet path. Multiple flows between the same sender and receiver pairs can benefit from using only a single congestion control instance when they share the same bottleneck. These benefits include the ability to control the rate allocation between flows and reduced overall delay (multiple congestion control instances cause more queuing delay than one ...