C) 2002 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new

Abstract

Based on queuing theory we develop analytical approximations for the average packet transfer time of a store-and-forward and a cutthrough buffer insertion ring with two client traffic priorities. These types of rings are architectural alternatives for resilient packet rings (RPR) which transport data (e.g., IP) packets over optical media. We use the approximations for a delay comparison of both ring architectures. It turns out that high priority traffic is more delayed in the cut-through architecture than in the store-and-forward architecture whereas low priority traffic performs similarly in both architectures