In this talk we review how certain constrained optimizations relate to the stationary behaviour of some classical reversible queueing networks. We then build on this work to provide scheduling policies that provide novel performance guarantees for more modern queueing network models.
Current 2019 2018 2017 2016 2015 2014 2013 2012 2011 2010 2009 2008 2007 2006 2005 2004 2003 2002 2001 2000 1999 1998 1997 1996
