Cart (Loading....) | Create Account
Close category search window
 

Metaheuristic Methods for Solving the Capacity and Flow Assignment Problem in TCP/IP Networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Wille, E.C.G. ; Univ. Tecnol. Fed. do Parana (UTFPR), Curitiba, Brazil ; da C Bento, C.R.

This paper proposes the use of two metaheuristic methods, the GRASP (greedy randomized adaptive search procedure) and the PSO (particle swarm optimization), customized to TCP/IP networks dimensioning. Specially, this article treats the capacity and flow assignment (CFA) problem considering the packet delay allowed within every source/destination pair. Each router is modeled using a Markovian queue with batch arrivals, in order to consider the burst traffic yielded by TCP protocol. This study suggests still an iterative procedure to solve the network buffer dimensioning problem. Performance results achieved for some network topologies are faced with simulated results (achieved from NS-2) validating this proposed methodology.

Published in:

Latin America Transactions, IEEE (Revista IEEE America Latina)  (Volume:9 ,  Issue: 5 )

Date of Publication:

Sept. 2011

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.