PPT-Programmable Packet Scheduling at Line Rate

Anirudh Sivaraman Suvinay Subramanian Mohammad Alizadeh Sharad Chole Shang Tse Chuang Anurag Agrawal Hari Balakrishnan Tom Edsall Sachin Katti Nick McKeown. se Abstract Global 64257xedpriority scheduling of constrained deadline sporadic tasks systems is important not only for CPU scheduling but also in other domains for example scheduling realtime 64258ows in WirelessHART networks designed for industrial H I G H E N D C A P A B I L I T I E S F O R L O W E R S C A L E A P P L I C A T I O N S A P P L I C A T I O N S Small service provider session border controller SBC access and interconnect 0HPEHU57347RI573472UDFOH57526V57347657347FOXVWHU Session rou By. Dr. Amin Danial Asham. References. Real-time Systems Theory and Practice. . By . Rajib. mall. Task Scheduling. Real-Time task scheduling essentially refers to determining the order in which the various tasks are to be taken up for execution by the operating system. Every operating system relies on one or more task schedulers to prepare the schedule of execution of various tasks it needs to run. Each task scheduler is characterized by the scheduling algorithm it employs. A large number of algorithms for scheduling real-Time tasks have so far been developed. Real-Time task scheduling on uniprocessors is a mature discipline now with most of the important results having been worked out in the early 1970's. The research results available at present in the literature are very extensive and it would indeed be grueling to study them exhaustively. In this text, we therefore classify the available scheduling algorithms into a few broad classes and study the characteristics of a few important ones in each class. . Anirudh . Sivaraman. , . Suvinay. Subramanian, . Anurag. Agrawal, . Sharad. . Chole. , Shang-. Tse. Chuang, Tom . Edsall. , Mohammad . Alizadeh. , . Sachin. . Katti. , Nick . McKeown. , . Hari. . Active Networks + SDN. How to Introduce new services . Overlays: user can introduce what-ever. Ignores physical network . . . perf. overhead. Overlay nodes – software routing . . . perf. overhead. . data planes. http://P4.org. Mihai Budiu. VMware Research. VRG reading group. February 1, . 2017. Goal. Network. device. Your own protocols. Standard protocols. Datacenter. Currently most useful if you have. Bosshart. , Nick McKeown, and Mihai . Budiu. Outline. Motivation for programmable switches. Early attempts at programmability. Programmability without losing performance: The Reconfigurable Match-Action Table model. Anirudh . Sivaraman. , . Suvinay. Subramanian, . Anurag. Agrawal, . Sharad. . Chole. , Shang-. Tse. Chuang, Tom . Edsall. , Mohammad . Alizadeh. , . Sachin. . Katti. , Nick . McKeown. , . Hari. . Anirudh . Sivaraman. , . Suvinay. Subramanian, Mohammad . Alizadeh. , Sharad . Chole. , Shang-. Tse. Chuang, Anurag Agrawal, Hari . Balakrishnan. , Tom . Edsall. , . Sachin. . Katti. , Nick McKeown. Hao. Wang and Bill Lin. University of California, San Diego. HSPR 2010, Dallas. HPSR, June 13-16, 2010. Packet Buffer in Routers. Scheduler . and . Packet . Buffers. i. n. Input . linecards. . have . Or multiple packets to send, or web requests to serve, or …. Definitions. response time, throughput, predictability. Uniprocessor. policies. FIFO, round robin, optimal. multilevel feedback as approximation of optimal. Before. . SDN. …. Many boxes (routers, switches, firewalls, …), with different interfaces.. A Brief History. . of. . SDN. Many. . functions. . in. . networking. . devices. Routing,. . Switching,. Fall 2019. Programmable Scheduling. Scheduling in switch pipelines. Packets wait in buffers/queues until serviced. Two possibilities: . Input-queued. vs. . output-queued. Suppose there are pkts on port 1 to both 2 and 3. with a Single Queue. Zhuolong Yu. Chuheng. Hu, . Jingfeng. Wu, Xiao Sun, Vladimir Braverman,. Mosharaf. Chowdhury, . Zhenhua. Liu, Xin . Jin. 1. Many packet scheduling algorithms have been designed for different properties.