poster

Free access

netmap: memory mapped access to network devices

Authors:

Luigi Rizzo,

Matteo LandiAuthors Info & Claims

SIGCOMM '11: Proceedings of the ACM SIGCOMM 2011 conference

Pages 422 - 423

https://doi.org/10.1145/2018436.2018500

Published: 15 August 2011 Publication History

PDF eReader

Abstract

Recent papers have shown that wire-speed packet processing is feasible in software even at 10~Gbit/s, but the result has been achieved taking direct control of the network controllers to cut down OS and device driver overheads.

In this paper we show how to achieve similar performance in safer conditions on standard operating systems. As in some other proposals, our framework, called netmap, maps packet buffers into the process' memory space; but unlike other proposals, any operation that may affect the state of the hardware is filtered by the OS. This protects the system from crashes induced by misbehaving programs, and simplifies the use of the API.

Our tests show that netmap takes as little as 90 clock cycles to move one packet between the wire and the application, almost one order of magnitude less than using the standard OS path. A single core at 1.33~GHz can send or receive packets at wire speed on 10~Gbit/s links (14.8~Mpps), with very good scalability in the number of cores and clock speed.

At least three factors contribute to this performance: i) no overhead for encapsulation and metadata management; ii) no per-packet system calls and data copying (ioctl()s are still required, but involve no copying and their cost is amortized over a batch of packets); iii) much simpler device driver operation, because buffers have a plain and simple format that requires

References

[1]

E. Kohler, R. Morris, B. Chen, J. Jannotti, M.F. Kaashoek, The Click modular router, ACM TOCS, vol.18 n.3, pp. 263--297, ACM, 2000.

Digital Library

Google Scholar

[2]

M. Dobrescu, N. Egi, K. Argyraki, B.G. Chun, K. Fall, G. Iannaccone, A. Knies, M. Manesh, S. Ratnasamy, RouteBricks: Exploiting parallelism to scale software routers, ACM SOSP, 2009.

Digital Library

Google Scholar

[3]

S. Han, K. Jang, K. Park, S. Moon, PacketShader: a GPU-accelerated software router, Proc. of ACM SIGCOMM 2010, New Delhi, India

Digital Library

Google Scholar

[4]

L. Rizzo, netmap: fast and safe access to network adapters for user programs, Tech. Report, Univ. di Pisa, June 2011,http://info.iet.unipi.it/~luigi/netmap/

Google Scholar

Cited By

View all

Niu ZSu QCheng PXiong YHan DWinstein KXue CXu H(2022)NetKernel: Making Network Stack Part of the Virtualized InfrastructureIEEE/ACM Transactions on Networking10.1109/TNET.2021.312980630:3(999-1013)Online publication date: Jun-2022
https://doi.org/10.1109/TNET.2021.3129806
Hu XLi JMa RGuan H(2022)ES2: Building an Efficient and Responsive Event Path for I/O VirtualizationIEEE Transactions on Cloud Computing10.1109/TCC.2020.296966010:2(1358-1372)Online publication date: 1-Apr-2022
https://doi.org/10.1109/TCC.2020.2969660
Woithe HSegall I(2021)daß: Distributable And Scalable Simulation of Robotic Applications2021 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS)10.1109/IROS51168.2021.9636152(7550-7556)Online publication date: 27-Sep-2021
https://dl.acm.org/doi/10.1109/IROS51168.2021.9636152
Show More Cited By

Index Terms

netmap: memory mapped access to network devices
1. Networks
  1. Network properties
    1. Network range
      1. Local area networks
      2. Wide area networks

Recommendations

netmap: memory mapped access to network devices
SIGCOMM '11

Recent papers have shown that wire-speed packet processing is feasible in software even at 10~Gbit/s, but the result has been achieved taking direct control of the network controllers to cut down OS and device driver overheads.

In this paper we show how ...
Netmap: a novel framework for fast packet I/O
USENIX ATC'12: Proceedings of the 2012 USENIX conference on Annual Technical Conference

Many applications (routers, traffic monitors, firewalls, etc.) need to send and receive packets at line rate even on very fast links. In this paper we present netmap, a novel framework that enables commodity operating systems to handle the millions of ...
Packet Forwarding with Swaps
Structural Information and Communication Complexity
Abstract
We consider packet forwarding in the adversarial queueing theory (AQT) model introduced by Borodin et al. In this context, a series of recent works have established optimal bounds for buffer space usage of for simple network topologies, where n ...

Comments

Information & Contributors

Information

Published In

SIGCOMM '11: Proceedings of the ACM SIGCOMM 2011 conference

August 2011

502 pages

