1,721,199 research outputs found
CompuP2P: An Architecture for Sharing of Computing Resources in Peer-to-Peer Networks with Selfish Nodes
Full text linkCompuP2P is an architecture for sharing of computing resources in peer-to-peer (P2P) networks. It provide resources, such as processing power, memory storage etc., to user applications that might require them. CompuP2P creates dynamic markets for different amounts of computing resources without relying on any trusted centralized entity to monitor the activities of nodes in those markets. Moreover, the pricing of computing resources takes into account selfishness of network users and uses ideas from game theory and microeconomics.This proceeding is published as Gupta, Rohit, and Arun K. Somani. "CompuP2P: An architecture for sharing of computing resources in peer-to-peer networks with selfish nodes." In Proceedings of the Second Workshop on the Economics of Peer-to-Peer Systems (P2PEcon '04). 2004. Posted with permission.</p
Reputation management framework and its use as currency in large-scale peer-to-peer networks
Full text linkWe propose a reputation management framework for large-scale peer-to-peer (P2P) networks, wherein all nodes are assumed to behave selfishly. The proposed framework has several advantages. It enables a form of virtual currency, such that the reputation of nodes is a measure of their wealth. The framework is scalable and provides protection against attacks by malicious nodes. The above features are achieved by developing trusted communities of nodes whose members trust each other and cooperate to deal with the problem of nodes' selfishness and possible maliciousness.This is a manuscript of a proceeding published as Gupta, Rohit, and Arun K. Somani. "Reputation management framework and its use as currency in large-scale peer-to-peer networks." In Proceedings. Fourth International Conference on Peer-to-Peer Computing, 2004 (2004): 124-132. DOI: 10.1109/PTP.2004.1334939. Posted with permission.</p
An Incentive Driven Lookup Protocol for Chord-Based Peer-to-Peer (P2P) Networks
Full text linkIn this paper we describe a novel strategy for carrying out lookups in Chord-based peer-to-peer (P2P) networks, wherein nodes are assumed to behave selfishly. This is in contrast to the traditional lookup schemes, which assume that nodes cooperate with each other and truthfully follow a given protocol in carrying out resource lookups. The proposed scheme also provides efficient and natural means for preventing free-riding problem in Chord without requiring prior trust relationships among nodes. In addition, we evaluate the performance of Chord for providing routing service in a network of selfish nodes and prove that it has good structural properties to be used in uncooperative P2P networks.This is a post-peer-review, pre-copyedit version of a proceeding published as Gupta, Rohit, and Arun K. Somani. "An incentive driven lookup protocol for chord-based peer-to-peer (P2P) networks." In: Bougé L., Prasanna V.K. (eds) High Performance Computing - HiPC 2004. HiPC 2004. Lecture Notes in Computer Science, vol 3296. Springer, Berlin, Heidelberg. (2004): 8-18. The final authenticated version is available online at DOI: 10.1007/978-3-540-30474-6_7. Posted with permission.</p
Joint optimization of service function chaining and resource allocation in network function virtualization
No full textPricing strategy for incentivizing selfish nodes to share resources in peer-to-peer (P2P) networks
Full text linkIn this paper we describe a novel pricing strategy for carrying out lookups and obtaining data in peer-to-peer (P2P) networks with selfish nodes. Both the resource provider and intermediate nodes that assist in routing of lookup messages are appropriately compensated so as to cover their cost of providing service. This is in contrast to the traditional lookup schemes, which assume that data is freely available, and intermediate nodes selflessly cooperate and truthfully follow a given protocol in carrying out resource lookups. The proposed scheme provides efficient and natural means to prevent free-riding problem in P2P networks, and does not require prior trust relationships among nodes. Moreover, unlike other schemes it does not rely on any centralized entity or require specialized trusted hardware at each node.This is a manuscript of a proceeding published as Gupta, Rohit, and Arun K. Somani. "Pricing strategy for incentivizing selfish nodes to share resources in peer-to-peer (P2P) networks." In Proceedings. 2004 12th IEEE International Conference on Networks (ICON 2004), vol. 2, pp. 624-629. IEEE, 2004. DOI: 10.1109/ICON.2004.1409247. Posted with permission.</p
Integration of Clinical and Genomic data: a Methodological Survey
No full textHuman diseases are inherently complex and governed by the complicated interplay of several underlying factors. Clinical research focuses on behavioral, demographic and pathology information, whereas molecular genomics focuses on finding underlying genetic and genomic factors in genomic data collected on mRNA expression, proteomics, biological networks, and other microbiological features. However, each of these clinical and genomic datasets contains information only about one particular aspect of a complex disease, rather than covering all of the several complicated underlying risk factors. This has led to a new area of research that integrates both clinical and genomic data and aims to extract more information about diseases by considering not only all the various factors, but also the interactions among those factors, which cannot be captured by clinical and genomic studies that are performed independently of each other. Although initial efforts have already been made to develop such integrative modeling of the clinical and genomic data to shed light on the biological mechanism of the diseases, the research field is still in a rudimentary stage. In this review article, we survey the general issues, challenges and current work of clinicogenomic studies. We also summarize the current state of the field and discuss some possibilities for future work.Dey, Sanjoy; Gupta, Rohit; Steinbach, Michael; Kumar, Vipin. (2013). Integration of Clinical and Genomic data: a Methodological Survey. Retrieved from the University Digital Conservancy, https://hdl.handle.net/11299/215908
Utilizing node's selfishness for providing complete anonymity in peer-to-peer based grids
Full text linkIn this paper, a novel protocol for providing both client and server anonymity in peer-to-peer (P2P) based grids is presented. The protocol assumes individual nodes or users to be utility maximizing agents, and relies on an auction mechanism for trading of resources among them. The resources here can refer to data files, storage capacity, or computation power (i.e., CPU cycles) etc. The protocol is inherently anonymous, light-weight, and incentive-compatible. Incentive compatibility implies that the protocol takes into account the selfishness of users; as would be seen the utilities of users are maximized by truthfully following the protocol steps. Moreover, if the protocol is truthfully followed by the users, anonymity to both the clients and servers of all the transactions are guaranteed. Furthermore, unlike other schemes, the proposed protocol does not rely on any trusted centralized entity or require specialized encryptions to be performed by the users. Thus, the protocol incurs very low overhead on the system and is light-weight. In brief, the proposed protocol provides efficient and natural means to provide anonymity in P2P based grids, and is easily deployable in a large un-trusted Internet-scale setting.This is a manuscript of an article published as Gupta, Rohit, Souvik Ray, Arun K. Somani, and Zhao Zhang. "Utilizing node's selfishness for providing complete anonymity in peer-to-peer based grids." Multiagent and Grid Systems 2, no. 1 (2006): 11-27. The final publication is available at IOS Press through DOI: 10.3233/MGS-2006-2102. Posted with permission.</p
Going Beyond Counting First Authors in Author Co-citation Analysis
Full text linkThe present study examines one of the fundamental aspects of author co-citation analysis (ACA) - the way co-citation
counts are defined. Co-citation counting provides the data on which all subsequent statistical analyses and mappings
are based, and we compare ACA results based on two different types of co-citation counting - the traditional type that
only counts the first one among a cited work's authors on the one hand and a non-traditional type that takes into
account the first 5 authors of a cited work on the other hand. Results indicate that the picture produced through this non-traditional author co-citation counting contains more coherent author groups and is therefore considerably clearer. However, this picture represents fewer specialties in the research field being studied than that produced through the traditional first-author co-citation counting when the same number of top-ranked authors is selected and analyzed. Reasons for these effects are discussed
- …
