IEEE Xplore - Login

Cart | Sitemap | Help

Login


	BROWSE	SEARCH	IEEE XPLORE GUIDE	SUPPORT


Article Information

On the performance of heuristic H_MCOP for multi-constrained optimal-path QoS routing Feng, G. Advanced Information Networking and Applications, 2004. AINA 2004. 18th International Conference on Volume 2, Issue , 29-31 March 2004 Page(s): 50 - 53 Vol.2 Digital Object Identifier 10.1109/AINA.2004.1283754 Summary:Network services for finding a feasible or an optimal path subject to multiple constraints on performance metrics such as delay, jitter, loss probability, etc. give rise to multipath-constrained (MCP) or multiconstrained optimal-path (MCOP) quality of service (QoS) routing problems, which are NP-complete. Heuristic algorithm H_MCOP proposed by Korkmaz et al. has been widely recognized for its low time complexity and high probability of finding feasible solutions. The performance of this heuristic is reinvestigated under several special cases. Simulation results indicate that in some cases its probability of finding feasible solutions is unexpectedly low. Such observation, which is further used to explain the performance of a heuristic based on H-MCOP, is of extreme importance when designing any higher-level QoS routing algorithms that need to use H_MCOP to find feasible solutions. » View citation and abstract



IEEE Members

Log in by entering your IEEE Web Account Username and Password. IEEE Communications Society members: If you subscribe to the IEEE Electronic Periodicals Package or IEEE Electronic Periodicals Package Plus, you must access your subscription at www.comsoc.org.



Users at Subscribing Institutions

Check with your librarian, information professional, or system manager to determine if you need to log in. Please complete the online Technical Support Form if you need assistance.



Already Purchased This Article?

Select the Purchase History link to access the document. You will have 5 Days after purchase to access the Full Text PDF. Please complete the online Technical Support Form if you need assistance.



Guests

• Search and access Abstract records free of charge • Register for table of contents alerts • Purchase Full Text PDF documents » Learn more about subscription options or how to become an IEEE Member.

You are not logged in.

Username

Password

» Forgot your password?

Please remember to log out when you have finished your session.

You must log in to access:
• Advanced or Author Search
• CrossRef Search
• AbstractPlus Records
• Full Text PDF
• Full Text HTML

Access this document

» Buy this document now

» Learn more about

subscription options

» Learn more about

purchasing articles

and standards

Learn more about IEEE Subscriptions

Help Contact Us Privacy & Security IEEE.org