<?xml version="1.0" encoding="UTF-8"?>
<?xml-stylesheet type="text/xsl" href="mansdnnfv2017-program"?>
<program>
  <session>
    <code>K1</code>
    <sessiontitle>Keynote</sessiontitle>
    <sessionsubtitle>Global Industry Status on Cloud Orchestration Evolution and Challenges</sessionsubtitle>
    <sessionspeaker>Dharma Rajan (Solutions Architect Leader,VMware)</sessionspeaker>
    <sessiondetails>The evolution of software-defined networking (SDN) and network functions virtualization (NFV) from different sources has led the way to the programmable networks of the future. Globally, NFV deployments using multi-vendor virtual network functions to carry the live mobile traffic of millions of subscribers have been deployed in production and are growing exponentially. The future evolution of SDN/NFV, and the challenges that exist across a multitude of new use cases, such as 5G, micro data centers, mobile edge computing, IOT, and others, are of immense interest architecturally and from an operational management point of view. This keynote will address how orchestration and automation are playing key roles in production deployments today and in the evolution of telco, IT, and converged OneCloud architectures. It will cover how one-touch service creation and zero-touch orchestration are evolving. A perspective on the direction the industry is heading and areas of research that academia can help solve in this fast-moving wave of network transformation will be a highlight.</sessiondetails>
    <date>26 November 2017</date>
    <range>10:00-11:00</range>
    <starttime>2017-11-26T10:00:00+09:00</starttime>
    <endtime>2017-11-26T11:00:00+09:00</endtime>
    <room>Ono Memorial Hall, B2F, Bldg.27</room>
    <chair>Noriaki Kamiyama (Fukuoka University, Japan)</chair>
    <papers/>
  </session>
  <session>
    <code>PS1</code>
    <sessiontitle>Poster Session and Coffee Break 1</sessiontitle>
    <sessionsubtitle>Wireless Networks</sessionsubtitle>
    <sessionspeaker/>
    <sessiondetails/>
    <date>26 November 2017</date>
    <range>11:00-11:30</range>
    <starttime>2017-11-26T11:00:00+09:00</starttime>
    <endtime>2017-11-26T11:30:00+09:00</endtime>
    <room>Lobby, B1F, Bldg.27</room>
    <chairs>
    </chairs>
    <papers>
      <paper>
        <starttime>11:00</starttime>
        <endtime>11:06</endtime>
        <paperid>1570382622</paperid>
        <sessionid>PS1.1</sessionid>
        <papertitle>Auto Scaling of Data Plane VNFs in 5G Networks</papertitle>
        <trackname>Short papers</trackname>
        <abstract>In order to meet the traffic demand from diverse&#13;
