Abstract
Path selection under multiple additive QoS constraints in high-speed networks is an NP-complete problem. Most of the algorithms proposed for QoS routing suffer from either excessive computational c...
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
