Design & Control of High-Speed Networks
Date/Time: Tuesday 09:45-11:15
Sponsor: INFORMS Section on Applied Probability
Chair: Vidyadhar G. Kulkarni
Chair Address: Univ. of NC, Dept. of OR, Chapel Hill, NC 27599-3180,
An Optimal Service Scheduling Policy for Packet Networks with Quality of Service Guarantees Tao Yang --- Tech. Univ. of Nova Scotia, Dept. of IE, Falifax, Nova Scotia, , Canada B3J 2X4
- We propose a measurement-based service scheduling policy, the¨ D-policy, for high-speed packet networks with quality of service¨ guarantees. We show that the D-policy is optimal with respect to¨ channel efficiency among all stationary scheduling policies, examine¨ the propoerties of the D-policy and show how these properties can be¨ used to compute the minimum bandwidth required for a traffic¨ scenario...
Leaky Buckets: Sizing & Admission Control Natarajan Gautam, Vidyadhar G. Kulkarni --- Univ. of NC, Dept. of OR, CB 3180 Smith Bldg., Chapel Hill, NC 27599-3180, (Gautam@or.unc.edu)
- We propose a unified approach to address the issues of traffic¨ policing, admission control and network dimensioning using leaky¨ buckets. We compute the effective bandwidth of the output of the¨ leaky bucket and use these results in an optimization model for¨ optimal leaky bucket parameters.
Admission Control Strategies for the Transient Source Systems Vidyadhar G. Kulkarni, T. R. Reid --- Univ. of NC, Dept. of OR, Chapel Hill, NC 27599-3180, (firstname.lastname@example.org)
- In recent years, research has focused on effective bandwidth and its¨ application to call admission control for communications networks¨ where sources stay in the system permanently. Using a bound recently¨ developed by Palmowski & Rolski, we examine call admission control¨ for systems with transient sources where sources arrive according to¨ a random process, stay for a random length of time, then leave.