alexa Abstract | Computing List of Ordered Pairs from Disjoint Closed Interval to compute a most Probable Delay Path:NPHard in polynomial time
ISSN ONLINE(2320-9801) PRINT (2320-9798)

International Journal of Innovative Research in Computer and Communication Engineering
Open Access

OMICS International organises 3000+ Global Conferenceseries Events every year across USA, Europe & Asia with support from 1000 more scientific Societies and Publishes 700+ Open Access Journals which contains over 50000 eminent personalities, reputed scientists as editorial board members.

Open Access Journals gaining more Readers and Citations

700 Journals and 15,000,000 Readers Each Journal is getting 25,000+ Readers

This Readership is 10 times more when compared to other Subscription Journals (Source: Google Analytics)

Research Article Open Access


Computing most probable delay of a given graph having node(n) and edges (m) is NP-Hard problem. The hardness of the problem doesn‟t impact on the restricted version problem. The main idea is to solve the problem with the help of applying some constraint on given NP-Hard problem. Two different cases are considered to solve the given NP-Hard problem. First case considers as if the constraint satisfied with the problem, then it is easy to solve given NP-Hard problem in polynomial time with the help of approximation algorithm. Second case, otherwise the computational complexity of the problem remains non-polynomial. Normally, the network operator needs to find a source to destination path such that the bandwidth of the path is no smaller than the specified bandwidth requirementand delay of the path is no longer than specified the delay bound.To solve the above problem in polynomial time it is necessary to find a pair of tight lower and upper bound which is in the form of disjoint close interval. In this paper, an algorithm is designed to calculate a set of ordered pairs which is a part of implementing polynomial time algorithm to compute the most probable delay between source to destination for a given graph.

To read the full article Peer-reviewed Article PDF image | Peer-reviewed Full Article image

Author(s): Sujit P Nale , S.P Sonavane


Disjoint close interval, order pair, probable delay, link weight., Scientific Computing

Share This Page

Additional Info

Loading Please wait..
Peer Reviewed Journals
Make the best use of Scientific Research and information from our 700 + peer reviewed, Open Access Journals
International Conferences 2017-18
Meet Inspiring Speakers and Experts at our 3000+ Global Annual Meetings

Contact Us

© 2008-2017 OMICS International - Open Access Publisher. Best viewed in Mozilla Firefox | Google Chrome | Above IE 7.0 version