Asymptotic analysis of instant messaging service with relay nodes

Date of this Version


Document Type

Journal Article

Publication Details

Published Version.

Alam, M. T. & Wu, Z. D. (2007). Asymptotic analysis of instant messaging service with relay nodes. International journal of computer, information, and systems science, and engineering, 1(1), 1-9.

Access the publisher's website.

2007 HERDC submission.

© Copyright World Academy of Science, Engineering and Technology, 2007


In this paper, we provide complete end-to-end delay analyses including the relay nodes for instant messages. Message Session Relay Protocol (MSRP) is used to provide congestion control for large messages in the Instant Messaging (IM) service. Large messages are broken into several chunks. These chunks may traverse through a maximum number of two relay nodes before reaching destination according to the IETF specification of the MSRP relay extensions. We discuss the current solutions of sending large instant messages and introduce a proposal to reduce message flows in the IM service. We consider virtual traffic parameter i.e., the relay nodes are stateless non-blocking for scalability purpose. This type of relay node is also assumed to have input rate at constant bit rate. We provide a new scheduling policy that schedules chunks according to their previous node’s delivery time stamp tags. Validation and analysis is shown for such scheduling policy. The performance analysis with the model introduced in this paper is simple and straight forward, which lead to reduced message flows in the IM service.



This document has been peer reviewed.