IPOM: Interactive proxy management in future communication networks using OpenFlow

Jarschel, Michael; Schlosser, Daniel; Duelli, Michael; Pries, Rastin

doi:10.1109/ngi.2011.5985876

Cited by 2 publications

(6 citation statements)

References 2 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Jarschel et al [23] provide the first reported analytical modelling of SDN using a queueing network model. Without taking into account any particular SDN application, the study focuses on describing the relationship between the SDN switch and the controller.…”

Section: Related Workmentioning

confidence: 99%

A Modified Algorithm for Modelling SDN Data traffic

Abdelghany,

Zaki,

Ashour

2023

Preprint

View full text Add to dashboard Cite

Software Defined Networking (SDN) can allegedly maintain the quality of service (QoS) standards even in the presence of hostile flow, according to recent claims. Queueing theory, and more specifically network models, have been used for a very long time to examine the performance and QoS characteristics of networks in order to investigate this phenomenon. Because of the dependencies between the layers, planes, and components in an SDN architecture, the latter model seems especially well suited to represent the behavior of SDN. Numerous papers have described network models to examine the behavior of various network design applications. Here, we demonstrate how to employ the Markov-modulated Poisson process (MMPP) model to mathematically depict SDN traffic. Many articles had recommended utilizing MMPP to assess and model different types of IP network traffic, and it was widely used to simulate the traffic on traditional IP networks. We assert that MMPP can represent SDN traffic just as if it would in traditional IP networks. Our tests in this study indicate that MMPP is a useful technique for studying SDN data traffic. Starting with the premise that SDN traffic is averaged across multiple experiments and using two different SDN network topologies, we proceed. Emulation tests revealed that MMPP is a good model for SDN data traffic.

show abstract

Section: Related Workmentioning

confidence: 99%

A Modified Algorithm for Modelling SDN Data traffic

Abdelghany,

Zaki,

Ashour

2023

Preprint

View full text Add to dashboard Cite

show abstract

“…Several works 30,33–36 tackle the performance of OpenFlow switches. Jarschel et al 30 were the first to derive a basic model for the forwarding speed and blocking probability of an OpenFlow switch combined with an OpenFlow controller, where the OpenFlow controller was modeled by an M/M/1‐S feedback queuing system. Although the model proposed in Jarschel et al 30 provides valuable insight, it is accurate only when the probability of expecting a new flow is small.…”

Section: Introductionmentioning

confidence: 99%

“…Jarschel et al 30 were the first to derive a basic model for the forwarding speed and blocking probability of an OpenFlow switch combined with an OpenFlow controller, where the OpenFlow controller was modeled by an M/M/1‐S feedback queuing system. Although the model proposed in Jarschel et al 30 provides valuable insight, it is accurate only when the probability of expecting a new flow is small. Furthermore, extending the model to more than one forwarding element in the data plane is complex.…”

Section: Introductionmentioning

confidence: 99%

“…Jarschel et al 34 also reports on the performance analysis of an OpenFlow‐based SDN. Compared to Jarschel et al 30 that examined the network performance in a single‐controller setup, Jarschel et al 34 consider a multi‐node setting. Hence, the proposed model of Jarschel et al 34 claimed to be suitable for analyzing network performance under more realistic topologies.…”

Section: Introductionmentioning

confidence: 99%

“…Research in Jarschel et al 30,33,34 has mainly focused on exploring the capacity of logically centralized controllers in the control plane while falling short of quantitatively investigating the performance of the underlying data plane. Miao et al 35 attempted to fill this gap and presented a preemption‐based packet‐scheduling scheme to improve global fairness and reduce the packet loss rate in the data plane.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

P4toNFV: Offloading from P4 switches to NFV in programmable data planes

Pekar,

Makara,

Lai

et al. 2023

Int J Communication

View full text Add to dashboard Cite

SummaryP4 combines the benefits of hardware‐based networking with the adaptability of software‐based network operations. However, when faced with intricate network functions, P4 switches reveal constraints in memory and processing primitives. To address these, we advocate offloading traffic demanding intricate processing from the programmable data plane to network function virtualization (NFV). By leveraging this approach, P4 switches handle the core data plane, ensuring maximum performance, whereas virtualized network functions (VNF) cater to the intricate processing. Central to our research is the optimization of this offloading process, specifically considering delay constraints. We developed an analytical model that examines a P4 switch overseen by an SDN controller, integrating an offloading capability to NFV. The principal objective was to determine an offloading rate that minimizes packet processing delay. To this end, we employed a Bounded method, an advancement from Brent's method, to determine this optimal rate. The findings indicate that offloading approximately 66% of packets to the VNF achieves the lowest total delay, registering at 0.1505 s. This strategy of optimal offloading can notably reduce the system's average delay as the demand for network functions increases. The optimization technique we adopted exhibited rapid convergence in our experiments, reflecting the method's efficacy. Furthermore, a rigorous parametric sensitivity analysis spanning no offloading, full offloading, and optimal offloading strategies underscores that optimal offloading to NFV consistently augments system performance, particularly in terms of delay reduction. Conclusively, our study furnishes valuable insights into offloading strategies, augmenting the narrative on resource allocation in both PNFs and VNFs.

show abstract

IPOM: Interactive proxy management in future communication networks using OpenFlow

Cited by 2 publications

References 2 publications

A Modified Algorithm for Modelling SDN Data traffic

A Modified Algorithm for Modelling SDN Data traffic

P4toNFV: Offloading from P4 switches to NFV in programmable data planes

Contact Info

Product

Resources

About