ISBN:9781450307970

DOI:10.1145/2018436

General Chairs:
Srinivasan Keshav
University of Waterloo, Canada
,
Jörg Liebeherr
University of Toronto, Canada
,
Program Chairs:
John Byers
Boston University, USA
,
Jeffrey Mogul
HP Labs, USA

ACM SIGCOMM Computer Communication Review Volume 41, Issue 4
SIGCOMM '11
August 2011
480 pages
ISSN:0146-4833
DOI:10.1145/2043164
Issue’s Table of Contents

Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for third-party components of this work must be honored. For all other uses, contact the Owner/Author.

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 15 August 2011

Check for updates

Author Tags

Qualifiers

Poster

Conference

SIGCOMM '11

Sponsor:

SIGCOMM

SIGCOMM '11: ACM SIGCOMM 2011 Conference

August 15 - 19, 2011

Ontario, Toronto, Canada

Acceptance Rates

SIGCOMM '11 Paper Acceptance Rate 32 of 223 submissions, 14%;

Overall Acceptance Rate 462 of 3,389 submissions, 14%

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

40
Total Citations
View Citations
504
Total Downloads

Downloads (Last 12 months)93
Downloads (Last 6 weeks)12

Reflects downloads up to 10 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Niu ZSu QCheng PXiong YHan DWinstein KXue CXu H(2022)NetKernel: Making Network Stack Part of the Virtualized InfrastructureIEEE/ACM Transactions on Networking10.1109/TNET.2021.312980630:3(999-1013)Online publication date: Jun-2022
https://doi.org/10.1109/TNET.2021.3129806
Hu XLi JMa RGuan H(2022)ES2: Building an Efficient and Responsive Event Path for I/O VirtualizationIEEE Transactions on Cloud Computing10.1109/TCC.2020.296966010:2(1358-1372)Online publication date: 1-Apr-2022
https://doi.org/10.1109/TCC.2020.2969660
Woithe HSegall I(2021)daß: Distributable And Scalable Simulation of Robotic Applications2021 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS)10.1109/IROS51168.2021.9636152(7550-7556)Online publication date: 27-Sep-2021
https://dl.acm.org/doi/10.1109/IROS51168.2021.9636152
Esfandiari.S MNajafi SIravani Msabri S(2020)Improve Performance of RTP Relaying Sessions in IMS Transport Layer With LREProxy2020 10th International Conference on Computer and Knowledge Engineering (ICCKE)10.1109/ICCKE50421.2020.9303608(193-202)Online publication date: 29-Oct-2020
https://doi.org/10.1109/ICCKE50421.2020.9303608
Sonchack JAviv AKeller ESmith JOliveira RFelber PHu Y(2018)TurboflowProceedings of the Thirteenth EuroSys Conference10.1145/3190508.3190558(1-16)Online publication date: 23-Apr-2018
https://dl.acm.org/doi/10.1145/3190508.3190558
Nayak NDurr FRothermel K(2018)Incremental Flow Scheduling and Routing in Time-Sensitive Software-Defined NetworksIEEE Transactions on Industrial Informatics10.1109/TII.2017.278223514:5(2066-2075)Online publication date: May-2018
https://doi.org/10.1109/TII.2017.2782235
Naik PVutukuru M(2017)libVNFProceedings of the 8th Asia-Pacific Workshop on Systems10.1145/3124680.3124728(1-8)Online publication date: 2-Sep-2017
https://dl.acm.org/doi/10.1145/3124680.3124728
Zheng K(2017)Enabling “Protocol Routing”: Revisiting Transport Layer Protocol Design in Internet CommunicationsIEEE Internet Computing10.1109/MIC.2017.418084521:6(52-57)Online publication date: Nov-2017
https://doi.org/10.1109/MIC.2017.4180845
Patra PRothenberg CPongracz G(2017)MACSAD: High performance dataplane applications on the move2017 IEEE 18th International Conference on High Performance Switching and Routing (HPSR)10.1109/HPSR.2017.7968684(1-6)Online publication date: Jun-2017
https://doi.org/10.1109/HPSR.2017.7968684
Nakamura RKuga YSekiya YEsaki HCui HLau FBansal SZhong L(2016)Protocol-Independent FIB Architecture for Network OverlaysProceedings of the 7th ACM SIGOPS Asia-Pacific Workshop on Systems10.1145/2967360.2967372(1-7)Online publication date: 4-Aug-2016
https://dl.acm.org/doi/10.1145/2967360.2967372
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

netmap: memory mapped access to network devices

Netmap: a novel framework for fast packet I/O

Packet Forwarding with Swaps