Abstract
Issue of service function chaining in a network is the focus of this paper. Currently, middle box placement in a network and packet steering through middle boxes are the two main problems associated with chaining services in a network—also known as service function chaining. We propose a One Pass Packet Steering (OPPS) method for use in multi-subscriber environments with the goal of reducing the total amount of time it takes for Users and Services to connect. We show a proof of idea execution utilizing imitations performed with Mininet. According to our findings, the end-to-end delay of subscribers utilizing different sets of policy chains with the same middle boxes and a fixed topology remains roughly the same. Software-Defined Networking, or SDN for short, is a new way of networking that gives a controller and its applications the all-powerful ability to see the whole network and program it in any way they want. This makes it possible for new innovations in network protocols and applications. SDN's logically centralized control plane, which gives visibility to the entire network and is used by many SDN applications, is one of its main benefits. We propose new SDN-specific attack vectors that seriously challenge this foundation, a first in the literature. While the spirit of our new attacks is somewhat similar to that of spoofing attacks in legacy networks, such as the ARP poisoning attack, there are significant differences in how unique vulnerabilities are exploited and how current SDN differs from legacy networks.
Reference43 articles.
1. 1. Y. Yiakoumis et al., “Putting home users in charge of their network,” in Proc. ACM UbiComp, Sep. 2012, pp. 1114–1119.
2. 2. Y. Yiakoumis, K. Yap, S. Katti, G. Parulkar, and N. McKeown, “Slicing home networks,” in Proc. SIGCOMM HomeNets Workshop, Aug. 2011, pp. 1–6.
3. 3. J. Matias, E. Jacob, N. Katti, and J. Astorga, “Towards neutrality in access networks: A NANDO deployment with OpenFlow,” in Proc. Int. Conf. Access Netw., Jun. 2011, pp. 7–12.
4. 4. A.Kumar et al., “BwE: Flexible, hierarchical bandwidth allocation for WAN distributed computing,” in Proc. ACM SIGCOMM, Aug. 2015, pp. 1–14.
5. 5. C.Joe-Wong, S. Ha, and M. Chiang, “Time-dependent broadband pricing: Feasibility and benefits,” in Proc. IEEE ICDCS, Jun. 2011, pp. 288–298.