A new generalized particle approach to parallel bandwidth allocation

Authors:
Xiang Feng;Francis C. M. Lau;Dianxun Shuai
Affiliations:
Department of Computer Science, The University of Hong Kong, Pokfulam Road, Hong Kong;Department of Computer Science, The University of Hong Kong, Pokfulam Road, Hong Kong;Department of Computer Science and Engineering, East China University of Science and Technology, Shanghai 200237, PR China
Venue:
Computer Communications
Year:
2006

Citing 7
Cited 3

Data networks

Data networks
Understanding TCP Vegas: a duality model

Journal of the ACM (JACM)
A duality model of TCP and queue management algorithms

IEEE/ACM Transactions on Networking (TON)
Linear stability of TCP/RED and a scalable control

Computer Networks: The International Journal of Computer and Telecommunications Networking
Distributed Problem Solving in Multiagent Systems: A Spring Net Approach

IEEE Intelligent Systems
Ant colony optimization theory: a survey

Theoretical Computer Science
The parallel optimization of network bandwidth allocation based on generalized particle model

Computer Networks: The International Journal of Computer and Telecommunications Networking

A new economic generalized particle model for flow control

Computer Networks: The International Journal of Computer and Telecommunications Networking
Performance evaluation of bandwidth allocation in ATM networks

International Journal of Business Information Systems
Behavioral modeling with the new bio-inspired coordination generalized molecule model algorithm

Information Sciences: an International Journal

Quantified Score

Hi-index	0.24

Visualization

Abstract

This paper presents a new generalized particle (GP) approach to dynamical optimization of network bandwidth allocation, which can also be used to optimize other resource assignments in networks. By using the GP model, the complicated network bandwidth allocation problem is transformed into the kinematics and dynamics of numerous particles in two reciprocal dual force-fields. The proposed model and algorithm are featured by the powerful processing ability under a complex environment that involves the various interactions among network entities, the market mechanism between the demands and service, and other phenomena common in networks, such as congestion, metabolism, and breakdown of network entities. The GP approach also has the advantages in terms of the higher parallelism, lower computation complexities, and the easiness for hardware implementation. The properties of the approach, including the correctness, convergency and stability, are discussed in details. Simulation results attest to the effectiveness and suitability of the proposed approach.