文章基本信息

标题：Aggregation Dynamics in Service Overlay Networks for File Sharing
本地全文：下载
作者：K.Deepika Reddy ; E.Krishna ; W.Vidyavardhan 等
期刊名称：International Journal of Computer Trends and Technology
电子版ISSN：2231-2803
出版年度：2013
卷号：4
期号：7-2
出版社：Seventh Sense Research Group
摘要：This paper related to link monitoring. Restricts the selfish nodes and creates the network with only non selfish nodes. Non selfish nodes network maintains good link connectivity without any failure and provides stable and optimal solution. This network shows good performance and scalable solution. Previous network systems whenever create uses the immediate neighbour selection technique. This technique selects less distance of nodes for creation of network without any verification. Sometimes network failures are generated because of insufficient energy levels of nodes. Automatically packets are not delivering within time. In failure location add the node with new energy levels. This is called as a rewiring. Travelling the total number of packets takes more amounts of time and energy levels. To complete the packets transmission, network expects dynamic changes. It is not stable and don’t provide any kind of reliable solution. We introduce new design of network systems with the help of selfish neighbour selection technique. This technique uses the overlay routing for restrict the selfish nodes. After removing the selfish nodes, remaining non selfish nodes provides authentication network. All authentication nodes have asymmetric distance. Asymmetric distance nodes give the interference problems. Using EGOIST server implementation converts the asymmetric distance nodes to symmetric distance nodes. It is possible based on prototype design here. These symmetric distance nodes distribute the data efficiently without loss. These types of networks are called stable
关键词：Wiring Strategies; Stable Network Creation; Egoist Server