Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/19504
Title: An adaptive buffer management algorithm for enhancing dependability and performance in mobile-object-based real-time computing
Authors: Ip, MTW
Lin, WWK
Wong, AKY
Dillon, TS
Wang, D
Keywords: Internet
Buffer storage
Message passing
Mobile computing
Object-oriented programming
Real-time systems
Software agents
Three-term control
Issue Date: 2001
Publisher: IEEE
Source: Fourth IEEE International Symposium on Object-Oriented Real-Time Distributed Computing, 2001 : ISORC-2001 : proceedings : May 2001, Magdeburg, p. 138-144 How to cite?
Abstract: In an ORC (object oriented real time computing) environment, it is important to reduce message retransmissions during message passing because these retransmissions cause significant time delay, and this makes it difficult to achieve the necessary timeliness. A cause of retransmission is message loss due to buffer overflow at the reception side. Here a P+I+D (P for proportional, I for integral and D for derivative) adaptive buffer control algorithm is proposed to prevent such possible overflow. The I control depends on the Convergence Algorithm (CA), which is a stable and efficient IEPM (Internet End-to-End Performance Measurement) tool that predicts the mean message roundtrip time (RTT) of a communication channel quickly and accurately. The P+I+D algorithm was tested under different conditions in a mobile ORC (MORC) environment where mobile agents collaborate freely over the Internet. The different test results confirm that the proposed P+I+D approach is indeed effective for preventing buffer overflow
URI: http://hdl.handle.net/10397/19504
ISBN: 0-7695-1089-2
DOI: 10.1109/ISORC.2001.922829
Appears in Collections:Conference Paper

Access
View full-text via PolyU eLinks SFX Query
Show full item record

SCOPUSTM   
Citations

16
Last Week
0
Last month
Citations as of Dec 6, 2017

Page view(s)

43
Last Week
2
Last month
Checked on Dec 11, 2017

Google ScholarTM

Check

Altmetric



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.