Network scheduling algorithms

Fair queuing

Fair queuing is a family of scheduling algorithms used in some process and network schedulers. The algorithm is designed to achieve fairness when a limited resource is shared, for example to prevent flows with large packets or processes that generate small jobs from consuming more throughput or CPU time than other flows or processes. Fair queuing is implemented in some advanced network switches and routers. (Wikipedia).

Video thumbnail

Introduction to Fair Division

This video introduced fair division. Site: http://mathispower4u.com

From playlist Fair Division

Video thumbnail

Fair Division: The Sealed Bid Method

This video explains and provides examples of how to apply the sealed bid method. Site: http://mathispower4u.com

From playlist Fair Division

Video thumbnail

Access 2007: Using Queries Part 1

In this video, you’ll learn more about using queries to make data meaningful in Access 2007. Visit https://www.gcflearnfree.org/access2007/using-queries-to-make-data-meaningful-part-1/1/ for our text-based lesson. This video includes information on: • Planning a query • Using the Query De

From playlist Microsoft Access 2007

Video thumbnail

WebAssembly: The What, Why and How

WebAssembly is a portable, size, and load-time efficient binary format for the web. It is an emerging standard being developed in the WebAssembly community group, and supported by multiple browser vendors. This talk details what WebAssembly is, the problems it is trying to solve, exciting

From playlist Talks

Video thumbnail

Fair Division: The Lone Divider Method

This video explains and provides an example of the lone divider method of fair division. Site: http://mathispower4u.com

From playlist Fair Division

Video thumbnail

Can You Validate These Emails?

Email Validation is a procedure that verifies if an email address is deliverable and valid. Can you validate these emails?

From playlist Fun

Video thumbnail

SERVERLESS: The Rise Of External Services

Serverless has captivated the IT community at an incredible pace, and for good reason. It has tremendous power to liberate productivity, increase innovation and reduce overhead. However, adopting serverless technologies is still not well understood. As the ecosystem grows around serverl

From playlist Serverless

Video thumbnail

"RM Models for Online Advertising and On-Demand Platforms" by Philipp Afèche - Session IV

This mini-course focuses on revenue management applications in online advertising and on-demand platforms with time-sensitive customers that give rise to novel matching and queueing models. For example, online advertising platforms match impressions supply to advertiser demand, whereas on-

From playlist Thematic Program on Stochastic Modeling: A Focus on Pricing & Revenue Management​

Video thumbnail

Maker Faire 2011: How To Pick a Lock

Norm learns the secrets of lock picking from The Open Organisation of Lockpickers.

From playlist Maker Faire

Video thumbnail

From Rails Rumble to 50,000,000 results by Mikel Lindsaar

StillAlive.com was born from the 48 hour intense 2010 Rails Rumble and has grown! Having recently passed our 50,000,000th site result, this talk discusses the real world challenges and optimisations required to take a code base born from the fires of YAGNI to a production system. This tal

From playlist Rails Conf 2012

Video thumbnail

13. Little, M/G/1, Ensemble Averages

MIT 6.262 Discrete Stochastic Processes, Spring 2011 View the complete course: http://ocw.mit.edu/6-262S11 Instructor: Robert Gallager License: Creative Commons BY-NC-SA More information at http://ocw.mit.edu/terms More courses at http://ocw.mit.edu

From playlist MIT 6.262 Discrete Stochastic Processes, Spring 2011

Video thumbnail

RubyConf 2021 - Acidic Jobs: A Layman's Guide to Job Bliss by Stephen Margheim

Background jobs have become an essential component of any Ruby infrastructure, and, as the Sidekiq Best Practices remind us, it is essential that jobs be "idempotent and transactional." But how do we make our jobs idempotent and transactional? In this talk, we will explore various techniqu

From playlist RubyConf 2021

Video thumbnail

Lecture 10 | Convex Optimization II (Stanford)

Lecture by Professor Stephen Boyd for Convex Optimization II (EE 364B) in the Stanford Electrical Engineering department. Professor Boyd introduces a new topic, Decomposition Applications. This course introduces topics such as subgradient, cutting-plane, and ellipsoid methods. Decentral

From playlist Lecture Collection | Convex Optimization

Video thumbnail

"RM Models for Online Advertising and On-Demand Platforms" by Philipp Afèche - Session III

This mini-course focuses on revenue management applications in online advertising and on-demand platforms with time-sensitive customers that give rise to novel matching and queueing models. For example, online advertising platforms match impressions supply to advertiser demand, whereas on-

From playlist Thematic Program on Stochastic Modeling: A Focus on Pricing & Revenue Management​

Video thumbnail

Using OpenTable.com

In this video, you’ll learn more about using OpenTable.com to make reservations online. Visit https://www.gcflearnfree.org/using-the-web-to-get-stuff-done/using-opentablecom/1/ for our text-based lesson. This video includes information on: • Using OpenTable.com to make reservations online

From playlist Using the Web to Get Stuff Done

Video thumbnail

Lec 25 | MIT 6.00SC Introduction to Computer Science and Programming, Spring 2011

Lecture 25: Queuing Network Models Instructor: John Guttag View the complete course: http://ocw.mit.edu/6-00SCS11 License: Creative Commons BY-NC-SA More information at http://ocw.mit.edu/terms More courses at http://ocw.mit.edu

From playlist MIT 6.00SC Introduction to Computer Science and Programming

Video thumbnail

RubyConf 2022: What does "high priority" mean? The secret to happy queues by Daniel Magliola

Like most web applications, you run important jobs in the background. And today, some of your urgent jobs are running late. Again. No matter how many changes you make to how you enqueue and run your jobs, the problem keeps happening. The good news is you're not alone. Most teams struggle w

From playlist RubyConf 2022: Mini and Houston

Video thumbnail

24C3: Port Scanning improved

Speakers: Fabian Yamaguch, FX of Phenoelit Port-Scanning large networks can take ages. Asking yourself how much of this time is really necessary and how much you can blame on the port-scanner, you may find yourself integrating your own scanner into the linux-kernel. Or at least we did

From playlist 24C3: Full steam ahead

Video thumbnail

Live CEOing Ep 523: Language Design in Wolfram Language [Metamodeling]

In this episode of Live CEOing, Stephen Wolfram discusses upcoming improvements and features to the Wolfram Language. If you'd like to contribute to the discussion in future episodes, you can participate through this YouTube channel or through the official Twitch channel of Stephen Wolfram

From playlist Behind the Scenes in Real-Life Software Design

Video thumbnail

Access 2010: Multi-Table Queries, Part 2

In this video, you’ll learn more about joining multi-table queries in Access 2010. Visit https://www.gcflearnfree.org/access2010/designing-a-query/1/ for our text-based lesson. This video includes information on: • Joining tables in queries • Creating multi-table queries We hope you enjo

From playlist Microsoft Access 2010

Related pages

Traffic shaping | Scheduling (computing) | Fairness measure | Round-robin scheduling | Max-min fairness | Active queue management | Deficit round robin | Generalized processor sharing | Weighted round robin | Network scheduler | Priority queue | FIFO (computing and electronics)