ACSC '05 Proceedings of the Twenty-eighth Australasian conference on Computer Science - Volume 38
Performance tradeoffs in mobile computing: to fetch or not to fetch?
Proceedings of the 5th ACM international workshop on Mobility management and wireless access
APPT'05 Proceedings of the 6th international conference on Advanced Parallel Processing Technologies
Adaptive buffering-based on handoff prediction for wireless internet continuous services
HPCC'05 Proceedings of the First international conference on High Performance Computing and Communications
ISPA'04 Proceedings of the Second international conference on Parallel and Distributed Processing and Applications
Hi-index | 0.00 |
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.