An Improved Method to Deploy Cache Servers in Software Defined Network-based Information Centric Networking for Big Data

Badshah, Jan; Kamran, Muhammad; Shah, Nadir; Abid, Shahbaz Akhtar

doi:10.1007/s10723-019-09477-z

Cited by 14 publications

(16 citation statements)

References 45 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The existing plans communicate with each other using related application programmable interfaces (APIs) with some existing roles . A brief explanation about the specified layers is presented as follows: In the application plan layer, some business applications and the network explicit have interaction together using a specified abstract view of the APIs. The consumer applications as the business applications need to receive required services from the SDN controller .…”

Section: Motivation and Related Workmentioning

confidence: 99%

A systematic literature review on formal verification of software‐defined networks

Souri

Norouzi

Asghari

et al. 2019

Trans Emerging Tel Tech

View full text Add to dashboard Cite

By raising evolutionary network connections, a software‐defined network (SDN) offers a well‐managed and flexible novel network topology. The SDN efforts are provided to abstract the original network configuration for business applications and web services. Additionally, the SDN modifies the network management policies such as topology policies, deployment policies, the applicability, and infrastructure maintenance. One of the important features of the SDN is standardizing the network interfaces with the precise functional semantics in application and control flow layers. In another hand, specification and evaluation of the existing network interfaces is a main and significant challenge to prove the correctness of the configurable scenarios in the SDN approach. Recently, formal verification presents a high potential platform to evaluate the main‐layer scenarios of the SDN as the novel perspective in this area. Up to now, there is no survey and state‐of‐the‐art review on the formal verification methods in the SDN. This paper provides a systematic literature review (SLR) for the formal verification methods in the SDN in form of the SDN plans to recognize the state of the art of the open challenges. The presented SLR is classified into three main fields: application plan, data plan, and control plan approaches. The verification mechanisms are compared with each other according to the important factors such as structural properties, quality‐of‐service metrics, applied algorithms, and measurement tools.

show abstract

Section: Motivation and Related Workmentioning

confidence: 99%

A systematic literature review on formal verification of software‐defined networks

Souri

Norouzi

Asghari

et al. 2019

Trans Emerging Tel Tech

View full text Add to dashboard Cite

show abstract

“…After computing the important switches, this paper proposes to place the cache servers on the most important switches according to the number of required cache servers. Through simulation on the real network traces, the results show that this approach reduces not only the computation time, but also performs better than the existing approach [28] in terms of traffic overhead in the network.…”

Section: Introductionmentioning

confidence: 97%

“…This phenomenon offloads the controller from these flows. Furthermore, the authoritative servers are attached to the switches; thus, DIFANE uses an in-band communication model [28]. ii For a Server and Network Assisted DASH (SAND) architecture used for the video streaming applications, the authors in [29] combine both SDN and NFV (Network Functions Virtualization) technologies by creating virtualized caches using NFV hosted by the servers connected to the switches.…”

Section: Introductionmentioning

confidence: 99%

“…However, it produces more traffic overhead. To reduce the traffic overhead, Badshah et al [28] suggest deploying the cache servers by considering higher closeness centrality, minimum path-stretch values, and higher betweenness centrality of the network. However, when the number cache servers get increased, the time taken to compute the location of cache servers using the values of closeness centrality, path-stretch, and betweenness centrality is very computationally extensive due to the NP (non-polynomial) nature of the problem.…”

Section: Introductionmentioning

confidence: 99%

“…However, when the number cache servers get increased, the time taken to compute the location of cache servers using the values of closeness centrality, path-stretch, and betweenness centrality is very computationally extensive due to the NP (non-polynomial) nature of the problem. We observe that the computation time of this approach, i.e., the existing one in [28], for two cache servers and three cache serves are about 9 h and 1 month, respectively, in the topology of 415 switches using the real network traces (https://github.com/fg-inet/panoptisim Accessed on 4 July 2019) on the desktop computer of Intel CPU i3 which runs Fedora Linux 23 . We solve this problem by using the concept of important switches as follows.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Cache Servers Placement Based on Important Switches for SDN-Based ICN

et al. 2019

Self Cite

View full text Add to dashboard Cite

In centralized cache management for SDN-based ICN, it is an optimization problem to compute the location of cache servers and takes a longer time. We solve this problem by proposing to use singular-value-decomposition (SVD) and QR-factorization with column pivoting methods of linear algebra as follows. The traffic matrix of the network is lower-rank. Therefore, we compute the most important switches in the network by using SVD and QR-factorization with column pivoting methods. By using real network traces, the results show that our proposed approach reduces the computation time significantly, and also decreases the traffic overhead and energy consumption as compared to the existing approach.

show abstract