Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 4 of 4
Full-Text Articles in Physical Sciences and Mathematics
Label Switching Using The Ipv6 Address Hierarchy, P. Boustead, Joe F. Chicharo
Label Switching Using The Ipv6 Address Hierarchy, P. Boustead, Joe F. Chicharo
Faculty of Informatics - Papers (Archive)
Current label switching protocols can use routing, address, and address hierarchy information to group flows for cut-throughs that bypass IP forwarding. This paper examines a label switching solution that uses the IP version 6 (IPv6) address structure to classify and cut-through flows based on address hierarchy. The performance of this approach is examined using actual backbone traffic traces with associated hierarchical address information obtained from Internet address registries, routing arbiter databases and route servers. This hierarchical address information is used to map a hierarchical address structure over the packet level trace. We investigate the relationship between aggregation bit-mask size versus …
An Examination Of Ip/Atm Cut-Through Forwarding In Dynamically Routed Networks, P. Boustead, Joe F. Chicharo
An Examination Of Ip/Atm Cut-Through Forwarding In Dynamically Routed Networks, P. Boustead, Joe F. Chicharo
Faculty of Informatics - Papers (Archive)
Multiprotocol over ATM (MPOA), IP switching and multiprotocol label switching (MPLS) have distinctly different mechanisms for cut-through packet forwarding. MPOA and IP switching use flow-based cut-through (FBC) forwarding while MPLS uses routing table linked cut-through forwarding (TLC). This paper examines the sensitivity of each these cut-through forwarding mechanisms to changes in underlying routing tables. We examine a scenario where a congestion-sensitive dynamic routing protocol, such as OSPF optimised multipath, leads to frequently changing routing tables. We show that FBC forwarding reacts significantly worse than flow length distributions predict, taking up to 1200 seconds to react to route changes and forward …
Differentiated Service Performance Analysis, L. V. Nguyen, A. Eyers, Joe F. Chicharo
Differentiated Service Performance Analysis, L. V. Nguyen, A. Eyers, Joe F. Chicharo
Faculty of Informatics - Papers (Archive)
Differentiated service (DiffServ) has been proposed as an alternative for Integrated service. It aims to provide the same service to a group of flows that have similar quality of service requirements. Assured forwarding (AF) and expedited forwarding (EF) are two proposals for DiffServ provision. We present a performance analysis of an N drop-precedences threshold dropping (TD) queue, which is one of the proposed mechanisms for AF. In this analysis, traffic flows are assumed Poisson with exponentially distributed service time. We present simulation results that verify the analysis. This paper is an extension of the work attempted by Bolot et al. …
Modelling Multi-Player Games Traffic, R. A. Bangun, E. Dutkiewicz
Modelling Multi-Player Games Traffic, R. A. Bangun, E. Dutkiewicz
Faculty of Informatics - Papers (Archive)
The growing popularity of delay-sensitive multi-player games over the Internet is creating a need for proper characterisation of such traffic. We are currently developing source models for game traffic, on a per-player basis, with the intended use being to scale the models to simulate scenarios involving large numbers of players, which will enable us to observe the effects of game traffic on the network. We outline the procedure used, and we show that for certain cases, relatively simple source models are able to provide sufficiently accurate results (in terms of mean delay and mean buffer occupancy).