By Topic

Critical path minimization of data networks without compensating reliability

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Dasgupta, M. ; Dept. of Comput. Sci. & Eng., Indian Sch. of Mines, Dhanbad, India ; Biswas, G.P.

The packets in a data network follow different paths from source to destination and the possible longest path traversed by a packet in a network having n nodes is (n-1). This is termed as the worst case condition and the route followed is called the critical path. The critical paths increase transmission delay, cost, network traffic etc, thus degrades the network performance. In order to preserve the performance, this paper proposes a greedy technique to minimize the length of the critical paths by removing one or more link(s) in such a fashion that the reliability of the original network is minimally reduced. This has been done by iteratively removing one link from the critical path and measuring the reliability in each case and finally the link(s) corresponding to minimum change in reliability is removed. As an illustration, the proposed method has been applied in a data network of 5 nodes and 8 links, and the results obtained are given, which are satisfactory.

Published in:

Computer and Communication Technology (ICCCT), 2010 International Conference on

Date of Conference:

17-19 Sept. 2010