Overload control for short message transfer in GPRS/UMTS networks

被引:3
|
作者
Haung, YR
Ho, JM
机构
[1] Yuan Ze Univ, Dept Comp Sci & Engn, Chungli 320, Toayuan, Taiwan
[2] Acad Sinica, Inst Informat Sci, Taipei 115, Taiwan
关键词
GPRS; UMTS; SMS; SGSN; overload control;
D O I
10.1016/j.ins.2004.02.023
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
In the General Packet Radio Service (GPRS)/Universal Mobile Telecommunications System (UMTS) short message service (SMS) network, the serving GPRS support node (SGSN) stores the message in a queue until it is successfully transferred to the mobile device or its maximum waiting time expires. The queued message is forwarded to the new SGSN and is immediately removed from the waiting queue of the old SGSN, if the corresponding mobile device leaves the old SGSN area before the valid queueing time expires. Once the SGSN's buffer is full, all incoming messages must be discarded and retransmitted later. Under this situation, the messages, especially the forwarded messages, suffer from a longer delay before being successfully delivered. To prevent messages from being excessively delayed, this paper proposes an SGSN overload control scheme called the N-overload scheme. According to this scheme, a newly arriving message is discarded if the buffer is full upon its arrival. A forwarded message, however, is queued in an overload space of size N. Taking the forwarding and the expiration effects of queued messages into account, this paper also develops an analytical model to study the performance for the SGSN using the N-overload scheme. On the basis of the analysis, the optimal value of N is numerically determined so that the loss probability for the forwarded messages is minimized.
引用
收藏
页码:235 / 249
页数:15
相关论文
共 50 条
  • [31] A Tobit Model on Message Transfer and Control in Instant Message Systems
    Zhao, Yuanping
    Yan, Qiang
    Shu, Huaying
    2009 5TH INTERNATIONAL CONFERENCE ON WIRELESS COMMUNICATIONS, NETWORKING AND MOBILE COMPUTING, VOLS 1-8, 2009, : 5446 - 5448
  • [32] INFORMATION NETWORKS - DEFINITIONS AND MESSAGE TRANSFER MODELS
    NANCE, RE
    BHAT, UN
    KORFHAGE, RR
    JOURNAL OF THE AMERICAN SOCIETY FOR INFORMATION SCIENCE, 1972, 23 (04): : 237 - &
  • [33] Error control techniques for efficient multicast streaming in UMTS networks
    Fitzek, F
    Rossi, M
    Zorzi, M
    7TH WORLD MULTICONFERENCE ON SYSTEMICS, CYBERNETICS AND INFORMATICS, VOL X, PROCEEDINGS: SIGNALS PROCESSING AND OPTICAL SYSTEMS, TECHNOLOGIES AND APPLICATIONS, 2003, : 359 - 366
  • [34] Admission control in UMTS networks based on approximate dynamic programming
    Pietrabissa, Antonio
    EUROPEAN JOURNAL OF CONTROL, 2008, 14 (01) : 62 - 75
  • [35] Quality Control in UMTS and LTE Networks using Tensor Methods
    Gaysin, A. K.
    Nadeev, A. F.
    2018 SYSTEMS OF SIGNAL SYNCHRONIZATION, GENERATING AND PROCESSING IN TELECOMMUNICATIONS (SYNCHROINFO), 2018,
  • [36] Admission control in UMTS networks based on approximate dynamic programming
    Computer and System Science Department , University of Rome la Sapienza, via Eudossiana 18, 00184 Rome, Italy
    Eur J Control, 2008, 1 (62-75):
  • [37] On overload control of intelligent peripherals in intelligent networks
    Kihl, M
    Rumsewicz, MP
    IEEE GLOBECOM 1996 - CONFERENCE RECORD, VOLS 1-3: COMMUNICATIONS: THE KEY TO GLOBAL PROSPERITY, 1996, : 1539 - 1543
  • [38] Overload control for mobile data service networks
    State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, Beijing 100876, China
    Beijing Youdian Daxue Xuebao, 2006, 1 (100-103):
  • [39] SIMULATION OF OVERLOAD CONTROL IN SIP SERVER NETWORKS
    Abaev, Pavel O.
    Gaidamaka, Yuliya V.
    Pechinkin, Alexander V.
    Razumchik, Rostislav V.
    Shorgin, Sergey Ya.
    PROCEEDINGS 26TH EUROPEAN CONFERENCE ON MODELLING AND SIMULATION ECMS 2012, 2012, : 533 - +
  • [40] An Efficient Scheme for MTC Overload Control based on Signaling Message Compression
    Taleb, Tarik
    Ksentini, Adlen
    2013 IEEE GLOBAL COMMUNICATIONS CONFERENCE (GLOBECOM), 2013, : 342 - 346