Search results

1 – 10 of over 5000
Article
Publication date: 1 April 2002

Ying Dong, Mingshu Li, Meizhang Chen and Shengli Zheng

The Napster case has drawn enormous attention to digital intellectual property right problems of online file swapping. These peer‐to‐peer network technologies represent a powerful…

3131

Abstract

The Napster case has drawn enormous attention to digital intellectual property right problems of online file swapping. These peer‐to‐peer network technologies represent a powerful new paradigm for networking. In this paper, we try to figure out the intellectual property right problems of peer‐to‐peer network, in order to deal with potential digital piracy to avoid similar litigation. If libraries can embrace peer‐to‐peer technologies into their own services, they will possibly develop new service models, or improve existing ones.

Details

The Electronic Library, vol. 20 no. 2
Type: Research Article
ISSN: 0264-0473

Keywords

Article
Publication date: 1 August 2005

Roman Shtykh, Guozhen Zhang and Qun Jin

In this study, we propose and develop an opensource groupware system called NetIsle. NetIsle is a general purpose groupware system for uniform open groups that integrate a number…

Abstract

In this study, we propose and develop an opensource groupware system called NetIsle. NetIsle is a general purpose groupware system for uniform open groups that integrate a number of tools for online collaboration to ensure fast information exchange and sharing, increase the productivity of working groups, and reduce maintenance and administration costs. The main technologies used for the construction of the system are peer‐to‐peer (P2P) and push, which are best fitted to those principles and beliefs we build our system upon.

Details

International Journal of Pervasive Computing and Communications, vol. 1 no. 3
Type: Research Article
ISSN: 1742-7371

Keywords

Open Access
Article
Publication date: 21 February 2020

Ying Zhu, Valerie Lynette Wang, Yong Jian Wang and Jim Nastos

Based on theories related to coopetition, the purpose of this paper is to examine the patterns of business-to-business digital referrals inscribed in businesses’ digital content.

5100

Abstract

Purpose

Based on theories related to coopetition, the purpose of this paper is to examine the patterns of business-to-business digital referrals inscribed in businesses’ digital content.

Design/methodology/approach

A complete industry-wise digital data set is formed by extracting digital referrals in all the content pages. The authors outline how digital referrals are strategically used among peer businesses in the peer-to-peer digital network and in the augmented digital network, taking into consideration geographical framing and physical distance.

Findings

The authors reveal how geographical framing and physical distance influence peer-to-peer referral patterns in the digital space. Quite counter-intuitively, businesses are more likely to give digital referrals for peers residing in the same region, as well as for peers located in closer proximity. Further, results from the augmented digital network show that peer businesses in closer proximity exhibit greater strategic similarity in their digital referring strategy.

Research limitations/implications

The findings extend the understanding of business-to-business coopetition to the digital space and suggest that geographical framing and physical distance can induce reciprocated relationships between peers by offering each other digital referrals.

Practical implications

The findings shed light on the formation of a business-to-business digital coopetition strategy using digital referral marketing.

Originality/value

This study highlights the impact of digital referrals in business-to-business relationship management, especially in the digital coopetition context.

Article
Publication date: 1 March 2002

Alfred Loo and Y.K. Choi

Heretofore, it has been extremely expensive to install and use distributed databases. With the advent of Java, JDBC and other Internet technologies, it has become easy and…

Abstract

Heretofore, it has been extremely expensive to install and use distributed databases. With the advent of Java, JDBC and other Internet technologies, it has become easy and inexpensive to connect multiple databases and form distributed databases, even where the various host computers run on different platforms. These types of databases can be used in many peer‐to‐peer applications which are now receiving much attention from researchers. Although it is easy to form a distributed database via Internet/intranet, effective sharing of information continues to be problematic. We need to pay more attention to the enabling algorithms, as dedicated links between computers are usually not available in peer‐to‐peer systems. The lack of dedicated links can cause poor performance, especially if the databases are connected via Internet. Discusses the problems of distributed database operation with reference to an example. Presents two statistical selection algorithms which are designed to select the jth smallest key from a very large file distributed over many computers. The objective of these algorithms is to minimise the number of communication messages necessary to the selection operation. One algorithm is for the intranet with broadcast/multicast facilities while the other is for Internet without broadcast/multicast facilities.

