att_abstract={{Service Function Chains (SFCs) comprise a sequence of Network
Functions (NFs) that are typically traversed in-order
by data flows. Consequently, SFC delay grows linearly with
the length of the SFC. Yet, for highly latency sensitive applications,
this delay may be unacceptable—particularly when
the constituent NFs are virtualized, running on commodity
servers. In this paper, we investigate how SFC latency
may be reduced by instead exploiting opportunities for parallel
packet processing across NFs. We propose ParaBox, a
novel hybrid packet processing architecture that, when possible,
dynamically distributes packets to VNFs in parallel
and merges their output intelligently to ensure the preservation
of sequential processing semantics. To demonstrate
our approach’s feasibly, we implement a ParaBox prototype
on top of the DPDK-enabled Berkeley Extensible Software
Switch. Our preliminary experiment results show that ParaBox
can not only significantly reduce the service chaining latency,
but also improve throughput.}},
	att_authors={bh1729, ba601q, vg7777, jr444y, as1818},
	att_copyright_notice={{(c) ACM, 2017. This is the author's version of the work. It is posted here by permission of ACM for your personal use. Not for redistribution. The definitive version was published in ACM SOSR 2017 {{, 2017-04-03}}.
	author={Bo Han and Yang Zhang and Muhammad Anwer and Vijay Gopalakrishnan and Joshua Reich and Aman Shaikh and Zhi-Li Zhang},
	institution={{ACM SOSR 2017}},
	title={{ParaBox: Exploiting Parallelism for Virtual Network Functions in Service Chaining}},