Continue to Site

Welcome to EDAboard.com

Welcome to our site! EDAboard.com is an international Electronics Discussion Forum focused on EDA software, circuits, schematics, books, theory, papers, asic, pld, 8051, DSP, Network, RF, Analog Design, PCB, Service Manuals... and a whole lot more! To participate you need to register. Registration is free. Click here to register now.

Register Log in

help needed for final year project!!!

Status
Not open for further replies.
B

bouboumou

Newbie level 4
Joined
Feb 27, 2006
Messages
7
Helped
0
Reputation
0
Reaction score
0
Trophy points
1,281
Location
CYPRUS
Activity points
1,328
static routing algorithm let say you have number of connections on the network while you are trying to route the other list of connections(these are connections affected by the failure).The algorithm should try to minimize the amount of "old" connections that have to be re-routed because of the "new" connections coming in the network OR try to maximize the number of new connections that can be accomotated in the network while not re-routing any of the old connections. Also i have to work in c++ for this..........

Can anyone please help me or give me some links or anything that can be helpful for me!!!!!!!
 

Status
Not open for further replies.

Similar threads

Part and Inventory Search

Welcome to EDABoard.com

Sponsor

Back
Top