Boseob Kwon

Throttle and preempt: a new flow control for real-time communications in wormhole networks

We study wormhole routed networks and their suitability for real-time traffic in a priority-driven paradigm. A traditional blocking flow control in wormhole routing may lead to a priority inversion in the sense that high priority packets are blocked by low priority packets for unlimited time. This uncontrolled priority inversion causes the frequent deadline missing. This paper therefore proposes a new flow control called throttle and preempt flow control, where high priority packets can preempt network resources held by low priority packets, if necessary. As a result, this flow control does not cause priority inversion. Our simulations show that the throttle and preempt flow control dramatically reduces deadline miss ratio without extra virtual channels. It is also observed that the throttle and preempt flow control offers shorter delay for non-real-time traffic than existing real-time flow control does.

Throttle and preempt : A flow control policy for real-time traffic in wormhole networks

Abstract In this paper, we study wormhole routed networks and envision their suitability for real-time traffic in a priority-driven paradigm. A traditional blocking flow control in wormhole routing may lead to a priority inversion in the sense that high priority packets are blocked by low priority packets for unlimited time. This uncontrolled priority inversion causes the frequent deadline missing even at a low network load. This paper therefore proposes a new flow control called throttle and preempt flow control, where high priority packets can preempt network resources held by low priority packets, if necessary. As a result, this flow control does not cause priority inversion. Our simulations show that the throttle and preempt flow control dramatically reduces deadline miss ratio for various real-time traffic configurations without extra virtual channels. It is also observed that the throttle and preempt flow control offers shorter delay for non-real-time traffic than the existing real-time flow control does.

Two Real-Time Flow Controls in Wormhole Networks

In this paper, we study wormhole routed networks and envision their suitability for real-time traffic in a priority-driven paradigm. A traditional blocking flow control in wormhole routing may lead to a priority inversion in the sense that high priority packets are blocked by low priority packets for unlimited time. The priority inversion causes the frequent deadline missing even at a low network load. This paper therefore proposes two preemptive flow control policies where high priority packets can preempt network resources held by low priority packets. As a result, the proposed flow controls can resolve the priority inversion. Our simulations show that preemptive flow controls significantly reduce deadline miss ratios for various real-time traffic configurations.

Performance analysis of an ATM switch with multiple paths

An ATM switch based on multistage interconnection networks with multiple paths can support higher bandwidth than that of buffered networks with single path by passing multiple packets to the same destination simultaneously. These multiple packets are buffered in the output buffer of the destination. The performance of output buffer in the switch with multiple paths is closely dependent on the output traffic distribution, which is the packet arrival rate at each output link destined to a given output port. As the nonuniformity of the output traffic distribution becomes higher, the performance of the output buffer as like delay and packet loss probability gets better. In this paper, we propose a new self-routing switch architecture with multiple paths called Fly network and analyze the performance of the switching network and the output buffer focusing on the output traffic distribution. It is shown that the Fly network supports best throughput and latency of the output buffer by producing a high degree of the nonuniform output traffic distribution.

Performance Analysis of Cal1 Arrival History-Based Location Update Algorithm

Location tracking is used to keep track of the location information of a mobile terminal in an idle state for a cail setup between mobile terminals. In this paper, we introduce a location update algorithm based on the call arrival history, which is appropriate for a variable call arrival rate over time. The location tracking strategy which uses the proposed algorithm can find changes in the call arrival rate by maintaining a call arrival history of a mobile terminal, from which a mobile terminal can calculate an appropriate timeout interval for a variable call arrival rate. We show that the proposed scheme is appropriate for a variable call arrival rate by presenting a simple analytical model and analytical results to investigate its performance for both a fixed and a variable call arrival rate.

Two-phase multicast in wormhole-switched bidirectional multistage Banyan networks

A multistage interconnection network is a suitable class of interconnection architecture for constructing large-scale multicomputers. Broadcast and multicast communication are fundamental in supporting collective communication operations such as reduction and barrier synchronization. In this paper, we propose a new multicast technique in wormhole-switched bidirectional multistage Banyan networks for constructing large-scale multicomputers. To efficiently support broadcast and multicast with simple additional hardware without deadlock, we propose a two-phase multicast algorithm which takes only two transmissions to perform a broadcast and a multicast to an arbitrary number of desired destinations. We encode a header as a cube and adopt the most upper input link first scheme with periodic priority rotation as arbitration mechanism on contented output links. We coalesce the desired destination addresses into multiple number of cubes. And then, we evaluate the performance of the proposed algorithm by simulation. The proposed two-phase multicast algorithm makes a significant improvement in terms of latency. It is noticeable that the two-phase algorithm keeps broadcast latency as efficient as the multicast latency of fanout 2m where m is the minimum integer satisfying 2/sup m//spl ges//spl radic/(N) (N is a network size).

Performance analysis of multipath multistage interconnection networks with nonuniform output traffic distribution

Develops the analysis of output buffers in multipath multistage interconnection networks. The delay-throughput performance of output buffers in multipath interconnection networks is closely related to the output traffic distribution, which is the distribution of packet arrival rates at each output link connected to a given output module. Many multipath networks produce nonuniform output traffic distributions, even if the input traffic pattern is uniform. We propose in this paper a performance model for output buffer analysis with respect to such a nonuniform output traffic distribution and analyze the output buffer performance of several multipath networks by our proposed analysis model. It is shown that the output traffic distributions are different for the various multipath networks and the output buffer performance (such as packet loss probability and delay) gets better as the nonuniformity of the output traffic distribution becomes higher.