A Zero Flow Entry Expiration Timeout P4 Switch

被引:3
|
作者
He, Cheng-Hung [1 ]
Chang, Brian Y. [1 ]
Chakraborty, Suchandra [2 ]
Chen, Chien [2 ]
Wang, Li Chun [1 ]
机构
[1] Natl Chiao Tung Univ, Dept Elect & Comp Engn, Hsinchu, Taiwan
[2] Natl Chiao Tung Univ, Dept Comp Sci, Hsinchu, Taiwan
来源
PROCEEDINGS OF THE SYMPOSIUM ON SDN RESEARCH (SOSR'18) | 2018年
关键词
SDN; TCP; P4; Idle Timeout; TCAM;
D O I
10.1145/3185467.3190785
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Existing OpenFlow based flow expiry mechanisms rely on a fixed timeout after which the switch proactively removes the flow entries from its flow table. Assigning an appropriate value to this timeout presents a tradeoff between efficient flow table utilization and controller overhead.We propose a simple addition of a zero flow entry expiration timeout scheme to idle timeout mechanism on a P4 based switch that identifies the last packet of a TCP flow, and removes the corresponding flow entry from the flow table. It enables connections to be deleted from the flow table right after it finishes, instead of waiting to expire after it reaches the timeout threshold and causing unnecessary flow table occupation.
引用
收藏
页数:2
相关论文
共 50 条
  • [21] On Ramsey (P4, P4) -minimal graphs for small-order
    Rahmadani, Desi
    Nusantara, Toto
    3RD INTERNATIONAL CONFERENCE ON MATHEMATICS AND SCIENCE EDUCATION (ICOMSE) 2019: STRENGTHENING MATHEMATICS AND SCIENCE EDUCATION RESEARCH FOR THE CHALLENGE OF GLOBAL SOCIETY, 2020, 2215
  • [23] SECAP Switch—Defeating Topology Poisoning Attacks Using P4 Data Planes
    Dylan Smyth
    Sandra Scott-Hayward
    Victor Cionca
    Sean McSweeney
    Donna O’Shea
    Journal of Network and Systems Management, 2023, 31
  • [24] Sharp upper bound for the regularity of zero-schemes of double points in P4
    Van Thiên, P
    COMMUNICATIONS IN ALGEBRA, 2002, 30 (12) : 5825 - 5847
  • [25] Overlaying Control Flow Graphs on P4 Syntax Trees with Gremlin
    Lukacs, Daniel
    Tejfel, Mate
    ACTA CYBERNETICA, 2024, 26 (03): : 593 - 619
  • [26] Prediction-based Flow Routing in Programmable Networks with P4
    Hardegen, Christoph
    Rieger, Sebastian
    2020 16TH INTERNATIONAL CONFERENCE ON NETWORK AND SERVICE MANAGEMENT (CNSM), 2020,
  • [27] Gorenstein liaison in P4
    Lesperance, Joshua
    ADVANCES IN GEOMETRY, 2006, 6 (02) : 275 - 286
  • [29] SMOOTH P4 SURFACES
    ELLINGSRUD, G
    PESKINE, C
    INVENTIONES MATHEMATICAE, 1989, 95 (01) : 1 - 11
  • [30] Update on the P4 project
    Green, Larry
    ANNALS OF FAMILY MEDICINE, 2008, 6 (01) : 86 - 86