Effect Self Loop Avoidance Weighted NDFA Method Using Fuzzy Cache Counter Classifier Algorithm for Efficient and Fastest Reachable Path in Travelling Networks
Journal Title: International Journal of Research in Computer and Communication Technology - Year 2015, Vol 4, Issue 8
Abstract
Now a days in computer path networks or travelling networks, the routing of vehicles or moving objects is mainly based on the best path. This will help in minimize the costs of paths in a place, city or any specified region. But, every shortest path need not give accurate results. So, in this paper, we proposed an algorithm called Effect Self Loop Avoidance Weighted Non Deterministic Finite Automatic Method Using Fuzzy Cache Counter Classifier Algorithm and applied on various computer and other networks. The main objective of this paper is to find the efficient and fastest Reachable Path using cache counter classifier. An example is illustrated for finding optimal and efficient solutions to travelling is presented. The practical results show that the proposed method obtains better and accurate paths when compared with the existing methods.
Authors and Affiliations
Kartheek V. L, Srinivasa Rao M, MN Rao
Keywords
Related Articles
- EP ID EP28223
- DOI -
- Views 248
- Downloads 3
Integrity And Confidentiality for Network Security
We compute the liability metric as a function of the steering and the cryptographic protocols used to secure the complex passage. We formulate the minimum cost node capture attack problem as a nonlinear integer progra...
New architecture and efficient inter device communication for content transferring in human networks
We present B-SUB, an interest-driven information sharing system for HUNETs, which stands for the bloom-filter-based publish/SUBscribe. B-SUB is calculated for small to medium sized networks selfpossessed of dozens of...
A Novel Social TV For Improving Users Viewing Experience By Using Cloud
The latest cloud computing technology with its wealthy possessions to balance for the limitations of mobile devices and connections can potentially endow with an ideal platform to hold up the desired mobile services....
Novel Approach To Adaptive Opportunistic Routing For Wireless Adhoc Networks
A wireless ad hoc network is a decentralized type of wireless network. If the network is adhoc since it does not rely on a pre accessible infrastructure, such as routers in wired networks and access points in managed...
Review on Algorithms and Techniques of Reversible Data Hiding
Nowadays, with the rapid development of information technology more and more images and data are available on the internet..So there is a need to provide some kind of authentication to such important data. With the i...