Kobayashi, H.Ishigaki, GenyaGour, RitiJue, Jason P.Shinomiya, N.2019-06-282019-06-282018-03-059781538636527 (ISBN)https://hdl.handle.net/10735.1/6669Full text access from Treasures at UT Dallas is restricted to current UTD affiliates (use the provided link to the article). Non UTD affiliates will find the web address for this item by clicking the Show full item record link and copying the "relation.uri" metadata.This paper discusses the problem of embedding service function chains (SFCs) in an interconnected network with multiple datacenter sites. The problem is formulated as a Subtopology Composition Problem (SCP), which is to design a subnetwork that includes terminal nodes and datacenter nodes from the substrate network, aimed at optimizing distance-based latency in SFCs. The intractability of the problem is discussed, and a heuristic is proposed for the problem. Simulations are conducted to demonstrate the effectiveness of the proposed method in different graph models. © 2018 IEEE.©2018 IEEEComputer networks--Data processingTransfer functionsComposite applications (Computer science)Gateways (Computer networks)Kobayashi, H., G. Ishigaki, R. Gour, J. P. Jue, et al. 2018. "Embedding Chains of Virtual Network Functions in Inter-Datacenter Networks." International Conference on Computing, Networking and Communications, ICNC 2018: 724-728, doi:10.1109/ICCNC.2018.8390413