%0 Conference Proceedings
%T SDN-Based Source Routing for Scalable Service Chaining in Datacenters
%+ Leibniz Universität Hannover=Leibniz University Hannover
%A Abujoda, Ahmed
%A Kouchaksaraei, Hadi, Razzaghi
%A Papadimitriou, Panagiotis
%Z Part 2: Middleboxes and Addressing
%< avec comité de lecture
%( Lecture Notes in Computer Science
%B 14th International Conference on Wired/Wireless Internet Communication (WWIC)
%C Thessaloniki, Greece
%Y Lefteris Mamatas
%Y Panagiotis Papadimitriou
%Y Ibrahim Matta
%Y Yevgeni Koucheryavy
%3 Wired/Wireless Internet Communications
%V LNCS-9674
%P 66-77
%8 2016-05-25
%D 2016
%R 10.1007/978-3-319-33936-8_6
%Z Computer Science [cs]
%Z Computer Science [cs]/Networking and Internet Architecture [cs.NI]Conference papers
%X The migration of network functions (NFs) to datacenters, as promoted by Network Function Virtualization (NFV), raises the need for service chaining (i.e., steering traffic through a sequence of NFs). Service chaining is typically performed by installing forwarding entries in switches within datacenters (DCs). However, as the number of service chains in DCs grows, switches will be required to maintain a large amount of forwarding state. This will raise a dataplane scalability issue, due to the relatively small flow table size of switches. To mitigate this problem, we present a software-defined network (SDN) based source routing architecture for scalable service chaining, at which the NF-path is encoded into the packet header obviating the need for any forwarding state and lookup in the switches. We assess the feasibility and efficiency of our architecture using a prototype implementation.
%G English
%Z TC 6
%Z WG 6.2
%2 https://inria.hal.science/hal-01434868/document
%2 https://inria.hal.science/hal-01434868/file/417220_1_En_6_Chapter.pdf
%L hal-01434868
%U https://inria.hal.science/hal-01434868
%~ IFIP-LNCS
%~ IFIP
%~ IFIP-TC
%~ IFIP-TC6
%~ IFIP-LNCS-9674
%~ IFIP-WG6-2
%~ IFIP-WWIC