Source routing: Best rout using genetic algorithm


  • Hadeel Noori Saad University of Kufa



rout, genetic algorithm


The success of distributed multimedia traffic presents many challenges to the network designer, certain bandwidth as well as bounds on delay, loss probability and jitter in order to maintain reception quality are issues of Constraint Base Routing (CBR). Flow routing requires deterministic path coordination in comparison with data routing. This paper presents a new technique for best CBR-rout path computation using genetic algorithm. Available bandwidth, delay jitter, and path availability are the fitness function, the genetic algorithm try to optimize. Source routed packets were established to hold the complete elected path in packet header. All studies made on NS2 simulator, where SARBE approach for rapid on-line estimation of available bandwidth shows performance optimization on OSPF algorithm for multimedia streaming applications.


Download data is not yet available.


S. Lee, Y. Yu, S. Nelakuditi and etl.,

“Proactive vs Reactive Approaches to

Failure Resilient Routing”,

Q. Ma and P. Steenkiste, “Quality of

Service Routing for Traffic with

Performance Guarantees.” IWQoS’97, May

Q. Sun and H. Langendorfer, “A New

Distributed Routing Algorithm with End-toend

Delay Guarantee,” IWQoS’97, May

Z. Wang and J. Crowford, “QoS Routing

for Supporting Resource reservation,”IEEE

JSAC, vol.14(7), pp.1228-1234, September

P. Chou and Z. Miao, “Rate-distortion

optimized streaming of packetized media,”

in Microsoft Research Technical Report

MSR-TR-2001-35, February 2001.

L. Breslau, E. Knightly, S. Shenker, and

I. Stoica, “Endpoint admission control:

Architectural issues and performance,” In

Proc. ACM SIGCOMM, 2000.

Bob Melander, Mats Björkman, and

Per Gunningberg, .Regression-based

available bandwidth measurements,. In

Proceedings of the 2002 International

Symposium on Performance Evaluation of

Computer and

TelecommunicationsSystems, San Diego,

CA, USA, July 2002.

Robert Carter and Mark Crovella,

.Measuring bottleneck link speed in

packet-switched networks,. Tech. Rep.

-006, Boston University Computer

Science Department, Boston, MA, USA,

Mar. 1996.

Vinay J. Ribeiro,y Rudolf H. Riedi,y

Richard G. Baraniuky Jiri Navratil,z Les

Cottrellz "pathChirp: Efficient Available

Bandwidth Estimation for Network Paths"

Awduche, D., Malcolm, J., Agogbua,

J., O'Dell, M., and J. McManus,

"Requirements for Traffic Engineering

Over MPLS", RFC2702, September 1999.

Postel, J., "Internet Protocol", RFC

, September 1981.

A. Johnsson at al. Diettopp: A first

implementation and evaluation of a

simplified bandwidth measurement

method. In 2nd Swedish National

Computer Networking Workshop,

Karlstad, 2004.

Kevin Fall Kannan Varadhan. NS2

manual. March 2005.




How to Cite

Saad, H. N. (2010). Source routing: Best rout using genetic algorithm. Journal of Kufa for Mathematics and Computer, 1(2), 35–45.

Similar Articles

1 2 3 4 > >> 

You may also start an advanced similarity search for this article.