The IRMA Community
Newsletters
Research IRM
Click a keyword to search titles using our InfoSci-OnDemand powered search:
|
A Comparative Study of SIP Overload Control Algorithms
|
|
Author(s): Yang Hong (Carleton University, Canada), Changcheng Huang (Carleton University, Canada)and James Yan (Carleton University, Canada)
Copyright: 2013
Pages: 20
Source title:
Network and Traffic Engineering in Emerging Distributed Computing Applications
Source Author(s)/Editor(s): Jemal H. Abawajy (Deakin University, Australia), Mukaddim Pathan (Australian National University, Australia), Mustafizur Rahman (The University of Melbourne, Australia), Al-Sakib Khan Pathan (International Islamic University Malaysia (IIUM), Malaysia)and Mustafa Mat Deris (Universiti Tun Hussein Onn (UTHM), Malaysia)
DOI: 10.4018/978-1-4666-1888-6.ch001
Purchase
|
Abstract
Recent collapses of SIP servers in the carrier networks indicates two potential problems of SIP: (1) the current SIP design does not easily scale up to large network sizes, and (2) the built-in SIP overload control mechanism cannot handle overload conditions effectively. In order to help carriers prevent widespread SIP network failure effectively, this chapter presents a systematic investigation of current state-of-the-art overload control algorithms. To achieve this goal, this chapter first reviews two basic mechanisms of SIP, and summarizes numerous experiment results reported in the literatures which demonstrate the impact of overload on SIP networks. After surveying the approaches for modeling the dynamic behaviour of SIP networks experiencing overload, the chapter presents a comparison and assessment of different types of SIP overload control solutions. Finally it outlines some research opportunities for managing SIP overload control.
Related Content
|
.
© 2026.
36 pages.
|
|
.
© 2026.
26 pages.
|
|
.
© 2026.
22 pages.
|
|
.
© 2026.
34 pages.
|
|
.
© 2026.
40 pages.
|
|
.
© 2026.
34 pages.
|
|
.
© 2026.
34 pages.
|
|
|