Implementation and performance analysis for emulation of causal ordering protocol on Internet

碩士 === 國立中正大學 === 通訊工程研究所 === 90 === In a distributed system, each site must communicate with other sites by exchanging messages in the synchronous way. Therefore, messages that are sent to and received by all sites must be ordered according to their cause-effect relation to ensure correc...

Full description

Bibliographic Details
Main Authors: wen-liang kuo, 郭文亮
Other Authors: Kim-Joan Chen
Format: Others
Language:zh-TW
Published: 2002
Online Access:http://ndltd.ncl.edu.tw/handle/82820294716362209211
id ndltd-TW-090CCU00650008
record_format oai_dc
spelling ndltd-TW-090CCU006500082015-10-13T17:34:58Z http://ndltd.ncl.edu.tw/handle/82820294716362209211 Implementation and performance analysis for emulation of causal ordering protocol on Internet 在網際網路上實擬因果次序協定之實作與效能分析 wen-liang kuo 郭文亮 碩士 國立中正大學 通訊工程研究所 90 In a distributed system, each site must communicate with other sites by exchanging messages in the synchronous way. Therefore, messages that are sent to and received by all sites must be ordered according to their cause-effect relation to ensure correct behavior of the system. However, due to unpredictable network delay, the ordering requirement of the messages may be violated at the receiving sites. To cope with the ordering issue, causal-ordering protocol was proposed. Moreover, in real-time distributed systems, not only all sites must maintain proper causal-ordering relation of messages but the life-time of the messages concerned as well. Here the -causal ordering protocol which is based on causal-ordering protocol addresses the real-time issue at the same time. Most research proposes new theories or new structures for particular applications. Few of them pay attention on the actual performance of these protocols on all sites in real-time distributed systems. In this paper, we studied related issues and implement the -causal ordering protocol on Internet and also on the emulated network. We have also observed the interaction of all sites under the protocol, verified the protocol behavior in different environments and research into the potential reason of observed phenomenon. Eventually, we have concluded our result about the choice of the  value. In this paper, we have found that the  value must be as possible as small, subject to the lowest throughput requirement of the real-time distributed system. If the  value is large, we have found that reliable retransmissions help some sites to decrease the overhead of synchronization. We believe our research will be beneficial to the improvement of the group communication in the future and can provide some helpful reference for the designer. Kim-Joan Chen 陳景章 2002 學位論文 ; thesis 88 zh-TW
collection NDLTD
language zh-TW
format Others
sources NDLTD
description 碩士 === 國立中正大學 === 通訊工程研究所 === 90 === In a distributed system, each site must communicate with other sites by exchanging messages in the synchronous way. Therefore, messages that are sent to and received by all sites must be ordered according to their cause-effect relation to ensure correct behavior of the system. However, due to unpredictable network delay, the ordering requirement of the messages may be violated at the receiving sites. To cope with the ordering issue, causal-ordering protocol was proposed. Moreover, in real-time distributed systems, not only all sites must maintain proper causal-ordering relation of messages but the life-time of the messages concerned as well. Here the -causal ordering protocol which is based on causal-ordering protocol addresses the real-time issue at the same time. Most research proposes new theories or new structures for particular applications. Few of them pay attention on the actual performance of these protocols on all sites in real-time distributed systems. In this paper, we studied related issues and implement the -causal ordering protocol on Internet and also on the emulated network. We have also observed the interaction of all sites under the protocol, verified the protocol behavior in different environments and research into the potential reason of observed phenomenon. Eventually, we have concluded our result about the choice of the  value. In this paper, we have found that the  value must be as possible as small, subject to the lowest throughput requirement of the real-time distributed system. If the  value is large, we have found that reliable retransmissions help some sites to decrease the overhead of synchronization. We believe our research will be beneficial to the improvement of the group communication in the future and can provide some helpful reference for the designer.
author2 Kim-Joan Chen
author_facet Kim-Joan Chen
wen-liang kuo
郭文亮
author wen-liang kuo
郭文亮
spellingShingle wen-liang kuo
郭文亮
Implementation and performance analysis for emulation of causal ordering protocol on Internet
author_sort wen-liang kuo
title Implementation and performance analysis for emulation of causal ordering protocol on Internet
title_short Implementation and performance analysis for emulation of causal ordering protocol on Internet
title_full Implementation and performance analysis for emulation of causal ordering protocol on Internet
title_fullStr Implementation and performance analysis for emulation of causal ordering protocol on Internet
title_full_unstemmed Implementation and performance analysis for emulation of causal ordering protocol on Internet
title_sort implementation and performance analysis for emulation of causal ordering protocol on internet
publishDate 2002
url http://ndltd.ncl.edu.tw/handle/82820294716362209211
work_keys_str_mv AT wenliangkuo implementationandperformanceanalysisforemulationofcausalorderingprotocoloninternet
AT guōwénliàng implementationandperformanceanalysisforemulationofcausalorderingprotocoloninternet
AT wenliangkuo zàiwǎngjìwǎnglùshàngshínǐyīnguǒcìxùxiédìngzhīshízuòyǔxiàonéngfēnxī
AT guōwénliàng zàiwǎngjìwǎnglùshàngshínǐyīnguǒcìxùxiédìngzhīshízuòyǔxiàonéngfēnxī
_version_ 1717782267479195648