The goal of this session is to increase the participants' knowledge of current funding opportunities at the National Science Foundation (NSF) to support projects with potential significant impacts on science, technology, engineering, and mathematics (STEM) education. In particular, the discussion will focus on new and current funding opportunities in the Division of Undergraduate Education (DUE) in the Directorate of Education and Human Resources (EHR) and the Division of Engineering Education & Centers (EEC) in the Directorate of Engineering. During the session, we will provide examples of project activities that support STEM education research opportunities. The session will use a highly interactive format (i.e., team-based activities and discussion) to engage the participants, to clarify misconceptions, and to potentially initiate and share new ideas pertinent to engineering education research and innovations in classroom implementations. This session facilitates idea sharing and interaction amongst peers.

Bursts consist of a varying number of asynchronous transfer mode cells corresponding to a datagram. Here, we generalized weighted fair queueing to a burst-based algorithm with preemption. The new algorithm enhances the performance of the switch service for real-time applications, and it preserves the quality of service guarantees. We study this algorithm theoretically and via simulations.

Fair queueing is a useful queueing discipline for packet switching systems. It was developed in last decade and was aimed at the general packet switching systems with varying packet length. However it is not suitable for use in the ATM networking, because the ATM cell length is very small and fixed, and so the scheduling scheme on a per cell basis is not practical. We introduce the burst and quality unit concepts in the scheduling algorithm and we make some significant modification on the fair queueing and adapt it to ATM networking to meet QoS requirements. Under the work-conserving assumption, we show that the burst based non-preemptive and preemptive algorithms provide throughput and fairness guarantees.

For pt.I see ibid. p.445-61. The scheduling scheme of a switch affects the delay, throughput and fairness of a network and thus has a great impact on the quality of service (QoS). In part I, we present a theoretical analysis of a burst scheduling for ATM switches and proved QoS guarantees on throughput and fairness of the applications. Here, we use simulation to demonstrate the superiority of the burst based weighted fair queueing over the non-burst version. Our simulation study is based on backbone and access subnetworks, which are common in the real world.

Efficient and fair use of buffer space in ATM switches is essential to gain high throughput and low cell-loss performance from the network. A shared buffer architecture associated with threshold based virtual partition among output ports is proposed. Thresholds are updated based on traffic characteristics on each outgoing link, so as to adapt to traffic loads. System behavior under varying traffic patterns is investigated via simulation. Cell loss rate is the quality of service (QoS) measure that is used in this paper. The study shows that the threshold based adaptive buffer allocation scheme ensures fair share of the buffer space even under bursty loading conditions.