Efficient Sending for Iris Biometric Packets through Shortest Reliable Path

Ameer A. Mohammed Baqer, Suhas H. Patil


Shortest path problem is how finding the shortest path from source to destination in computer networks. The need is to find the path distance from the source to destination which reliable and is found in an optimized way considering the network constraints. One of the basic challenges in distributed systems is how we can send the important packets from one terminal to another through the networks in safety and shortest paths, because sometimes the path is not reliable or the path is long that is take more time to sending the packets, So in our paper we proposed good technique for choosing shortest reliable path to sending Biometric Authentication packet to decrease losing of this packets and also we explain the content of the biometric authentication packet in our proposed web-based system.

Keywords: shortest reliable path; iris biometric authentication; distributed system

Full Text:


DOI: https://doi.org/10.26483/ijarcs.v3i2.1042


  • There are currently no refbacks.

Copyright (c) 2016 International Journal of Advanced Research in Computer Science