8/12/2019 A Method to Find Shortest Reliable Path by Hardware Testing and Software Implementation

1/4

A METHOD TO FIND SHORTEST

RELIABLE PATH BY HARDWARE

TESTING AND SOFTWAREIMPLEMENTATION

Mr. GHOLAMREZA KAKAMANSHADI (Research Scholar)

Computer department, Bharati Vidyapeeth Demeed University College of Engineering, pune-satara road, Katraj,maharashtra, india

Mr.J.NAVEENKUMAR (Research Scholar)

Computer department, Bharati Vidyapeeth Demeed University College of Engineering, pune-satara road, Katraj,

maharashtra, india

Dr. SUHAS.H.PATIL (Guide)

Computer department, Bharati Vidyapeeth Demeed University College of Engineering, pune-satara road, Katraj,maharashtra, india

Abstract

This research paper is about shortest reliable path algorithms of routing in transportation networks. Efficient

management of networks requires that the shortest route from one point (node) to another is known. It is oftennecessary to be able to determine alternative routes through the network, in case any part of the shortest path isdamaged or busy which the computation of shortest paths is one of the most fundamental problems. It also

focuses in finding the shortest reliable path algorithm. We need to find the path distance from the source todestination which is reliable and found in an optimized way considering the network constraints.

Keywords: Network ing, Path f inder, shortest path, Reli able path, Shortest Reli able path, Network Cable

testing

1. IntroductionThere are some problems which exist in the current available in networks; this problem grows larger as thenetwork grows. The first one is an efficient use of bandwidth that minimizes the transfer delay of packets

between nodes to ensure the shortest end-to-end delay for packet transmission from source to destination. Thesecond challenge is the ability to maintain data flow around permanent and transient node or link failuresensuring the maximum delivery rate of packets from source to destination. The final challenge is to efficientlyuse energy while maximizing delivery rate and minimizing end-to-end delay.

The paper concentrates on an attempt of finding an algorithm or method which will help in removing the

hardware oriented defects or faults which occurs in the networks after finding the shortest path, and the data istransferred from the source to the destination. The following sections will talk about both the hardware orientedtests, mostly tests performed on the cables which connect the source and the destination. Also the paperdiscusses about the valid algorithm for finding the shortest path.

2. Hardware Oriented testsThere are many varieties of tests that can be performed in order to remove the factor that cable (hardware) faultled to the loss of packet or data. The tests performed on the cables with an intension of calculating the metrics

which lead to find whether that cable can be used in network to establish a highly reliable path. Some of thetests which are performed are using a device called Link ware cable test management test software. Thisdevice can also be implemented as software which is installed at both ends. The readings about the cable can be

taken by sending the signal once from destination to source and calculating the metrics at the source end andthen deciding the path.

Gholamreza Kakamanshadi et al. / International Journal of Engineering Science and Technology (IJEST)

ISSN : 0975-5462 Vol. 3 No. 7 July 2011 5765

8/12/2019 A Method to Find Shortest Reliable Path by Hardware Testing and Software Implementation

2/4

Resistance test- The resistance test measures the dc loop resistance for each cable pair. The resistance resultsscreen displays the resistance, limit, and pass/fail result for each cable pair. A pass result means that themeasured resistance is less than the limit. A fail result means that the measured resistance exceeds the limit. Theresistance is a metric that allow the flow of signal without any erosion of part of signal and also free flow of the

signal.

Length Test- The length test measures the length of each cable pair tested. The main Auto test results screenshows the length of the cable pair having the shortest electrical delay. The length results screen displays thelength, limit, and pass/fail result for each cable pair. Length is displayed in meters or feet.

Wire map test - The Wire map test is used to identify physical errors of the installation; proper pin terminationat each end, shorts between any two or more wires, continuity to the remote end, split pairs, crossed pairs,

reversed pairs, and any other miss-wiring.

Propagation Delay - The Propagation Delay test tests for the time it takes for the signal to be sent from one endand received by the other end.

Delay Skew Test- The Delay Skew test tests for the difference in propagation delay between the fastest and

slowest set of wire pairs. An ideal skew is between 25 and 50 nanoseconds over a 100 meter cable.

These are some tests which are performed in order to ensure cables reliability. There can be more tests whichcan be performed.

3. Finding Shortest Reliable PathFor finding the shortest path, there are many algorithms which already exist. Let us use them and make thesuitable shortest path algorithm for finding the shortest reliable path.First the shortest path should be available to us, and then use the above test to check whether the paths found arereliable.The algorithm is as follows:

Let G be a weighted directed graph containing a set V of n vertices and a set E of m directed edges; let s be adesignated source vertex in G, and let d be a designated destination vertex. Let each edge (v,e) in E, from vertex

e to vertex v, have a non-negative cost w (v,e).

Figure 1: Weighted Graph

Figure 2: Finding shortest path p1

Gholamreza Kakamanshadi et al. / International Journal of Engineering Science and Technology (IJEST)

ISSN : 0975-5462 Vol. 3 No. 7 July 2011 5766

8/12/2019 A Method to Find Shortest Reliable Path by Hardware Testing and Software Implementation

3/4

8/12/2019 A Method to Find Shortest Reliable Path by Hardware Testing and Software Implementation

4/4

Figure 6: Tests for C01-04

The tests performed on the cable wit ID C01-04 results in failure because the metric Resistance has a valuewhich is more that the standard set by the tester. Remaining cables which has been tested are reliable in nature

because the value which has been derived for the metrics are within the range of the standards established priorto testing started.

4. ConclusionThe research work which has been put in this paper is about finding the various shortest paths in the networkand out of that choosing the reliable path for data transmission. The tests carried out are done through usingLink ware cable test management test software. This process can be fully automated in future.

5. References[1] S. Cheung. An efficient message authentication scheme for link state routing. In 13 th Annual Computer Security Applications

Conference, 1997.[2] B. Dahill, B.N. Levine, C. Shields, and E. Royer, A Secure Routing Protocol for Ad Hoc Networks, Submitted for publication. August

2001. UMass Tech Report 01-37.

[3] R. Hauser, T. Przygienda, and G. Tsudik. Reducing the cost of security in link-state routing. In Proceedings of the Symposium onNetwork and Distributed System Security (SNDSS97), pages 9399, February 1997.

[4] J Lundberg. Routing Security in Ad Hoc Networks, Proceedings of the Helsinki University of Technology, 2000.[5] S. Marti, T.J. Giuli, Kevin Lai and Mary Baker, Mitigating Routing Misbehavior in Mobile Ad Hoc Networks. Proceedings of

MOBICOM 2000, August 2000.

[6] S. Murphy and M. Badger. Digital signature protection of the OSPF routing protocol. In Proceedings of the Symposium on Networkand Distributed System Security (SNDSS96),.pages 93102, February 1996.

[7] P.Papadimitratos and Z.J. Haas, Secure Routing for Mobile Ad Hoc Networks, SCS Communication Networks and DistributedSystems Modeling and Simulation Conference.

[8] www.wikipedia.com/wikifiles/

Figure 5: Tests for C03-03

Gholamreza Kakamanshadi et al. / International Journal of Engineering Science and Technology (IJEST)

ISSN : 0975-5462 Vol. 3 No. 7 July 2011 5768