### IEEE INFOCOM 2022

## Packets and Flows

### FlowShark: Sampling for High Flow Visibility in SDNs

Sogand Sadrhaghighi (University of Calgary, Canada); Mahdi Dolati (University of Tehran, Iran); Majid Ghaderi (University of Calgary, Canada); Ahmad Khonsari (University of Tehran, Iran)

### Joint Resource Management and Flow Scheduling for SFC Deployment in Hybrid Edge-and-Cloud Network

Yingling Mao, Xiaojun Shang and Yuanyuan Yang (Stony Brook University, USA)

### NFlow and MVT Abstractions for NFV Scaling

Ziyan Wu and Yang Zhang (University of Minnesota, USA); Wendi Feng (Beijing Information Science and Technology University, China); Zhi-Li Zhang (University of Minnesota, USA)

### The Information Velocity of Packet-Erasure Links

Elad Domanovitz (Tel Aviv University, Israel); Tal Philosof (Samsung, Israel); Anatoly Khina (Tel Aviv University, Israel)

###### Session Chair

Ruidong Li (Kanazawa University)

## Performance

### Mag-E4E: Trade Efficiency for Energy in Magnetic MIMO Wireless Power Transfer System

Xiang Cui, Hao Zhou, Jialin Deng and Wangqiu Zhou (University of Science and Technology of China, China); Xing Guo (Anhui University, China); Yu Gu (Hefei University of Technology, China)

### Minimal Total Deviation in TCAM Load Balancing

Yaniv Sadeh (Tel Aviv University, Israel); Ori Rottenstreich (Technion - Israel Institute of Technology, Israel); Haim Kaplan (Tel-Aviv University, Israel)

We consider the L1 distance between partitions, which is of interest when overloaded requests are simply dropped, and we want to minimize the total loss. We prove that the Niagara algorithm can be used to find the closest partition in L1 to the desired partition, that can be realized with n TCAM rules. Moreover, we prove it for arbitrary partitions, with (possibly) non-integer parts.

### Performance and Scaling of Parallel Systems with Blocking Start and/or Departure Barriers

Brenton Walker (Leibniz Universität Hannover, Germany); Stefan Bora (Universität Hannover, Germany); Markus Fidler (Leibniz Universität Hannover, Germany)

We derive analytical expressions for the stability regions for parallel systems with blocking start and/or departure barriers. We extend results from queuing theory to derive waiting and sojourn time bounds for systems with blocking start barriers. Our results show that for a given system utilization and number of servers, there is an optimal degree of parallelism that balances waiting time and job execution time. This observation leads us to propose and implement a class of self-adaptive schedulers, we call "Take-Half", that modulate the allowed degree of parallelism based on the instantaneous system load, improving mean performance and eliminating stability issues.

### Short-Term Memory Sampling for Spread Measurement in High-Speed Networks

Yang Du, He Huang and Yu-e Sun (Soochow University, China); Shigang Chen (University of Florida, USA); Guoju Gao, Xiaoyu Wang and Shenghui Xu (Soochow University, China)

###### Session Chair

Markus Fidler (Leibniz Universität Hannover)

Made with in Toronto · Privacy Policy · INFOCOM 2020 · INFOCOM 2021 · © 2022 Duetone Corp.