next generation wireless network applications and exponentially&#13;
increasing mobile subscriptions, various 5G network architectures are proposed by leveraging Software Defined Networking&#13;
(SDN) and Network Function Virtualization (NFV) technologies.&#13;
Network slicing will be one of the 5G technologies that would&#13;
support next-generation wireless applications over a shared network infrastructure. However, improper network slicing may lead&#13;
to either over-provisioning or under-utilization of the underlying&#13;
network infrastructure resources, especially the 5G core network.&#13;
Over-provisioning of data plane components such as Serving&#13;
Gateway (SGW) and Packet Data Network Gateway (PGW) can&#13;
lead to higher CAPEX and OPEX to mobile operators. In this&#13;
paper, we propose a novel auto-scaling approach called Bitrate&#13;
Aware Auto Scaling (BAAS) that maintains a precise UE bit rate requirement in the network slices without over-provisioning of&#13;
data plane resources.</abstract>
        <authors>
          <author>
            <name>
              <givenname>Tulja Vamshi Kiran</givenname>
              <mi/>
              <surname>Buyakar</surname>
            </name>
            <id>1514367</id>
            <affiliation>Indian Institute of Technology Hyderabad</affiliation>
            <country>India</country>
            <presenter>0</presenter>
          </author>
          <author>
            <name>
              <givenname>Anil kumar</givenname>
              <mi/>
              <surname>Rangisetti</surname>
            </name>
            <id>1040755</id>
            <affiliation>IIT HYDERABAD</affiliation>
            <country>India</country>
            <presenter>0</presenter>
          </author>
          <author>
            <name>
              <givenname>Antony Franklin</givenname>
              <mi/>
              <surname>A</surname>
            </name>
            <id>193893</id>
            <affiliation>Indian Institute of Technology Hyderabad</affiliation>
            <country>India</country>
            <presenter>0</presenter>
          </author>
          <author>
            <name>
              <givenname>Bheemarjuna Reddy</givenname>
              <mi/>
              <surname>Tamma</surname>
            </name>
            <id>108871</id>
            <affiliation>IIT Hyderabad</affiliation>
            <country>India</country>
            <presenter>0</presenter>
          </author>
        </authors>
      </paper>
      <paper>
        <starttime>11:06</starttime>
        <endtime>11:12</endtime>
        <paperid>1570392702</paperid>
        <sessionid>PS1.2</sessionid>
        <papertitle>Resource Allocation for Network Slicing in WiFi Access Points</papertitle>
        <trackname>Short papers</trackname>
        <abstract>Network slicing has recently appeared as one of the most important features that will be provided by 5G networks and is attracting considerable interest from industry and academia. At the wireless edge of these networks, most of the contributions in this area are related to cellular technologies leaving behind WiFi networks. In this work, we present a resource allocation mechanism based on airtime assignment to achieve infrastructure sharing and slicing in WiFi Access Points. The approach is simple and has the potential to be straightforwardly used within scenarios of wireless access infrastructure sharing.</abstract>
        <authors>
          <author>
            <name>
              <givenname>Matias</givenname>
              <mi/>
              <surname>Richart</surname>
            </name>
            <id>912457</id>
            <affiliation>Universidad de la Republica</affiliation>
            <country>Uruguay</country>
            <presenter>1</presenter>
          </author>
          <author>
            <name>
              <givenname>Javier</givenname>
              <mi/>
              <surname>Baliosian</surname>
            </name>
            <id>205255</id>
            <affiliation>University of the Republic</affiliation>
            <country>Uruguay</country>
            <presenter>0</presenter>
          </author>
          <author>
            <name>
              <givenname>Joan</givenname>
              <mi/>
              <surname>Serrat</surname>
            </name>
            <id>14987</id>
            <affiliation>Universitat Politecnica de Catalunya</affiliation>
            <country>Spain</country>
            <presenter>0</presenter>
          </author>
          <author>
            <name>
              <givenname>Juan-Luis</givenname>
              <mi/>
              <surname>Gorricho</surname>
            </name>
            <id>630581</id>
            <affiliation>Polytechnic University of Catalonia</affiliation>
            <country>Spain</country>
            <presenter>0</presenter>
          </author>
          <author>
            <name>
              <givenname>Ramon</givenname>
              <mi/>
              <surname>Aguero</surname>
            </name>
            <id>98062</id>
            <affiliation>University of Cantabria</affiliation>
            <country>Spain</country>
            <presenter>0</presenter>
          </author>
          <author>
            <name>
              <givenname>Nazim</givenname>
              <mi/>
              <surname>Agoulmine</surname>
            </name>
            <id>1200593</id>
            <affiliation>University of Evry Val d'Essonne</affiliation>
            <country>USA</country>
            <presenter>0</presenter>
          </author>
        </authors>
      </paper>
      <paper>
        <starttime>11:12</starttime>
        <endtime>11:18</endtime>
        <paperid>1570395405</paperid>
        <sessionid>PS1.3</sessionid>
        <papertitle>Design of SDN based End-to-end Routing over Multiple Domains for Mobility Management</papertitle>
        <trackname>Short papers</trackname>
        <abstract>IoT environment has spread and the use of Internet services during move has increased recently.The demand for mobility management, the technology to keep communication even when a communicating mobile node moves, is growing due to it. We proposed a SDN based mobility management scheme in our prior work to deal with inter-domain handovers, but its routing algorithm only considers the number of domains to go through and the number of flow entries to install. This prevents us from selecting suitable routes. In this paper, we show the design of a new routing mechanism that considers various parameters. This mechanism suppresses costs for changing route to carry out handover smoothly and avoids lengthy routes.</abstract>
        <authors>
          <author>
            <name>
              <givenname>Misumi</givenname>
              <mi/>
              <surname>Hata</surname>
            </name>
            <id>1525240</id>
            <affiliation>Tohoku University</affiliation>
            <country>Japan</country>
            <presenter>1</presenter>
          </author>
          <author>
            <name>
              <givenname>Mustafa</givenname>
              <mi/>
              <surname>Soylu</surname>
            </name>
            <id>1525452</id>
            <affiliation>Istanbul Technical University</affiliation>
            <country>Turkey</country>
            <presenter>0</presenter>
          </author>
          <author>
            <name>
              <givenname>Satoru</givenname>
              <mi/>
              <surname>Izumi</surname>
            </name>
            <id>254919</id>
            <affiliation>Tohoku University</affiliation>
            <country>Japan</country>
            <presenter>0</presenter>
          </author>
          <author>
            <name>
              <givenname>Toru</givenname>
              <mi/>
              <surname>Abe</surname>
            </name>
            <id>1456930</id>
            <affiliation>Tohoku University</affiliation>
            <country>Japan</country>
            <presenter>0</presenter>
          </author>
          <author>
            <name>
              <givenname>Takuo</givenname>
              <mi/>
              <surname>Suganuma</surname>
            </name>
            <id>1525434</id>
            <affiliation>Tohoku University</affiliation>
            <country>Japan</country>
            <presenter>0</presenter>
          </author>
        </authors>
      </paper>
      <paper>
        <starttime>11:18</starttime>
        <endtime>11:24</endtime>
        <paperid>1570378781</paperid>
        <sessionid>PS1.4</sessionid>
        <papertitle>SDN Enhancements for the Sliced, Deep Programmable 5G Core</papertitle>
        <trackname>Short papers</trackname>
        <abstract>Standardisation, research and development efforts for the fifth generation (5G) of mobile telecommunication networks are well under way. Software Defined Networking (SDN) and Network Function Virtualisation (NFV) are two of the key enabling technologies, considered in these efforts. The need for a flexible, high performant and efficient architecture is well established. Network slicing, which combines SDN and NFV, can contribute to such an architecture. It allows the parallel deployment of differing network stacks on top of any physical infrastructure. SDN's separation of control and data plane components allows for flexible deployments. How can SDN's flexibility be leveraged in a sliced, 5G network infrastructure? There needs to be an efficient way to integrate SDN into 5G networks. In this paper, we posit a way of integration,which allows decoupling the data plane components from any particular control plane. This can improve flexibility, utilisation and extensibility. We envision utilising an SDN switch implementation as the User Plane Function (UPF), and introducing an SDN controller between Session Management Function (SMF) and UPF, to effectively decouple the two. Based on this decoupling, control and data plane components can be deployed in separately and new slice orchestration opportunities can be developed. Furthermore, we can leverage deep data plane programmability, to enhance the system in terms of function and flexibility.</abstract>
        <authors>
          <author>
            <name>
              <givenname>Fabian</givenname>
              <mi/>
              <surname>Eichhorn</surname>
            </name>
            <id>1503018</id>
            <affiliation>Fraunhofer FOKUS &amp; Technische Universitaet Berlin</affiliation>
            <country>Germany</country>
            <presenter>1</presenter>
          </author>
          <author>
            <name>
              <givenname>Marius</givenname>
              <mi/>
              <surname>Corici</surname>
            </name>
            <id>196381</id>
            <affiliation>Fraunhofer FOKUS</affiliation>
            <country>Germany</country>
            <presenter>0</presenter>
          </author>
          <author>
            <name>
              <givenname>Thomas</givenname>
              <mi/>
              <surname>Magedanz</surname>
            </name>
            <id>3771</id>
            <affiliation>Fraunhofer Institute FOKUS / TU Berlin</affiliation>
            <country>Germany</country>
            <presenter>0</presenter>
          </author>
          <author>
            <name>
              <givenname>Ping</givenname>
              <mi/>
              <surname>Du</surname>
            </name>
            <id>121398</id>
            <affiliation>The University of Tokyo</affiliation>
            <country>Japan</country>
            <presenter>0</presenter>
          </author>
          <author>
            <name>
              <givenname>Yoshiaki</givenname>
              <mi/>
              <surname>Kiriha</surname>
            </name>
            <id>343795</id>
            <affiliation>The University of Tokyo</affiliation>
            <country>Japan</country>
            <presenter>0</presenter>
          </author>
          <author>
            <name>
              <givenname>Akihiro</givenname>
              <mi/>
              <surname>Nakao</surname>
            </name>
            <id>155461</id>
            <affiliation>University of Tokyo</affiliation>
            <country>Japan</country>
            <presenter>0</presenter>
          </author>
        </authors>
      </paper>
      <paper>
        <starttime>11:24</starttime>
        <endtime>11:30</endtime>
        <paperid>1570375046</paperid>
        <sessionid>PS1.5</sessionid>
        <papertitle>Agent composition for 5G management and orchestration</papertitle>
        <trackname>Short papers</trackname>
        <abstract>Virtualized execution environments in 5G network create a linkage between network management and orchestration. Execution of 3GPP functionalities and management applications in the cloud also presents an opportunity to innovate outside of traditional thinking. We describe a framework focusing on a virtual execution environment and utilizing agent composition to serve as a platform for realizations with particular goals ? for example ? in terms of coordination. The framework allows for focusing on the opportunities provided with cloud environment and microservices-based agent composition, and describing relevant aspects of orchestration while avoiding aspects of orchestration which would bring unnecessary complexity to the analysis.</abstract>
        <authors>
          <author>
            <name>
              <givenname>Vilho</givenname>
              <mi/>
              <surname>Raisanen</surname>
            </name>
            <id>1484424</id>
            <affiliation>Nokia Bell Labs</affiliation>
            <country>Finland</country>
            <presenter>1</presenter>
          </author>
        </authors>
      </paper>
    </papers>
  </session>
  <session>
    <code>TS1</code>
    <sessiontitle>Technical Session 1</sessiontitle>
    <sessionsubtitle>Implementation</sessionsubtitle>
    <sessionspeaker/>
    <sessiondetails/>
    <date>26 November 2017</date>
    <range>11:30-13:00</range>
    <starttime>2017-11-26T11:30:00+09:00</starttime>
    <endtime>2017-11-26T13:00:00+09:00</endtime>
    <room>Ono Memorial Hall, B2F, Bldg.27</room>
    <chair>Hiroaki Harai (NICT, Japan)</chair>
    <papers>
      <paper>
        <starttime>11:30</starttime>
        <endtime>12:10</endtime>
        <paperid>1570408971</paperid>
        <sessionid>TS1.1</sessionid>
        <papertitle>[Invited talk] Progress toward Network Softwarization</papertitle>
        <trackname>Invited papers</trackname>
        <abstract>Progress toward Network Softwarization</abstract>
        <authors>
          <author>
            <name>
              <givenname>Katsuhiro</givenname>
              <mi/>
              <surname>Shimano</surname>
            </name>
            <id>101392</id>
            <affiliation>NTT</affiliation>
            <country>Japan</country>
            <presenter>0</presenter>
          </author>
        </authors>
      </paper>
      <paper>
        <starttime>12:10</starttime>
        <endtime>12:33</endtime>
        <paperid>1570393061</paperid>
        <sessionid>TS1.2</sessionid>
        <papertitle>Architecture for Building Hybrid Kernel-User Space Virtual Network Functions</papertitle>
        <trackname>Regular papers</trackname>
        <abstract>Network Function Virtualization (NFV) is one of the important aspects of modern network architecture. NFV decouples Network Functions (NFs) from hardware, therefore produces Virtual Network Functions (VNFs) that can run on standard, commodity servers, which in turn mostly run Linux kernel. In this paper, we propose a general architecture for building hybrid kernel-user space VNFs which leverages extended Berkeley Packet Filter (eBPF). eBPF is a framework in Linux kernel that enables network programmability inside kernel for optimal performance. However, the programmability of eBPF is limited due to safety and security of the kernel. Our proposed architecture applies hybrid approach: leave the simple work inside the kernel with eBPF and let complex work be processed in the user space. This architecture allows building complex VNFs to have both speed and flexibility. To demonstrate, we use the proposed architecture to build two VNFs: Dynamic Load Balancer and Deep Packet Inspection with Dynamic Sniffing. The evaluation results show that both VNFs significantly outperform the widely used solutions.</abstract>
        <authors>
          <author>
            <name>
              <givenname>Tu</givenname>
              <mi>Van</mi>
              <surname>Nguyen</surname>
            </name>
            <id>1335095</id>
            <affiliation>POSTECH</affiliation>
            <country>Korea</country>
            <presenter>1</presenter>
          </author>
          <author>
            <name>
              <givenname>KyungChan</givenname>
              <mi/>
              <surname>Ko</surname>
            </name>
            <id>1523139</id>
            <affiliation>POSTECH</affiliation>
            <country>Korea</country>
            <presenter>0</presenter>
          </author>
          <author>
            <name>
              <givenname>James</givenname>
              <mi>W.</mi>
              <surname>Hong</surname>
            </name>
            <id>2797</id>
            <affiliation>POSTECH</affiliation>
            <country>Korea</country>
            <presenter>0</presenter>
          </author>
        </authors>
      </paper>
      <paper>
        <starttime>12:33</starttime>
        <endtime>12:56</endtime>
        <paperid>1570392598</paperid>
        <sessionid>TS1.3</sessionid>
        <papertitle>InFEP - Lightweight Virtualization of Distributed Control on White-box Networking Hardware</papertitle>
        <trackname>Regular papers</trackname>
        <abstract>Recent developments in networking hardware and software-defined networking have enabled full distribution of network control to reduce control latency and increase reliability. However, both, hardware and software of current white-box networking hardware are highly heterogeneous, which limits the deployment and operation of switch-local control applications. Furthermore, switch-local control raises yet unconsidered security concerns. In this paper, we present our concept of in-forward-element processing, which leverages the open access to the control plane of white-box networking hardware to deploy control logic directly onto switches. We combine local control applications with lightweight virtualization to cope with networking hardware heterogeneity and to achieve required isolation properties and ease of management. Beyond distributed network control, we show this scheme is also beneficial for implementing switch-local virtual network functions (NFV), processing packets. Highlighting the practicability of the concepts, we provide an overview of the current white-box networking hardware and software landscape and their compatibility with lightweight virtualization technologies. To this end, we perform an empirical evaluation of NOS-virtualization combinations on such hardware and compare the results with respect to incurring virtualization overhead.</abstract>
        <authors>
          <author>
            <name>
              <givenname>Thomas</givenname>
              <mi/>
              <surname>Kohler</surname>
            </name>
            <id>1273223</id>
            <affiliation>University of Stuttgart</affiliation>
            <country>Germany</country>
            <presenter>1</presenter>
          </author>
          <author>
            <name>
              <givenname>Frank</givenname>
              <mi/>
              <surname>Durr</surname>
            </name>
            <id>109838</id>
            <affiliation>University of Stuttgart</affiliation>
            <country>Germany</country>
            <presenter>0</presenter>
          </author>
          <author>
            <name>
              <givenname>Christian</givenname>
              <mi/>
              <surname>Baumlisberger</surname>
            </name>
            <id>1498256</id>
            <affiliation>University of Stuttgart</affiliation>
            <country>Germany</country>
            <presenter>0</presenter>
          </author>
          <author>
            <name>
              <givenname>Kurt</givenname>
              <mi/>
              <surname>Rothermel</surname>
            </name>
            <id>167907</id>
            <affiliation>University of Stuttgart</affiliation>
            <country>Germany</country>
            <presenter>0</presenter>
          </author>
        </authors>
      </paper>
    </papers>
  </session>
  <session>
    <code>BR1</code>
    <sessiontitle>Lunch</sessiontitle>
    <sessionsubtitle>Lunch</sessionsubtitle>
    <sessionspeaker/>
    <sessiondetails/>
    <date>26 November 2017</date>
    <range>13:00-14:30</range>
    <starttime>2017-11-26T13:00:00+09:00</starttime>
    <endtime>2017-11-26T14:30:00+09:00</endtime>
    <room>Mori-no-Kaze</room>
    <chairs>
      <chair>
        <name>
          <givenname>Noriaki</givenname>
          <mi/>
          <surname>Kamiyama</surname>
        </name>
        <affiliation>Fukuoka University</affiliation>
        <country>Japan</country>
      </chair>
    </chairs>
    <papers/>
  </session>
  <session>
    <code>TS2</code>
    <sessiontitle>Technical Session 2</sessiontitle>
    <sessionsubtitle>Optimization of Controller and NFV</sessionsubtitle>
    <sessionspeaker/>
    <sessiondetails/>
    <date>26 November 2017</date>
    <range>14:30-16:00</range>
    <starttime>2017-11-26T14:30:00+09:00</starttime>
    <endtime>2017-11-26T16:00:00+09:00</endtime>
    <room>Ono Memorial Hall, B2F, Bldg.27</room>
    <chair>Hideki Tode (Osaka Prefecture University, Japan)</chair>
    <papers>
      <paper>
        <starttime>14:30</starttime>
        <endtime>14:52</endtime>
        <paperid>1570392923</paperid>
        <sessionid>TS2.1</sessionid>
        <papertitle>Design of Virtual Gateway in Virtual Software Defined Networks</papertitle>
        <trackname>Regular papers</trackname>
        <abstract>Network virtualization is a technique that abstracts the underlying physical infrastructures into multiple isolated networks. Currently, network virtualization based on Software-Defined Networking (SDN) has attracted interests from industry and academia to utilize limited network resources by using benefits of SDN. SDN has useful features such as programmability, flexibility, and agility. In order to virtualize networks in SDN, a network hypervisor intercepts and modifies OpenFlow messages so that it provisions multiple virtual networks (VNs), virtual software-defined networks (vSDNs) in SDN. However, existing SDN-based network hypervisors do not provide an easy-to-use method to connect a created vSDN with external networks. It limits the usefulness of vSDNs. To resolve this problem, we propose a virtual gateway for external connectivity in vSDN. The proposed virtual gateway is implemented using ONOS virtualization subsystem. The virtual gateway is able to provide external connectivity and other useful network functions such as firewall, traffic shaping, and load-balancing. To demonstrate the feasibility of virtual gateway, we evaluate round trip time and overhead to show a connectivity and overhead of the gateway deployment.</abstract>
        <authors>
          <author>
            <name>
              <givenname>Doyoung</givenname>
              <mi/>
              <surname>Lee</surname>
            </name>
            <id>1521887</id>
            <affiliation>POSTECH</affiliation>
            <country>Korea</country>
            <presenter>0</presenter>
          </author>
          <author>
            <name>
              <givenname>Yoonseon</givenname>
              <mi/>
              <surname>Han</surname>
            </name>
            <id>867903</id>
            <affiliation>POSTECH</affiliation>
            <country>Korea</country>
            <presenter>0</presenter>
          </author>
          <author>
            <name>
              <givenname>James</givenname>
              <mi>W.</mi>
              <surname>Hong</surname>
            </name>
            <id>2797</id>
            <affiliation>POSTECH</affiliation>
            <country>Korea</country>
            <presenter>0</presenter>
          </author>
        </authors>
      </paper>
      <paper>
        <starttime>14:52</starttime>
        <endtime>15:15</endtime>
        <paperid>1570392823</paperid>
        <sessionid>TS2.2</sessionid>
        <papertitle>DiMob: Scalable and Seamless Mobility in SDN Managed Wireless Networks</papertitle>
        <trackname>Regular papers</trackname>
        <abstract>Wi-Fi network roaming is the act of moving a wireless device from one Wi-Fi access point (AP) to another Wi-Fi AP. In urban environments, where APs are densely deployed, users would greatly benefit from roaming between these APs. Standards for Wi-Fi-network roaming have been developed (e.g. IEEE 802.11r), but are rarely implemented. The absence of a widely used standard leads to device-dependent roaming mechanisms, which brings numerous disadvantages. 5G-EmPOWER is an example of a framework that brings the Software-Defined Networking (SDN) paradigm to wireless networks. The framework solves the problem of network roaming by allowing users to connect to their own unique virtual AP and managing their connection to the WAN behind the scenes. This allows the 5G-EmPOWER controller to seamlessly handover users from one physical AP to another. Currently, a single physical controller manages the 5G-EmPOWER control plane. The use of a single system over a distributed system has known disadvantages (e.g. greater cost, single point of failure). In this paper, we present DiMob, which distributes the SDN control plane among multiple controllers. We show that DiMob maintains a seamless handover, while offering the advantages of a distributed system. We demonstrate, for example, that adding an additional node can save approximately 30 % in CPU usage for each controller.</abstract>
        <authors>
          <author>
            <name>
              <givenname>Ian</givenname>
              <mi/>
              <surname>Vermeulen</surname>
            </name>
            <id>1510680</id>
            <affiliation>University of Antwerp - imec</affiliation>
            <country>Belgium</country>
            <presenter>0</presenter>
          </author>
          <author>
            <name>
              <givenname>Patrick</givenname>
              <mi/>
              <surname>Bosch</surname>
            </name>
            <id>1308619</id>
            <affiliation>University of Antwerp - imec</affiliation>
            <country>Belgium</country>
            <presenter>0</presenter>
          </author>
          <author>
            <name>
              <givenname>Tom</givenname>
              <mi/>
              <surname>De Schepper</surname>
            </name>
            <id>1322649</id>
            <affiliation>University of Antwerp - imec</affiliation>
            <country>Belgium</country>
            <presenter>1</presenter>
          </author>
          <author>
            <name>
              <givenname>Steven</givenname>
              <mi/>
              <surname>Latre</surname>
            </name>
            <id>1059359</id>
            <affiliation>University of Antwerp - imec</affiliation>
            <country>Belgium</country>
            <presenter>0</presenter>
          </author>
        </authors>
      </paper>
      <paper>
        <starttime>15:15</starttime>
        <endtime>15:37</endtime>
        <paperid>1570395498</paperid>
        <sessionid>TS2.3</sessionid>
        <papertitle>Performance Evaluation of Selective Flow Monitoring in the ONOS Controller</papertitle>
        <trackname>Regular papers</trackname>
        <abstract>One of the benefits when network operators adopt the Software Defined Networking (SDN) paradigm is the ability to monitor the traffic in the network without an additional network management system. Usually, SDN controllers utilize OpenFlow statistics messages in order to regularly gather information about all flows in the network. However, using the same polling interval for all flows does not take into account the heterogeneity of real world traffic and thus results in an imbalance between monitoring accuracy and control plane overhead. In particular, frequent querying results in a high resource consumption at the controller. This work proposes a Selective Flow Monitoring (SFM) mechanism that allows administrators to classify flows according to their individual requirements in terms of monitoring frequency, e.g., less frequent polling of elephant flows and frequent polling of QoS sensitive VoIP connections.&#13;
