The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
In distributed systems, multiple processes are cooperating with each other by exchanging messages in underlying networks. In order to realize distributed applications, a group of n processes are required to cooperate with each other. In a distributed group, each member process is peer and directly exchanges messages with other processes with no centralized coordination. That is, each process sends...
In peer-to-peer (P2P) overlay networks, a group of n (2) peer processes have to cooperate with each other. P2P systems are in nature scalable and distributed, Each peer sends messages to every peer and receives messages from every peer in a group. In group communications, each message sent by a peer is required to be causally delivered to every peer. Types of logical clocks are used to causally order...
In peer-to-peer (P2P) overlay networks, a group of ($\geq 2$) peer processes have to cooperate with each other. P2P systems are in nature scalable and distributed, where there is no centralized coordinator. Each peer sends messages to every peer and receives messages from every peer in a group. In group communications, each message sent by a peer is required to be causally delivered to every peer...
In peer-to-peer (P2P) overlay networks, a group of multiple peers have to cooperate with each other. P2P systems are in nature scalable, distributed systems, where there is no centralized coordinator. Hence, a group of peers is required to be scalable in P2P overlay networks. Each peer sends a message to every peer and every other peer receives the message in a group. In group communication, each...
In this paper, we consider the peer-to-peer (P2P) model as a fully distributed, scalable system different from centralized coordinated systems like Cloud computing systems. A P2P system is composed of peer processes (peers). Here, applications are realized in activities and cooperation of a group of multiple peers. Since there is no centralized coordination in P2P systems, each peer has to obtain...
A group of multiple peers are required to cooperate with each other in distributed peer-to-peer (P2P) applications. Here, messages have to be causally delivered to every peer. In our approach to realizing a scalable P2P group, messages are ordered by taking advantage of linear time (LT) and physical time (PT) since message length is O(1). Here, each peer has to hold information on clock accuracy of...
A group of peers are required to cooperate with each other in distributed applications on P2P overlay networks. In order to realize a scalable P2P group, messages are causally ordered by taking advantage of linear time (LT) and physical time (PT) since message length is O(1) in this paper. In this paper, we newly discuss a multi-layered model to realize a scalable group. A group is hierarchically...
A group of n (>;1) peers are required to cooperate with each other in distributed applications. In this paper, we consider a distributed group of multiple peers in P2P overlay networks. A P2P group is distributed, i.e. no centralized controller and is scalable and heterogeneous since various types and huge number of computers are interconnected in types of networks. In group communication, messages...
In peer-to-peer (P2P) applications, a group of multiple peer processes (peers) are required to cooperate with each other in a distributed manner. Messages sent by peers have to be causally delivered to every peer in a group. Due to the message overhead O(n) for the number n of peers, the vector clock cannot be used to causally deliver messages in a scalable group. On the other hand, the linear clock...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.