Paper Duplication Method Supported by Task 


Vol. 27,  No. 1, pp. 103-111, Jan.  2002


PDF Full-Text
  Abstract

In RNC of IMT-2000, main control processors such as ASP, ACP and OMP are responsible for call control function, and the high reliability and real-time property should be provided for it. So, the study of real-time fault-tolerant for it is needed. In this paper, we proposes an Task based duplication method, in which Tasks in active side operate on message unit and send the updaled data to standby side after operalion, log in the message to standby side for recovery during take-over. This scheme decreases the dual down and the complexity of synchronization procedure, and performs the synchronization more exactly because Tasks control the synchronization of system.
This paper also proposes the fault detection and the fault handling method for effective implementation of Task based duplication. This scheme focus on increasing the fault detection rate and intercepting originally that fault data is send to standby side.

  Statistics
Cumulative Counts from November, 2022
Multiple requests among the same browser session are counted as one view. If you mouse over a chart, the values of data points will be shown.


  Cite this article

[IEEE Style]

J. Lee, S. Park, K. Kang, "Paper Duplication Method Supported by Task," The Journal of Korean Institute of Communications and Information Sciences, vol. 27, no. 1, pp. 103-111, 2002. DOI: .

[ACM Style]

Jong-chan Lee, Sang-joon Park, and Kwon-il Kang. 2002. Paper Duplication Method Supported by Task. The Journal of Korean Institute of Communications and Information Sciences, 27, 1, (2002), 103-111. DOI: .

[KICS Style]

Jong-chan Lee, Sang-joon Park, Kwon-il Kang, "Paper Duplication Method Supported by Task," The Journal of Korean Institute of Communications and Information Sciences, vol. 27, no. 1, pp. 103-111, 1. 2002.

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)






pISSN : 1226 - 4717
eISSN : 2287 - 3880