Details

Internet Research, vol. 12 no. 1
Type: Research Article
ISSN: 1066-2243

Keywords

Article
Publication date: 6 June 2008

Brian D. Davison, Wei Zhang and Baoning Wu

The purpose of this paper is to describe a means to improve the accessibility of files across different delivery platforms, making it possible to use a single search modality. The…

Abstract

Purpose

The purpose of this paper is to describe a means to improve the accessibility of files across different delivery platforms, making it possible to use a single search modality. The paper shows that both peer‐to‐peer file sharing networks and the worldwide web provide extensive information resources, and either network may contain data that satisfy a searcher's information need.

Design/methodology/approach

The paper proposes a gateway between the worldwide web and peer‐to‐peer networks that permits searchers on one side to be able to seamlessly search and retrieve files on the other side of the gateway. The design and prototype implementation of such a gateway to Gnutella is detailed, along with access statistics from test deployments and lessons learned.

Findings

The prototype implementation was found to demonstrate the feasibility of a seamless gateway between the Gnutella network and the worldwide web. Gnutella users saw millions of web search results and initiated retrievals via the gateway without knowing the source of the information or having to leave their Gnutella applications. Analysis of file retrieval logs showed that Gnutella search results lose value (to the original searcher) if delayed by more than a few seconds.

Research limitations/implications

The implementation is a prototype, fielded for only a few months within the Gnutella network. Future implementations need cooperation with a web search service, and ideally would connect to multiple services for different types of queries.

Practical implications

Deployment of the gateway architecture described would be of use to searchers and of value to content providers.

Originality/value

This paper's approach makes information in other networks seamlessly searchable and accessible.

Details

Internet Research, vol. 18 no. 3
Type: Research Article
ISSN: 1066-2243

Keywords

Article
Publication date: 1 May 2005

Hung‐Chang Hsiao, Chung‐Ta King and Shih‐Yen Gao

Resource discovery in peer‐to‐peer (P2P) systems have been extensively studied. Unfortunately, most of the systems studied are not designed to take advantage of the heterogeneity…

Abstract

Resource discovery in peer‐to‐peer (P2P) systems have been extensively studied. Unfortunately, most of the systems studied are not designed to take advantage of the heterogeneity in peer nodes. In this paper, we propose a novel P2P overlay called RATTAN, which serves as an underlay of a Gnutella‐like network. RATTAN exploits the heterogeneity of peer nodes by structuring capable nodes as the core of the overlay. Using a tree‐like structure, RATTAN can maximize the search scope with a minimal number of query messages. We evaluate RATTAN with simulation. The experiments show the following interesting results. First, RATTAN is robust by exploiting redundant overlay links. Second, the maximum bandwidth demand for processing the protocol of a single RATTAN overlay is nearly 1M bits/sec. However, around 80% of the nodes merely take 66 bits/sec. One implication is that we can use a small number of relatively capable peers (e.g., stable machines with a 100M bits/sec network interface) to process the 1M bits/sec protocol overhead and serve other peers that only need to spend 66 bits/sec for processing protocol overhead.

Details

International Journal of Pervasive Computing and Communications, vol. 1 no. 2
Type: Research Article
ISSN: 1742-7371

Keywords

Article
Publication date: 1 July 1993

Mike Clemmet

Investigates some complex issues concerning local area networking(LAN). Examines the two basic forms of networkpeer‐to‐peer andserver‐based and their advantages and…

Abstract

Investigates some complex issues concerning local area networking (LAN). Examines the two basic forms of networkpeer‐to‐peer and server‐based and their advantages and disadvantages for workgroups of various sizes. Compares Token Ring with Ethernet networks. Finally, offers some advice on choosing operating systems.

Details

Work Study, vol. 42 no. 7
Type: Research Article
ISSN: 0043-8022