&#13;
We compare the performance of the SFM mechanism with the default monitoring scheme in a testbed featuring the Open Network Operating System (ONOS) controller. In this context, the CPU utilization of the controller is used as performance indicator. After identifying relevant influence factors like the number of flows and switches in the network, we investigate the viability of the approaches in different scenarios. Finally, we provide guidelines regarding their choice.</abstract>
        <authors>
          <author>
            <name>
              <givenname>Anh</givenname>
              <mi/>
              <surname>Nguyen-Ngoc</surname>
            </name>
            <id>1331365</id>
            <affiliation>University of Wurzburg</affiliation>
            <country>Germany</country>
            <presenter>0</presenter>
          </author>
          <author>
            <name>
              <givenname>Stanislav</givenname>
              <mi/>
              <surname>Lange</surname>
            </name>
            <id>898435</id>
            <affiliation>University of Wuerzburg</affiliation>
            <country>Germany</country>
            <presenter>0</presenter>
          </author>
          <author>
            <name>
              <givenname>Thomas</givenname>
              <mi/>
              <surname>Zinner</surname>
            </name>
            <id>199867</id>
            <affiliation>University of Wuerzburg</affiliation>
            <country>Germany</country>
            <presenter>0</presenter>
          </author>
          <author>
            <name>
              <givenname>Michael</givenname>
              <mi/>
              <surname>Seufert</surname>
            </name>
            <id>857079</id>
            <affiliation>University of Wurzburg</affiliation>
            <country>Germany</country>
            <presenter>1</presenter>
          </author>
          <author>
            <name>
              <givenname>Phuoc</givenname>
              <mi/>
              <surname>Tran-Gia</surname>
            </name>
            <id>2153</id>
            <affiliation>University of Wuerzburg</affiliation>
            <country>Germany</country>
            <presenter>0</presenter>
          </author>
          <author>
            <name>
              <givenname>Nieke</givenname>
              <mi/>
              <surname>Aerts</surname>
            </name>
            <id>1498904</id>
            <affiliation>Infosim GmbH &amp; Co. KG</affiliation>
            <country>Germany</country>
            <presenter>0</presenter>
          </author>
          <author>
            <name>
              <givenname>David</givenname>
              <mi>R.</mi>
              <surname>Hock</surname>
            </name>
            <id>273143</id>
            <affiliation>Infosim GmbH &amp; Co. KG</affiliation>
            <country>Germany</country>
            <presenter>0</presenter>
          </author>
        </authors>
      </paper>
      <paper>
        <starttime>15:37</starttime>
        <endtime>16:00</endtime>
        <paperid>1570392703</paperid>
        <sessionid>TS2.4</sessionid>
        <papertitle>An evolutionary controllers' placement algorithm for reliable SDN networks</papertitle>
        <trackname>Regular papers</trackname>
        <abstract>SDN controllers placement in TelCo networks are generally multi-objective and multi-constrained problems. The solutions proposed in the literature usually model the placement problem by providing a mixed integer linear program (MILP). Their performances are, however, quickly limited for large sized networks, due to the significant increase in the computational delays. In order to avoid the inherent complexity of optimal approaches and the lack of flexibility of heuristics, we propose in this paper a genetic algorithm designed from the NSGA II framework that aims to deal with the controller placement problem. Genetic algorithms can, indeed, be both multi-objective, multi-constraints and can be designed to be computed in parallel. They constitute a real opportunity to find good solutions to this category of problems. Furthermore, the proposed algorithm can be easily adapted to manage dynamic placements scenarios. The goal chosen, in this work, is to maximize the clusters average connectivity and to balance the control's load between clusters, in a way to improve the networks' reliability. The evaluation results on a set of network topologies demonstrated very good performances, which achieve optimal results for small networks.</abstract>
        <authors>
          <author>
            <name>
              <givenname>Jean-Michel</givenname>
              <mi/>
              <surname>Sanner</surname>
            </name>
            <id>842611</id>
            <affiliation>Orange Labs</affiliation>
            <country>France</country>
            <presenter>0</presenter>
          </author>
          <author>
            <name>
              <givenname>Yassine</givenname>
              <mi/>
              <surname>Hadjadj-Aoul</surname>
            </name>
            <id>189052</id>
            <affiliation>University of Rennes 1</affiliation>
            <country>France</country>
            <presenter>0</presenter>
          </author>
          <author>
            <name>
              <givenname>Meryem</givenname>
              <mi/>
              <surname>Ouzzif</surname>
            </name>
            <id>88130</id>
            <affiliation>Orange Labs</affiliation>
            <country>France</country>
            <presenter>0</presenter>
          </author>
          <author>
            <name>
              <givenname>Gerardo</givenname>
              <mi/>
              <surname>Rubino</surname>
            </name>
            <id>9909</id>
            <affiliation>Inria/Irisa</affiliation>
            <country>France</country>
            <presenter>0</presenter>
          </author>
        </authors>
      </paper>
    </papers>
  </session>
  <session>
    <code>PS2</code>
    <sessiontitle>Poster Session and Coffee Break 2</sessiontitle>
    <sessionsubtitle>Design and Control in SDN</sessionsubtitle>
    <sessionspeaker/>
    <sessiondetails/>
    <date>26 November 2017</date>
    <range>16:00-16:30</range>
    <starttime>2017-11-26T16:00:00+09:00</starttime>
    <endtime>2017-11-26T16:30:00+09:00</endtime>
    <room>Lobby, B1F, Bldg.27</room>
    <chairs>
      <chair>
        <name>
          <givenname>Noriaki</givenname>
          <mi/>
          <surname>Kamiyama</surname>
        </name>
        <affiliation>Fukuoka University</affiliation>
        <country>Japan</country>
      </chair>
    </chairs>
    <papers>
      <paper>
        <starttime>16:00</starttime>
        <endtime>16:06</endtime>
        <paperid>1570395383</paperid>
        <sessionid>PS2.1</sessionid>
        <papertitle>SDN implementation of multipath discovery to improve network performance in Distributed Storage Systems</papertitle>
        <trackname>Short papers</trackname>
        <abstract>The use of Distributed Storage Systems (DSS) have considerably increased in the past years, alongside the need for effective data transfer from storage to storage. Although current network infrastructure can reliably handle large amounts of traffic, networking techniques have not changed for several years, leading to an under-use of resources, i.e. most routing solutions still use single-path routing. In this paper, we present a pragmatic approach for multipath routing in DSS, which is based on Software Defined Networking (SDN) that uses parallel links at the edge-side. Path discovery is calculated by finding the k-maximum disjoint paths in a multigraph. Preliminary results show that, by using our multipath solution, not only the overall throughput increases but also the efficiency of resources usage.</abstract>
        <authors>
          <author>
            <name>
              <givenname>Luis</givenname>
              <mi/>
              <surname>Guillen Barja</surname>
            </name>
            <id>1525273</id>
            <affiliation>Tohoku University</affiliation>
            <country>Japan</country>
            <presenter>1</presenter>
          </author>
          <author>
            <name>
              <givenname>Satoru</givenname>
              <mi/>
              <surname>Izumi</surname>
            </name>
            <id>254919</id>
            <affiliation>Tohoku University</affiliation>
            <country>Japan</country>
            <presenter>0</presenter>
          </author>
          <author>
            <name>
              <givenname>Toru</givenname>
              <mi/>
              <surname>Abe</surname>
            </name>
            <id>1456930</id>
            <affiliation>Tohoku University</affiliation>
            <country>Japan</country>
            <presenter>0</presenter>
          </author>
          <author>
            <name>
              <givenname>Takuo</givenname>
              <mi/>
              <surname>Suganuma</surname>
            </name>
            <id>1525434</id>
            <affiliation>Tohoku University</affiliation>
            <country>Japan</country>
            <presenter>0</presenter>
          </author>
          <author>
            <name>
              <givenname>Hiroaki</givenname>
              <mi/>
              <surname>Muraoka</surname>
            </name>
            <id>183393</id>
            <affiliation>Tohoku University</affiliation>
            <country>Japan</country>
            <presenter>0</presenter>
          </author>
        </authors>
      </paper>
      <paper>
        <starttime>16:06</starttime>
        <endtime>16:12</endtime>
        <paperid>1570382738</paperid>
        <sessionid>PS2.2</sessionid>
        <papertitle>Managing the Availability of VNFs with the Availability Management Framework</papertitle>
        <trackname>Short papers</trackname>
        <abstract>A Virtualized Network Function (VNF) is deployed as a cluster of VMs in the Network Functions Virtualization Infrastructure (NFVI). As in traditional telecom, VNFs are expected to provide the required functions at the requested level of availability. For this, one has to incorporate proper redundancy, and appropriate recovery and coordination mechanisms among the redundant entities. The Service Availability Forum (SA Forum) has standardized such recovery and coordination mechanisms into a set of middleware services. Among them, the Availability Management Framework (AMF) has the responsibility of managing the availability of application services based on a configuration, called AMF configuration. We propose the use of AMF to manage the availability of the services provided by VNFs. For this, we map the AMF concepts to the Network Function Virtualization (NFV) domain and propose a method for the generation of AMF configurations for AMF managed VNFs. The approach generates an AMF configuration that meets the required level of availability of the requested service workload while aims at maximizing the resource utilization.</abstract>
        <authors>
          <author>
            <name>
              <givenname>Pradheba</givenname>
              <mi/>
              <surname>Rangarajan</surname>
            </name>
            <id>1514712</id>
            <affiliation>Concordia University</affiliation>
            <country>Canada</country>
            <presenter>0</presenter>
          </author>
          <author>
            <name>
              <givenname>Ferhat</givenname>
              <mi/>
              <surname>Khendek</surname>
            </name>
            <id>98378</id>
            <affiliation>Concordia University</affiliation>
            <country>Canada</country>
            <presenter>1</presenter>
          </author>
          <author>
            <name>
              <givenname>Maria</givenname>
              <mi/>
              <surname>Toeroe</surname>
            </name>
            <id>815407</id>
            <affiliation>Ericsson</affiliation>
            <country>Canada</country>
            <presenter>0</presenter>
          </author>
        </authors>
      </paper>
      <paper>
        <starttime>16:12</starttime>
        <endtime>16:18</endtime>
        <paperid>1570375197</paperid>
        <sessionid>PS2.3</sessionid>
        <papertitle>Scalability and Reliability Aware SDN Controller Placement Strategies</papertitle>
        <trackname>Short papers</trackname>
        <abstract>The principle of decoupling the control and data planes in the Software-Defined Networking (SDN) paradigm brings outstanding advantages in terms of logically centralized network control and application programming. However, the single point of management in physically centralized SDN architectures presents a potential point of failure and a serious bottleneck that could compromise network reliability and performance. Besides, such centralized designs may face scalability challenges especially in the case of networks involving a large number of hosts (e.g. IoT-oriented networks). In order to avoid such concerns, SDN control architectures are usually designed as physically distributed systems. This raises practical challenges regarding the best approach to decentralizing the SDN control plane while maintaining the logically centralized network view. In particular, determining the required number of SDN controllers and locating them within the SDN network is a challenging task that should be addressed appropriately. This paper proposes two novel strategies that cover different aspects of the controller placement problem with respect to multiple performance and reliability criteria. The proposed strategies use two different types of heuristics that are discussed, compared and assessed on large- scale network topologies in order to provide SDN operators with precise guidelines on how to find their optimal SDN controller placement that meets their specific needs.</abstract>
        <authors>
          <author>
            <name>
              <givenname>Fetia</givenname>
              <mi/>
              <surname>Bannour</surname>
            </name>
            <id>1358510</id>
            <affiliation>UPEC University</affiliation>
            <country>France</country>
            <presenter>0</presenter>
          </author>
          <author>
            <name>
              <givenname>Sami</givenname>
              <mi/>
              <surname>Souihi</surname>
            </name>
            <id>494741</id>
            <affiliation>University Paris Est UPEC</affiliation>
            <country>France</country>
            <presenter>0</presenter>
          </author>
          <author>
            <name>
              <givenname>Abdelhamid</givenname>
              <mi/>
              <surname>Mellouk</surname>
            </name>
            <id>116445</id>
            <affiliation>UPEC, University Paris-Est Creteil Val de Marne</affiliation>
            <country>France</country>
            <presenter>0</presenter>
          </author>
        </authors>
      </paper>
      <paper>
        <starttime>16:18</starttime>
        <endtime>16:24</endtime>
        <paperid>1570382312</paperid>
        <sessionid>PS2.4</sessionid>
        <papertitle>Reliable Service Function Chain Provisioning in Software-Defined Networking</papertitle>
        <trackname>Short papers</trackname>
        <abstract>A Service Function Chain (SFC) is an ordered Network Function (NF) chain to process flows or packets for the end-to-end delivery of network services. In the context of Network Function Virtualization (NFV) and Software-Defined Networking, which are promising technologies for next generation networks, the Virtualized Network Function (VNF) can be deployed on either generic physical machines or virtual machines. A challenging problem is to determine where and how to place these VNFs of an SFC request in the network. In this paper, we first formulate this VNFs placement problem as an Integer Linear Programing (ILP) model and then propose an enhanced VNF placing scheme based on layered graphs to achieve better reliability. To improve the reliability, our scheme avoids placing more than one VNFs of an SFC on the same node to protect the SFC from a single point of failure. We have conducted a numerical analysis and computer simulation for the feasibility validation of our scheme. The performance results, in terms of end to end delay of SFC and computation time cost on different topologies, show that our scheme performs well in different scenarios.</abstract>
        <authors>
          <author>
            <name>
              <givenname>Yansen</givenname>
              <mi/>
              <surname>Xu</surname>
            </name>
            <id>1410216</id>
            <affiliation>The University of Electro-Communications</affiliation>
            <country>Japan</country>
            <presenter>1</presenter>
          </author>
          <author>
            <name>
              <givenname>Ved</givenname>
              <mi>P.</mi>
              <surname>Kafle</surname>
            </name>
            <id>145894</id>
            <affiliation>National Institute of Information and Communications Technology</affiliation>
            <country>Japan</country>
            <presenter>0</presenter>
          </author>
        </authors>
      </paper>
      <paper>
        <starttime>16:24</starttime>
        <endtime>16:30</endtime>
        <paperid>1570395232</paperid>
        <sessionid>PS2.5</sessionid>
        <papertitle>Deadline-aware and Energy-Efficient Dynamic Flow Scheduling in Data Center Network</papertitle>
        <trackname>Short papers</trackname>
        <abstract>The construction of energy-efficient network and achievement of green communication have garnered great attention as a promising a way to reduce network operating costs and C emissions. Moreover, recently the deadline-aware and energy-efficient routing and scheduling algorithms in data center network have been attracting a broad attention. However, the dynamic scheduling for flows has not been explicitly studied by the existing research. In this paper, we investigated the dynamic flow scheduling in data center network, and propose a deadline-aware and energy-efficient dynamic flow scheduling (DEDFS) algorithm, assuming the path of the flow could be calculated in advance and pre-stored. In addition, the number of mouse flows in data center network accounts for main proportion, but consumption is very small. In order to achieve the balance of energy-saved and efficiency, mouse flows will be directly transferred, while elephant flows will be scheduled by the Most-Critical-First static strategy based dynamic scheduling algorithm. It selects the interval of largest energy consumption density as the critical interval, and all of the flows in this critical interval will be preferentially scheduled. Finally, the feasibility and validity of the algorithm are verified by simulation.</abstract>
        <authors>
          <author>
            <name>
              <givenname>Zan</givenname>
              <mi/>
              <surname>Yao</surname>
            </name>
            <id>1524230</id>
            <affiliation>Beijing University of Posts and Telecommunications</affiliation>
            <country>P.R. China</country>
            <presenter>0</presenter>
          </author>
          <author>
            <name>
              <givenname>Ying</givenname>
              <mi/>
              <surname>Wang</surname>
            </name>
            <id>677393</id>
            <affiliation>Beijing University of Posts and Telecommunications</affiliation>
            <country>P.R. China</country>
            <presenter>0</presenter>
          </author>
          <author>
            <name>
              <givenname>Junhua</givenname>
              <mi/>
              <surname>Ba</surname>
            </name>
            <id>1450540</id>
            <affiliation>Beijing University of Posts and Telecommunications</affiliation>
            <country>P.R. China</country>
            <presenter>0</presenter>
          </author>
          <author>
            <name>
              <givenname>Junran</givenname>
              <mi/>
              <surname>Zong</surname>
            </name>
            <id>1507060</id>
            <affiliation>Beijing University of Posts and Telecommunications &amp; State Key Laboratory of Networking and Switching Technology</affiliation>
            <country>P.R. China</country>
            <presenter>0</presenter>
          </author>
          <author>
            <name>
              <givenname>Sixiang</givenname>
              <mi/>
              <surname>Feng</surname>
            </name>
            <id>1506972</id>
            <affiliation>Beijing University of Posts and Telecommunications</affiliation>
            <country>P.R. China</country>
            <presenter>0</presenter>
          </author>
          <author>
            <name>
              <givenname>Zhanwei</givenname>
              <mi/>
              <surname>Wu</surname>
            </name>
            <id>1506913</id>
            <affiliation>Beijing University of Posts and Telecommunications &amp; State Key Laboratory of Networking and Switching Technology</affiliation>
            <country>P.R. China</country>
            <presenter>0</presenter>
          </author>
        </authors>
      </paper>
    </papers>
  </session>
  <session>
    <code>TS3</code>
    <sessiontitle>Technical Session 3</sessiontitle>
    <sessionsubtitle>Traffic Engineering</sessionsubtitle>
    <sessionspeaker/>
    <sessiondetails/>
    <date>26 November 2017</date>
    <range>16:30-18:00</range>
    <starttime>2017-11-26T16:30:00+09:00</starttime>
    <endtime>2017-11-26T18:00:00+09:00</endtime>
    <room>Ono Memorial Hall, B2F, Bldg.27</room>
    <chair>Toshio Tonouchi (NEC, Japan)</chair>
    <papers>
      <paper>
        <starttime>16:30</starttime>
        <endtime>16:52</endtime>
        <paperid>1570395499</paperid>
        <sessionid>TS3.1</sessionid>
        <papertitle>NeuRoute: Predictive Dynamic Routing for Software-Defined Networks</papertitle>
        <trackname>Regular papers</trackname>
        <abstract>This paper introduces NeuRoute, a dynamic routing framework for Software Defined Networks (SDN) entirely based on machine learning, specifically, Neural Networks. Current SDN/OpenFlow controllers use a default routing based on Dijkstra's algorithm for shortest paths, and provide APIs to develop custom routing applications. NeuRoute is a controller-agnostic dynamic routing framework that (i) predicts traffic matrix in real time, (ii) uses a neural network to learn traffic characteristics and (iii) generates forwarding rules accordingly to optimize the network throughput. NeuRoute achieves the same results as the most efficient dynamic routing heuristic but in much less execution time.</abstract>
        <authors>
          <author>
            <name>
              <givenname>Abdelhadi</givenname>
              <mi/>
              <surname>Azzouni</surname>
            </name>
            <id>1331347</id>
            <affiliation>UPMC &amp; LIP6</affiliation>
            <country>France</country>
            <presenter>1</presenter>
          </author>
          <author>
            <name>
              <givenname>Raouf</givenname>
              <mi/>
              <surname>Boutaba</surname>
            </name>
            <id>5035</id>
            <affiliation>University of Waterloo</affiliation>
            <country>Canada</country>
            <presenter>0</presenter>
          </author>
          <author>
            <name>
              <givenname>Guy</givenname>
              <mi/>
              <surname>Pujolle</surname>
            </name>
            <id>7029</id>
            <affiliation>University Pierre et Marie Curie - Paris 6</affiliation>
            <country>France</country>
            <presenter>0</presenter>
          </author>
        </authors>
      </paper>
      <paper>
        <starttime>16:52</starttime>
        <endtime>17:15</endtime>
        <paperid>1570388366</paperid>
        <sessionid>TS3.2</sessionid>
        <papertitle>Software-Defined Multipath-TCP for Smart Mobile Devices</papertitle>
        <trackname>Regular papers</trackname>
        <abstract>Current mobile consumer devices are equipped with the ability to connect to the Internet using a variety of heterogeneous wireless network technologies (e.g., Wi-Fi and LTE). These devices generally opt to statically connect using a single technology, based on predefined priorities. This static behavior does not allow the network to unlock its full potential, which becomes increasingly more important as the requirements of services, in terms of for example throughput and reliability, grow. MPTCP is a solution that allows the simultaneous use of multiple network interfaces. However, it does this uncoordinated for a single connection between two endpoints. Therefore, this paper proposes a SDN architecture to enable coordinated multi-path routing across the several networks for mobile devices. Moreover, we propose a novel weighted MPTCP scheduler that allows the transmission of certain controllable percentages of data per network interface. The proposed idea is evaluated through a real-life prototype implementation with a smartphone.</abstract>
        <authors>
          <author>
            <name>
              <givenname>Tom</givenname>
              <mi/>
              <surname>De Schepper</surname>
            </name>
            <id>1322649</id>
            <affiliation>University of Antwerp - imec</affiliation>
            <country>Belgium</country>
            <presenter>0</presenter>
          </author>
          <author>
            <name>
              <givenname>Jakob</givenname>
              <mi/>
              <surname>Struye</surname>
            </name>
            <id>1514231</id>
            <affiliation>University of Antwerp</affiliation>
            <country>Belgium</country>
            <presenter>1</presenter>
          </author>
          <author>
            <name>
              <givenname>Ensar</givenname>
              <mi/>
              <surname>Zeljkovic</surname>
            </name>
            <id>1477722</id>
            <affiliation>University of Antwerp - imec &amp; IDLab</affiliation>
            <country>Belgium</country>
            <presenter>0</presenter>
          </author>
          <author>
            <name>
              <givenname>Steven</givenname>
              <mi/>
              <surname>Latre</surname>
            </name>
            <id>1059359</id>
            <affiliation>University of Antwerp - imec</affiliation>
            <country>Belgium</country>
            <presenter>0</presenter>
          </author>
          <author>
            <name>
              <givenname>Jeroen</givenname>
              <mi/>
              <surname>Famaey</surname>
            </name>
            <id>508641</id>
            <affiliation>University of Antwerp &amp; Imec</affiliation>
            <country>Belgium</country>
            <presenter>0</presenter>
          </author>
        </authors>
      </paper>
      <paper>
        <starttime>17:15</starttime>
        <endtime>17:37</endtime>
        <paperid>1570394357</paperid>
        <sessionid>TS3.3</sessionid>
        <papertitle>On demand QoS with a SDN Traffic Engineering Management (STEM) module</papertitle>
        <trackname>Regular papers</trackname>
        <abstract>Software Defined Networking (SDN) allows new approaches to provide Quality of Service (QoS). In legacy networks, strict QoS guarantees often result in bandwidth over-provisioning. Then, QoS enforcement either consumes too many resources, or is not flexible enough. We present a solution to provide QoS, based on the creation of on-demand MPLS tunnels with guaranteed bandwidths across an SDN network. In the control layer, we introduce an SDN Traffic Engineering Management (STEM) module that interacts with the northbound applications to satisfy their requests to forward QoS-guaranteed traffic flows. STEM delegates the path selection to a Path Computation Element (PCE), and the path enforcement to an SDN controller. While existing works usually rely on statistic gathering to monitor the network, we rely on the stateful PCE to record the attributed resources and estimate the remaining network capacity, avoiding overloading the network with monitoring traffic. Upon STEM requests, the SDN controller enforces the QoS policy in the data plane. User flows are aggregated into an MPLS tunnel and packets are labeled with a priority depending on the flow effective bandwidth. The experimental results demonstrate that this solution efficiently enforces bandwidth sharing between priority and best effort flows in SDN networks.</abstract>
        <authors>
          <author>
            <name>
              <givenname>Cedric</givenname>
              <mi/>
              <surname>Morin</surname>
            </name>
            <id>1521612</id>
            <affiliation>IMT Atlantique &amp; TeleDiffusion de France</affiliation>
            <country>France</country>
            <presenter>0</presenter>
          </author>
          <author>
            <name>
              <givenname>Geraldine</givenname>
              <mi/>
              <surname>Texier</surname>
            </name>
            <id>15677</id>
            <affiliation>IRISA/IMT Atlantique &amp; BCOM</affiliation>
            <country>France</country>
            <presenter>0</presenter>
          </author>
          <author>
            <name>
              <givenname>Cao</givenname>
              <mi/>
              <surname>Phan</surname>
            </name>
            <id>1471298</id>
            <affiliation>BCOM</affiliation>
            <country>France</country>
            <presenter>0</presenter>
          </author>
        </authors>
      </paper>
      <paper>
        <starttime>17:37</starttime>
        <endtime>18:00</endtime>
        <paperid>1570392950</paperid>
        <sessionid>TS3.4</sessionid>
        <papertitle>Pre-provisioning of Local Protection for Handling Dual-failures in OpenFlow-based Networks</papertitle>
        <trackname>Regular papers</trackname>
        <abstract>An essential requirement in operating a carriergrade network (CGN) is ensuring the high availability and reliability. Software-defined networking (SDN) is expected to address such requirement while improving the network management. One challenging issue faced in the process of enhancing the reliability of SDN-enabled CGN is how to achieve rapid recovery with minimal effort. There are two well-known approaches to determine the failover scope: end-to-end (global) detouring and local detouring. Particularly, the local detouring approach provides an efficient means to achieve faster recovery, as it locally detours the disrupted flows around the failed network components using a preconfigured alternative path. However, it requires thousands of flow entries per switch to be configured. To address the technical challenges, we propose a fault-tolerant forwarding table design (FFTD), which groups the flows using group entries and aggregates the flows using a tagging mechanism for scalable and rapid recovery from the dual-failures of switches or links without overburdening the controller and the flow table's memory. Our extensive emulation results reveal that the proposed FFTD satisfies the CGN's 50 ms recovery requirement. Additionally, it reduces the alternate path flow storage requirement by up to 99%.</abstract>
        <authors>
          <author>
            <name>
              <givenname>Pankaj</givenname>
              <mi/>
              <surname>Thorat</surname>
            </name>
            <id>531321</id>
            <affiliation>Sungkyunkwan University</affiliation>
            <country>Korea</country>
            <presenter>0</presenter>
          </author>
          <author>
            <name>
              <givenname>Seil</givenname>
              <mi/>
              <surname>Jeon</surname>
            </name>
            <id>271445</id>
            <affiliation>Sungkyunkwan University</affiliation>
            <country>Korea</country>
            <presenter>0</presenter>
          </author>
          <author>
            <name>
              <givenname>Syed Muhammad</givenname>
              <mi/>
              <surname>Raza</surname>
            </name>
            <id>1012757</id>
            <affiliation>Sungkyunkwan Unviersity</affiliation>
            <country>Korea</country>
            <presenter>0</presenter>
          </author>
          <author>
            <name>
              <givenname>Hyunseung</givenname>
              <mi/>
              <surname>Choo</surname>
            </name>
            <id>99429</id>
            <affiliation>Sungkyunkwan University</affiliation>
            <country>Korea</country>
            <presenter>0</presenter>
          </author>
        </authors>
      </paper>
    </papers>
  </session>
</program>
