With the rising demand for protection against new risks such as loss of digital assets, novel insurance services and products emerge. In particular, token-based solutions on blockchain transform business by providing cover streamlined, (semi-)automated underwriting claim processes. chapter, we present a general framework solutions, delegating their fundamental building blocks that include core ...

This article presents a fault tolerant extension for the NaimiTrehel token-based mutual exclusion algorithm. Contrary to the extension proposed by Naimi-Trehel, our approach minimizes the use of broadcast support by exploiting the distributed queue of token requests kept by the original algorithm. It also provides good fairness since, during failure recovery, it tries to preserve the order in w...

Ordered multicast is an important building block for many distributed applications, and there are many existing protocols providing this service, which is often referred to as total order broadcast or atomic broadcast. However, few of the existing protocols were specifically designed for high-performance in modern data center environments. This thesis introduces a new ordered multicast protocol...

Penelitian ini bertujuan untuk meningkatkan keterampilan berbicara pada siswa kelas X DPIB 3 (Desain Pembangunan dan Ilmu Bangunan) di sekolah SMK Negeri 2 Medan.Tujuan penelitian (1) Mengetahui terdapat peningkatan dengan menggunakan model time token, (2) penerapan token berbicara. Teknik pengambilan teknik purposive sample yang diambil terfokus satu kelas. tindakan dilakukan yakni menjalankan...

This memo specifies the MTU and frame format for transmission of IPv6 packets on Token Ring networks. It also specifies the method of forming IPv6 link-local addresses on Token Ring networks and the content of the Source/Target Link-layer Address option used the Router Solicitation, Router Advertisement, Redirect, Neighbor Solicitation and Neighbor Advertisement messages when those messages are...

We study problems of reconfigurability of independent sets in graphs. We consider three different models (token jumping, token sliding, and token addition and removal) and analyze relationships between them. We prove that independent set reconfigurability in perfect graphs (under any of the three models) generalizes the shortest path reconfigurability problem in general graphs and is therefore ...