Compact policy routing

Rétvári, Gábor; Gulyás, András; Heszberger, Zalán; Csernai, Márton; Bı́ró, József

doi:10.1145/1993806.1993828

Cited by 5 publications

(1 citation statement)

References 30 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The article contributes to designing a policy-based routing approach in hybrid SDN architecture that systematically uses the free IP addresses available in the destination subnet. Here, the proposed policy-based routing [42], [47] defined the optimal policy path that a packet follows during its journey. The incremental deployment starts with replacing edge devices in the service provider network.…”

Section: Introductionmentioning

confidence: 99%

Effective Flow Table Space Management Using Policy-Based Routing Approach in Hybrid SDN Network

Paliwal

Nagwanshi

2022

IEEE Access

View full text Add to dashboard Cite

Software-defined networking makes forwarding devices easier to manage and provides centralized control. Because of the centralization, a network administrator can programme the devices cheaply. Network administrators make attempts to convert their entire network into SDN-compatible switches. A good balance of SDN and legacy switching functions can lead to a successful network scenario in network architecture. In this study, a hybrid network scenario is provided in which the external boundary forwarding devices of the service provider network are replaced with SDN devices. Still, the other internal forwarding devices continue to operate traditionally. The benefits of both SDN and legacy network design are combined, allowing the network administrator to reap the benefits of both. The network architecture employs a policy-based routing algorithm that takes advantage of free IP addresses from the free IP pool. The technique enables efficient use of available flow table space, which is critical in SDN architecture due to the small flow table size. The algorithm's efficiency is assessed using performance metrics such as network path stretch, throughput, latency delay, and so on, compared to traditional SDN controllers such as OpenDayLight, NOX, and POX. According to the experimental results, the suggested approach outperforms specific similar state-of-the-art techniques in the hybrid SDN domain.

show abstract

Section: Introductionmentioning

confidence: 99%

Effective Flow Table Space Management Using Policy-Based Routing Approach in Hybrid SDN Network

Paliwal

Nagwanshi

2022

IEEE Access

View full text Add to dashboard Cite

show abstract

On the Computational Complexity of Policy Routing

Zubor

Kő̈rösi

Gulyás

et al. 2014

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

Abstract. With the advent of new network architectures, like Software Defined Networks, the rules governing the way traffic is routed through the network are becoming increasingly complex. In this paper, we revisit the theoretic underpinnings of policy routing in the light of the new requirements. We show that certain simple but plausible algebraic properties already induce intractable path selection instances, and we extend the algebraic description of policies for which the related path selection problem is guaranteed to be tractable with a new class, called polynomial finite algebras, which captures many real-life application domains.

show abstract

Notes on the Topological Consequences of BGP Policy Routing on the Internet AS Topology

Szabó

Gulyás

2013

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

Abstract. On the Internet AS level topology, BGP policy routing is in charge of dictating the characteristics of routes which can be used for packet transmission. Furthermore the peculiarities of the BGP policies clearly affect the peering strategies of the ISP-s, hereby influencing the emerging topology. This paper takes a first step towards identifying the topological footprint issued by these policies. For this purpose we modify the framework of network formation games to support the most fundamental BGP policy called valley-free routing. We show the topological properties of the equilibrium topologies of this game in an analytical manner.

show abstract

Compact policy routing

Cited by 5 publications

References 30 publications

Effective Flow Table Space Management Using Policy-Based Routing Approach in Hybrid SDN Network

Effective Flow Table Space Management Using Policy-Based Routing Approach in Hybrid SDN Network

On the Computational Complexity of Policy Routing

Notes on the Topological Consequences of BGP Policy Routing on the Internet AS Topology

Contact Info

Product

Resources

About