The Virtual Twin

2008 ◽  
pp. 619-629
Author(s):  
Alexandre Gachet ◽  
Pius Haettenschwiler
Keyword(s):  
Ad Hoc ◽  
Critical Mass ◽  
Peer To Peer ◽  
Peer Networks ◽  
Social Aspect ◽  
Client Server ◽  
Abstraction Layer ◽  
Self Organized ◽  
Peer To Peer Networks ◽  
Main Components

As peer-to-peer computing finally reaches a critical mass, it triggers changes in the IT landscape that traditional network infrastructures, based on centralized, client/server topologies, cannot manage. Consequently, the ad hoc, self-organized, and loosely controlled nature of peer-to-peer networks needs to be supported by a new coordination layer representing the interests of the user. In order to define this new abstraction layer, this paper introduces the concept of the virtual twin — a kind of anthropomorphic representation of the networked person with whom the user can identify and feel comfortable. We discuss the inner structure of the virtual twin, first in an intuitive and informal way with an emphasis on its social aspect, then in a more detailed way with the analysis of its main components.

scholarly journals Securing Passive Objects in Mobile Ad-Hoc Peer-to-Peer Networks

2003 ◽  
Vol 85 (3) ◽  
pp. 105-121 ◽  
Author(s):  
Rene Mayrhofer ◽  
Florian Ortner ◽  
Alois Ferscha ◽  
Manfred Hechinger
Keyword(s):  
Ad Hoc ◽  
Peer To Peer ◽  
Peer Networks ◽  
Peer To Peer Networks ◽  
Mobile Ad Hoc

scholarly journals Efficient resource discovery in self-organized unstructured peer-to-peer networks

2009 ◽  
Vol 21 (2) ◽  
pp. 159-183 ◽  
Author(s):  
Lu Liu ◽  
Nick Antonopoulos ◽  
Stephen Mackin ◽  
Jie Xu ◽  
Duncan Russell
Keyword(s):  
Resource Discovery ◽  
Peer To Peer ◽  
Peer Networks ◽  
Self Organized ◽  
Peer To Peer Networks ◽  
Efficient Resource

An Analysis of Network Coding Algorithms

2017 ◽  
Vol 7 (12) ◽  
pp. 78 ◽  
Author(s):  
Anmoldeep Singh Sandhu
Keyword(s):  
Network Coding ◽  
Ad Hoc ◽  
Peer To Peer ◽  
Peer Networks ◽  
New Paradigm ◽  
Basic Principles ◽  
Efficient Coding ◽  
Main Application ◽  
Peer To Peer Networks ◽  
High Degree

Network coding is a network packet transmitting protocol, applied to increase the achievable throughput for the exchange of information between two terminals through one relay. Throughput efficiency this paper reviews latency and bandwidth efficient coding algorithm based on principles of network coding for retransmitting lost packets in wireless multicast network. It outlines the basic principles and important techniques for retransmission of packets in network coding.Network coding is new paradigm that allows the intermediate nodes in a network to create new packets by combining packets received on their incoming edges. The main application of the networking coding technique includes content distribution, peer to peer networks, and wireless ad-hoc networks.Such network is characterized by highly dynamic set of users and frequent topological changes. There are two main advantages of Network coding approach are potential throughput improvements and a high degree of robustness.

MiNet: Building Ad-Hoc Peer-to-Peer Networks for Information Sharing Based on Mobile Agents

2004 ◽  
pp. 59-70 ◽  
Author(s):  
Takafumi Yamaya ◽  
Toramatsu Shintani ◽  
Tadachika Ozono ◽  
Yusuke Hiraoka ◽  
Hiromitsu Hattori ◽  
...  
Keyword(s):  
Information Sharing ◽  
Mobile Agents ◽  
Ad Hoc ◽  
Peer To Peer ◽  
Peer Networks ◽  
Peer To Peer Networks

On the Stability of Peer-to-Peer Networks in Real-World Environments

2009 ◽  
pp. 622-630
Author(s):  
Zoltán Czirkos ◽  
Gábor Hosszú
Keyword(s):  
Computer Networks ◽  
Real World ◽  
Network Traffic ◽  
Peer To Peer ◽  
Central Point ◽  
The Other ◽  
Peer Networks ◽  
Client Server ◽  
Peer To Peer Networks ◽  
The Stability

Communication in computer networks can be organized in two different ways, according to the client/ server model and the peer-to-peer model (Spinellis & Androutsellis-Theotokis, 2004). In the client/server model, the network is centralized. There is one host on the network, the server, which provides services to its clients. Its network address is usually well-known. On the other hand, in the peer-to-peer model, there is no central point in the network. Hosts participating are sometimes called “servents” (Gnutella, 2006), as they act both as servers and as clients at the same time: they provide services to other servents, while they also use the services of others. Nodes in unstructured peer-to-peer networks usually communicate via message flooding. For example, a search request for a given file in the Gnutella network is sent to all neighboring servents. However, this solution is not scalable, and it generates a lot of unnecessary network traffic.

Sign in / Sign up

Export Citation Format

Share Document