Asymptotic Analysis of Instant Messaging Service with Relay Nodes

Authors: Muhammad T. Alam, Zheng Da Wu

Abstract:

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.

Keywords: Instant messaging, stateless, chunking, MSRP.

Digital Object Identifier (DOI): doi.org/10.5281/zenodo.1329959

References:

[1] B. Campbell, J. Rosenberg, H. Schulzrine, C. Huitema, and D. Gurle, ''Session Initiation Protocol (SIP) Extension for Instant Messaging'', RFC 3428, Internet Engineering Task Force, (2002).
[2] 3GPP, Internet Protocol (IP) multimedia call control protocol based on Session Initiation Protocol (SIP) and Session Description Protocol (SDP); Stage 3, TS 24.229.
[3] E. Burger, ''A Mechanism for Content Indirection in Session Initiation Protocol (SIP) Messages'' RFC 4483, Internet Engineering Task Force, (2006).
[4] M. Debbabi, M. Rahman, W. Lin, J. Gopal, S. Sridhar, ''Standard SIP-based instant messaging and presence APIs for networked devices'', Networked Appliances, Proceedings. IEEE 5th International Workshop on, 30-31 Oct. (2002), pp: 59 - 64.
[5] M. Gomez, J. L. Megias, C. Bueno, C. Brocal, ''Interworking between the Multimedia Messaging Service (MMS) and the 3G IP Multimedia subsystem (IMS) Instant Messaging Service'', IEEE 16th International Symposium on Personal, Indoor and Mobile Radio communications, (2005), pp: 22742-278.
[6] L. Zhou, ''An empirical Investigation of Deception Behaviour in Instant Messaging'', IEEE Transactions on Personal Communication, Vol: 48 (2), (2005), pp: 147-160.
[7] C. Jennings, R. Mahy, A. B. Roach, ''Relay Extensions for the Message Sessions Relay Protocol (MSRP)'', Internet Engineering Task force, draft-ietf-simple-msrp-relays-09.txt, (2007), Work on Progress.
[8] M. Gastpar, M. Vetterli, ''On the capacity of wireless networks: the relay case'' INFOCOM 2002. Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings. IEEE, Vol: 3, 23-27 June (2002), pp: 1577 - 1586, Digital Object Identifier 10.1109/INFCOM.2002.1019409.
[9] B. Wang, J. Zhang, A. Host-Madsen, ''On the capacity of MIMO relay channels'', Information Theory, IEEE Transactions on, Vol: 51 (1), Jan. (2005), pp: 29 - 43, Digital Object Identifier 10.1109/TIT.2004.839487.
[10] H. B?olcskei, R. U. Nabar, O. Oyman, A. J. Paulraj, ''Capacity Scaling Laws in MIMO Relay Networks'', IEEE Transactions on Wireless Communications, Vol: 5 (6), June (2006), pp: 1433-1443.
[11] Z. Zhang, Z. Duan, and Y. Hou, ''Fundamental Trade-offs in Aggregate Packet Scheduling'', Parallel and Distributed Systems, IEEE Transactions on, Vol: 16 (12) (2005), pp: 1166-1177.
[12] R. L. Cruz, ''A calculus for network delay. I. Network elements in isolation'', Information Theory, IEEE Transactions on, Vol: 37 (1), (1991), pp: 114 - 131, Digital Object Identifier 10.1109/18.61109.
[13] R. L. Cruz, ''A calculus for network delay. II. Network analysis'', Information Theory, IEEE Transactions on, Vol: 37 (1), (1991), pp: 132 - 141, Digital Object Identifier 10.1109/18.61110.
[14] J. Kaur, H. M. Vin, ''Core-stateless guaranteed throughput networks'', IEEE INFOCOM, Vol: 3, 2003, pp: 2155 - 2165.
[15] J. Kaur, H. M. Vin, ''Core-stateless guaranteed rate scheduling algorithms'', IEEE INFOCOM, Vol: 3, 2001, pp: 1484 - 1492.
[16] Z. Zhang, Z. Duan, and Y. Gao , ''A core stateless bandwidth broker architecture for scalable support of guaranteed services", Parallel and Distributed Systems, IEEE Transactions on, Vol: 15 (2), 2004, pp: 167 - 182.
[17] Z. Zhang, Z. Duan, and Y. Hou, ''Virtual time reference system: a unifying scheduling framework for scalable support of guaranteed services'', Selected Areas in Communications, IEEE Journal on, Vol: 18 (12), 2000, pp: 2684 - 2695.
[18] C. Li, E. W. Knightly, ''Coordinated multihop scheduling: a framework for end-to-end services'', Networking, IEEE/ACM Transactions on, Vol: 10 (6), Dec. 2002, pp: 776 - 789.
[19] C. Li, E. W. Knightly, ''Schedulability criterion and performance analysis of coordinated schedulers'', Networking, IEEE/ACM Transactions on Vol: 13 (2), April 2005, pp: 276 - 287.
[20] B. Campbell, R. Mahy, C. Jennings, ''The Message Session Relay Protocol''. Internet-Draft draft-ietf-simple-message-sessions-18, Internet Engineering Task Force, 2007, Work in Progress.
[21] 3GPP, TSG SSA, IP Multimedia Subsystem (IMS) '' Stage 2 (Release 7), TS 23.228 v.7.3.0, 2006-03.