Keywords

Article
Publication date: 1 April 2000

Siriginidi Subba Rao

Discusses CD‐ROM as a provider of multiple, simultaneous and remote access to a large amount of information such as abstracts, full text, directories, education materials, music…

Abstract

Discusses CD‐ROM as a provider of multiple, simultaneous and remote access to a large amount of information such as abstracts, full text, directories, education materials, music, etc. Presents a number of options that are available to increase access to a CD‐ROM collection and commonly used CD‐ROM networks under LANs, viz., peer‐to‐peer, file servers, client/server and optical servers. Also discusses selection of hardware and software for successful networking. Concludes that careful study of the pros and cons of establishing a CD‐ROM network has to be weighed in terms of cost and usage.

Details

Library Review, vol. 49 no. 3
Type: Research Article
ISSN: 0024-2535

Keywords

Article
Publication date: 1 March 2006

L. Kazatzopoulos, C. Delakouridis, G.F. Marias and P. Georgiadis

The purpose of this paper is to propose the use of priority‐based incentives for collaborative hiding of confidential information in dynamic environments, such as self‐organized…

Abstract

Purpose

The purpose of this paper is to propose the use of priority‐based incentives for collaborative hiding of confidential information in dynamic environments, such as self‐organized networks, peer‐to‐peer systems, pervasive and grid computing applications.

Design/methodology/approach

The paper documents the necessity of ISSON (Incentives for Secret‐sharing in Self‐Organised Networks); it provides functional and technical details on the proposed architecture; and, it assesses its feasibility in mobile ad‐hoc networks through real experiments. The paper elaborates on the availability of the hidden information through an analytical framework.

Findings

Through the real experiments, ISSON was found to be efficient in terms of communication and processing costs. Additionally, it avoids collusions for unauthorized revealing of the hidden information, and ensures the unlinkability and availability of the secret when it is divided and stored to peers.

Originality/value

The proposed, incentive‐based, privacy enforcement architecture is novel and applies to distributed, dynamic, and self‐configured computing environments.

Details

Internet Research, vol. 16 no. 2
Type: Research Article
ISSN: 1066-2243

Keywords

Article
Publication date: 19 October 2015

Wasim Ahmad Bhat and S.M.K. Quadri

The purpose of this paper is to explore the challenges posed by Big Data to current trends in computation, networking and storage technology at various stages of Big Data…

3224

Abstract

Purpose

The purpose of this paper is to explore the challenges posed by Big Data to current trends in computation, networking and storage technology at various stages of Big Data analysis. The work aims to bridge the gap between theory and practice, and highlight the areas of potential research.

Design/methodology/approach

The study employs a systematic and critical review of the relevant literature to explore the challenges posed by Big Data to hardware technology, and assess the worthiness of hardware technology at various stages of Big Data analysis. Online computer-databases were searched to identify the literature relevant to: Big Data requirements and challenges; and evolution and current trends of hardware technology.

Findings

The findings reveal that even though current hardware technology has not evolved with the motivation to support Big Data analysis, it significantly supports Big Data analysis at all stages. However, they also point toward some important shortcomings and challenges of current technology trends. These include: lack of intelligent Big Data sources; need for scalable real-time analysis capability; lack of support (in networks) for latency-bound applications; need for necessary augmentation (in network support) for peer-to-peer networks; and rethinking on cost-effective high-performance storage subsystem.

Research limitations/implications

The study suggests that a lot of research is yet to be done in hardware technology, if full potential of Big Data is to be unlocked.

Practical implications

The study suggests that practitioners need to meticulously choose the hardware infrastructure for Big Data considering the limitations of technology.

Originality/value

This research arms industry, enterprises and organizations with the concise and comprehensive technical-knowledge about the capability of current hardware technology trends in solving Big Data problems. It also highlights the areas of potential research and immediate attention which researchers can exploit to explore new ideas and existing practices.

Details

Industrial Management & Data Systems, vol. 115 no. 9
Type: Research Article
ISSN: 0263-5577

Keywords

1 – 10 of over 5000