Using OpenFlow to provide cut-through switching in MobilityFirst

被引:0
|
作者
Adrian Lara
Byrav Ramamurthy
Kiran Nagaraja
Aravind Krishnamoorthy
Dipankar Raychaudhuri
机构
[1] University of Nebraska-Lincoln,
[2] Rutgers University,undefined
来源
关键词
OpenFlow; Software-defined networks; FIA; MobilityFirst; VLAN tag;
D O I
暂无
中图分类号
学科分类号
摘要
Mobile devices are expected to become the Internet’s predominant technology. Current protocols such as TCP/IP were not originally designed with mobility as a key consideration, and therefore underperform under challenging mobile and wireless conditions. MobilityFirst, a clean slate architecture proposal, embraces several key concepts centered around secure identifiers that inherently support mobility and trustworthiness as key requirements of the network architecture. This includes a hop-by-hop segmented data transport based on a globally unique identifier. This allows late and dynamic rebinding of end-point addresses to support mobility. While this provides critical gains in wireless segments, some overheads are incurred even in stable segments such as in the core. Bypassing routing-layer decisions in these cases, with lower layer cut-through forwarding, can improve said gains. In this work, we introduce a general bypass capability within the MobilityFirst architecture that provides better performance and enables both individual and aggregate flow-level traffic control. Furthermore, we present an OpenFlow-based proof-of-concept implementation of the bypass function using layer 2 VLAN tagging. We run experiments on the ORBIT and Global Environment for Network Innovations (GENI) testbeds to evaluate the performance and scalability of the solution. By implementing the bypass functionality, we are able to significantly reduce the number of messages processed by the controller as well as the number of flow rules that need to be pushed into the switches.
引用
收藏
页码:165 / 177
页数:12
相关论文
共 50 条
  • [1] Using OpenFlow to provide cut-through switching in MobilityFirst
    Lara, Adrian
    Ramamurthy, Byrav
    Nagaraja, Kiran
    Krishnamoorthy, Aravind
    Raychaudhuri, Dipankar
    PHOTONIC NETWORK COMMUNICATIONS, 2014, 28 (02) : 165 - 177
  • [2] Inter-Domain Routing with Cut-Through Switching for the MobilityFirst Future Internet Architecture
    Lara, Adrian
    Mukherjee, Shreyasee
    Ramamurthy, Byrav
    Raychaudhuri, Dipankar
    Ramakrishnan, K. K.
    2016 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS (ICC), 2016, : 341 - 346
  • [3] LOCAL REROUTING WITH VIRTUAL CUT-THROUGH SWITCHING
    LIGOMENIDES, PA
    MANNAVA, PK
    IEE PROCEEDINGS-E COMPUTERS AND DIGITAL TECHNIQUES, 1987, 134 (04): : 197 - 202
  • [4] A cut-through switching technology for IEEE 802.11
    Hiertz, GR
    Habetha, J
    Weiss, E
    Mangold, S
    PROCEEDINGS OF THE IEEE 6TH CIRCUITS AND SYSTEMS SYMPOSIUM ON EMERGING TECHNOLOGIES: FRONTIERS OF MOBILE AND WIRELESS COMMUNICATION, VOLS 1 AND 2, 2004, : 663 - 666
  • [5] Quick Removing (QR) Approach using Cut-Through Switching Mode
    Nsaif, Saad Allawi
    Kim, Semog
    Rhee, Jong Myung
    2016 18TH INTERNATIONAL CONFERENCE ON ADVANCED COMMUNICATIONS TECHNOLOGY (ICACT) - INFORMATION AND COMMUNICATIONS FOR SAFE AND SECURE LIFE, 2016, : 170 - 174
  • [6] ERROR CONTROL STRATEGIES FOR CUT-THROUGH SWITCHING NETWORK
    CHANG, CJ
    WANG, JI
    ELECTRONICS LETTERS, 1990, 26 (22) : 1894 - 1895
  • [7] Cut-through switching, pipelining, and scheduling for network evacuation
    Tassiulas, L
    IEEE-ACM TRANSACTIONS ON NETWORKING, 1999, 7 (01) : 88 - 97
  • [8] Improving FPGA NoC Performance using Virtual Cut-Through Switching Technique
    Maidee, Pongstorn
    Kaviani, Alireza
    2015 INTERNATIONAL CONFERENCE ON RECONFIGURABLE COMPUTING AND FPGAS (RECONFIG), 2015,
  • [9] THE DELAY ANALYSIS IN A NOISY GENERAL CUT-THROUGH SWITCHING NETWORK
    CHANG, CJ
    CHIU, JH
    LIN, SJ
    COMPUTER NETWORKS AND ISDN SYSTEMS, 1993, 26 (02): : 185 - 194
  • [10] DELAY ANALYSIS OF A MODIFIED CUT-THROUGH SWITCHING FOR MULTIPACKET MESSAGES
    ILYAS, M
    MOUFTAH, HT
    IEE PROCEEDINGS-E COMPUTERS AND DIGITAL TECHNIQUES, 1985, 132 (01): : 44 - 48