• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.4B
• /
• pp.306-315
• /
• 2003

On the optical network, it is important to build restoration scheme capable to network survivability in preparation of potential failure on communication route. This analyze the existing schemes on restoration of failure on the optical network, and propose deferred commit scheme to improve resource utilization signal management efficiency. Also, the transfer flow of messages needed for transferring restoration signal are presented in a concrete way and delay time required by shared mesh restoration scheme is explained in a substantial way. Simulation-based comparative analysis of various scheme is performed.

• The KIPS Transactions:PartC
• /
• v.10C no.5
• /
• pp.603-610
• /
• 2003

On the optical network, it is important to build restoration scheme capable to network survivability in preparation of potential failure on communication route. This paper analyze the existing schemes on restoration of failure on the optical network, and propose deferred commit scheme to improve resource utilization and management efficiency. Also, the transfer flow of messages needed for transferring restoration signal are presented in a concrete way and delay time required by shared mesh restoration scheme is explained in a substantial way. Simulation-based comparative analysis of various schemes is performed.

• Journal of the Korea Society of Computer and Information
• /
• v.10 no.5 s.37
• /
• pp.41-48
• /
• 2005

In this thesis, we propose a concurrency control scheme which schedules global transactions in multidatabase systems Unlike other scheme which commit global transactions as soon as they have finished their execution, this scheme has attempted to delay them if their exist another global transactions that should be proceeded. Owing to the deferred commitment, the number of global restarts could be greatly reduced. This scheme's performance gain increased through simulations in case more than one LDBS employ timestamp ordering(TO) as a local concurrency control scheme.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.4
• /
• pp.1655-1673
• /
• 2018

Mobile computing environment is subject to the constraints of bounded network bandwidth, frequently encountered disconnections, insufficient battery power, and system asymmetry. To meet these constraints and to gain high scalability, data broadcasting has been proposed on data transmission techniques. However, updates made to the database in any broadcast cycle are deferred to the next cycle in order to appear to mobile clients with lower data currency. The main goal of this paper is to enhance the transaction performance processing and database currency. The main approach involves decomposing the main broadcast cycle into a number of sub-cycles, where data items are broadcasted as they were originally sequenced in the main cycle while appearing in the most current versions. A concurrency control method AOCCRBSC is proposed to cope well with the cycle decomposition. The proposed method exploits predeclaration and adapts the AOCCRB method by customizing prefetching, back-off, and partial backward and forward validation techniques. As a result, more than one of the conflicting transactions is allowed to commit at the server in the same broadcast cycle which empowers the processing of both update and read-only transactions and improves data currency.