Run Synchronization in the Priority-Based Ordering Broadcast Protocol

概要

論文の詳細を見る
In distributed applications like groupware, various kinds of data like transactions, files, and voice have to be delivered to multiple destinations. One approach to providing various kinds of communication by using a single-channel network is to give a priority to each protocol data unit (PDU)and to deliver higher-priority PDUs to the destinations earlier than lower-priority ones. In this paper, we discuss a distributed broadcast protocol which provide priority-based ordering of PDUs for entities by using the single-channel network in the presence of the loss of PDUs. There is a starvation problem in the priority-based service, i.e. lower-priority PDUs can be left waiting indefinitely in the receipt queue. In this paper, we present a method by which even lower-priority PDUs are delivered to the application in some pre-defined time by partitioning the receipt sequence of PDUs into runs, each of which is priority-based ordered. In section 2,we present a basic concepts,In section 3,we formally define the priority-based broadcast service. In section 4,we show the broadcast protocol which provides the priority-based ordering delivery of PDUs. In section 5,we discuss how to resolve the starvation problem.
一般社団法人情報処理学会の論文
1993-03-01