Please use this identifier to cite or link to this item: https://idr.l3.nitk.ac.in/jspui/handle/123456789/7136
Full metadata record
DC FieldValueLanguage
dc.contributor.authorRavi, A.
dc.contributor.authorMeghana, I.S.
dc.contributor.authorChandrasekaran, K.
dc.date.accessioned2020-03-30T09:58:32Z-
dc.date.available2020-03-30T09:58:32Z-
dc.date.issued2015
dc.identifier.citationProceedings of the International Conference on Computing and Communications Technologies, ICCCT 2015, 2015, Vol., , pp.398-402en_US
dc.identifier.urihttp://idr.nitk.ac.in/jspui/handle/123456789/7136-
dc.description.abstractIn a peer to peer system, each entity needs some services from other entities in the network, and is capable of providing services to other entities in the network. For the system to work each entity has to contribute at least as much as it is receiving. But for this to happen, since the services requested and offered are different across entities, the relative values of each service have to be determined. The relative value of a resource must depend on how much of it is demanded and how much of it is available on the network. A separation of concerns approach in such systems will have to be devised keeping in mind the fact that any concern that the node sets apart as the service providing node's will have to be handled by it when it is acting as the service provider. Furthermore, the distribution of work is also to be handled. All this has to be done without compromising on the quality of service. This paper defines a software architecture for a pure peer to peer system, which uses network science to optimize the overlay network, thereby improving quality of service as well as fault tolerance. � 2015 IEEE.en_US
dc.titleA software architecture for a fully decentralized peer to peer systemen_US
dc.typeBook chapteren_US
Appears in Collections:2. Conference Papers

Files in This Item:
There are no files associated with this item.


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.