Re: help me

[Amardeep S. <iam...@ya...>]

hi, 

firstly, i have created a mailing list for qosrns. you should subscribe
to it and post your queries there. you can subscribe to it by visiting
http://lists.sourceforge.net/lists/listinfo/qosrns-general

now, for your question

On Mon, 2002-03-11 at 17:53, Zuleika T. do Nascimento wrote: 
> 
> hi,
> 
> The method computerQOSroutes in the ls.cc program stores more the one
> combination (bandwidth,prevnodeid) associate a unique peer (destination,
> numhops). Is that affirmation correct? Because, I understood the
> algorithm only stores one combination, the last calculated, is it correct?

yes, it is correct.

> 
> Do you have a sugestion to modify the code source (ls.cc) to enable it to
> store all the combinations?
> 
> Thanks for attention.
> Zuleika.

there are two approaches to path computation - pre-computation or 
on demand computation. currently qosrns does pre-computation. you could 
modify the code such that path-computation is done on-demand. thatis, it should 
compute paths when asked for explicit route, such as in
list<int> LsRouting::get_explicit_route(int node, double bw)

there, you could copy the algorithm from computeqosroutes and modify it 
appropriately to get the path you need. in that scenario, there would
be no need to store all combinations. that would be imo much better option
in your case.

hope that helps. mail at qos...@li... if
you have further queries.

bye,

Amardeep


_________________________________________________________
Do You Yahoo!?
Get your free @yahoo.com address at http://mail.yahoo.com