PPT-Programmable Packet Scheduling at Line Rate

Anirudh Sivaraman Suvinay Subramanian Anurag Agrawal Sharad Chole Shang Tse Chuang Tom Edsall Mohammad Alizadeh Sachin Katti Nick McKeown Hari . 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. . Programmable Optical Layer. Keren Bergman. Columbia University. Motivation. Today’s optical . WDM networks…deliver. Sufficient power margins for high physical-layer reliability,. “Error-free” (bit error ratios < 10. 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 Group. VMware . Techtalk. March 30, 2017. About Myself. 2. Ph.D. from Carnegie Mellon. Researcher at Microsoft Research, Silicon Valley. Distributed systems, security, compilers, cloud platforms, machine learning, visualization. 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. . Wenjie. . Zhou (. Co-Primary Author. ), . Dong Li (. Co-Primary Author. ), . Kannan. . Srinivasan. , . Prasun. . Sinha. 1. Enterprise Networks. 2. Important research topics:. Channel assignment. AP association. Anirudh . Sivaraman. , . Suvinay. Subramanian, Mohammad . Alizadeh. , Sharad . Chole. , Shang-. Tse. Chuang, Anurag Agrawal, Hari . Balakrishnan. , Tom . Edsall. , . Sachin. . Katti. , Nick McKeown. [SIGCOMM’16]. Muhammad Shahbaz. Nick . Feamster. Jennifer Rexford. Sean Choi. Nick McKeown. Ben Pfaff. Changhoon. Kim. Importance of Software Switches. Hypervisor. OVS. VM. VM. VM. VM. Hypervisor. Muhammad . Shahb. az. , Sean Choi, Ben Pfaff, . Changhoon. Kim,. . Nick . Feamster. , . Nick . McKeown, and Jennifer Rexford. P4 . OVS == . Fast Forwarding!. Also appears at SIGCOMM 2016!. 2. http://. Fall 2017 (. TTh. 1:30-2:50 in CS 105). COS 561: Advanced Computer Networks. http://. www.cs.princeton.edu. /courses/archive/fall17/cos561/. Software-Defined Networking (SDN). 2. Controller Platform. 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. 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.