OpenSIP: Toward Software-Defined SIP Networking

被引:15
|
作者
Montazerolghaem, Ahmadreza [1 ]
Moghaddam, Mohammad Hossein Yaghmaee [1 ]
Leon-Garcia, Alberto [2 ]
机构
[1] Ferdowsi Univ Mashhad, Dept Comp Engn, Mashhad 9177948974, Iran
[2] Univ Toronto, Dept Elect & Comp Engn, Toronto, ON M5S 1A1, Canada
关键词
SIP network management; SIP routing; SIP resource allocation; SDN and NFV orchestration; OpenFlow; END OVERLOAD CONTROL; VIRTUALIZATION; CONTROLLER; DESIGN;
D O I
10.1109/TNSM.2017.2741258
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
VoIP is becoming a low-priced and efficient replacement for PSTN in communication industries. With a widely growing adoption rate, session initiation protocol (SIP) is an application layer signaling protocol, standardized by the IETF, for creating, modifying, and terminating VoIP sessions. Generally speaking, SIP routes a call request to its destination by using SIP proxies. With the increasing use of SIP, traditional configurations pose certain drawbacks, such as ineffective routing, un-optimized management of proxy resources (including CPU and memory), and overload conditions. This paper presents OpenSIP to upgrade the SIP network framework with emerging technologies, such as software-defined networking (SDN) and network function virtualization (NFV). SDN provides for management that decouples the data and control planes along with a software-based centralized control that results in effective routing and resource management. Moreover, NFV assists SDN by virtualizing various network devices and functions. However, current SDN elements limit the inspected fields to layer 2-4 headers, whereas SIP routing information resides in the layer-7 header. A benefit of OpenSIP is that it enforces policies on SIP networking that are agnostic to higher layers with the aid of a deep packet inspection engine. Among the benefits of OpenSIP is programmability, cost reduction, unified management, routing, as well as efficient load balancing. This paper implements OpenSIP on a real testbed which includes Open vSwitch and the Floodlight controller. The results show that the proposed architecture has a low overhead and satisfactory performance and, in addition, can take advantage of a flexible scale-out design during application deployment.
引用
收藏
页码:184 / 199
页数:16
相关论文
共 50 条
  • [1] Toward Software-Defined Middlebox Networking
    Gember, Aaron
    Prabhu, Prathmesh
    Ghadiyali, Zainab
    Akella, Aditya
    [J]. PROCEEDINGS OF THE 11TH ACM WORKSHOP ON HOT TOPICS IN NETWORKS (HOTNETS-XI), 2012, : 7 - 12
  • [2] Toward Software-Defined Battlefield Networking
    Nobre, Jeferson
    Rosario, Denis
    Both, Cristiano
    Cerqueira, Eduardo
    Gerla, Mario
    [J]. IEEE COMMUNICATIONS MAGAZINE, 2016, 54 (10) : 152 - 157
  • [3] Toward manageable middleboxes in software-defined networking
    Zadkhosh, Ehsan
    Bahramgiri, Hossein
    Sabaei, Masoud
    [J]. ETRI JOURNAL, 2020, 42 (02) : 186 - 195
  • [4] Software-Defined Networking
    Kirkpatrick, Keith
    [J]. COMMUNICATIONS OF THE ACM, 2013, 56 (09) : 16 - 19
  • [5] Software-defined networking
    Greene, Kate
    [J]. Technology Review, 2009, 112 (02)
  • [6] Software-Defined Networking
    Zhili Sun
    Jiandong Li
    Kun Yang
    [J]. ZTE Communications, 2014, 12 (02) : 1 - 2
  • [7] A Survey on Software-Defined Networking
    Xia, Wenfeng
    Wen, Yonggang
    Foh, Chuan Heng
    Niyato, Dusit
    Xie, Haiyong
    [J]. IEEE COMMUNICATIONS SURVEYS AND TUTORIALS, 2015, 17 (01): : 27 - 51
  • [8] Software-Defined Networking: A survey
    Farhady, Hamid
    Lee, HyunYong
    Nakao, Akihiro
    [J]. COMPUTER NETWORKS, 2015, 81 : 79 - 95
  • [9] SDPA: Toward a Stateful Data Plane in Software-Defined Networking
    Sun, Chen
    Bi, Jun
    Chen, Haoxian
    Hu, Hongxin
    Zheng, Zhilong
    Zhu, Shuyong
    Wu, Chenghui
    [J]. IEEE-ACM TRANSACTIONS ON NETWORKING, 2017, 25 (06) : 3294 - 3308
  • [10] On Scalability of Software-Defined Networking
    Yeganeh, Soheil Hassas
    Tootoonchian, Amin
    Ganjali, Yashar
    [J]. IEEE COMMUNICATIONS MAGAZINE, 2013, 51 (02) : 136 - 141