Proceedings. 10th IEEE International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunications Systems

16-16 Oct. 2002

Filter Results

Displaying Results 1 - 25 of 61
  • Proceedings 10th IEEE International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems. MASCOTS 2002

    Publication Year: 2002
    Request permission for commercial reuse | PDF file iconPDF (357 KB)
    Freely Available from IEEE
  • Network traffic behaviour in switched Ethernet systems

    Publication Year: 2002, Page(s):33 - 42
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (419 KB) | HTML iconHTML

    Measurements on a high-performance Ethernet are shown to match well a truncated Cauchy probability distribution, with a much better fit over smaller file/request sizes than the commonly used Pareto distribution. We observe self similar characteristics in the traffic both at file servers and at a CPU server elsewhere in the network, which targets, predominantly, file and Web servers. This suggests ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance models for computer and telecommunications systems: maximizing the benefits

    Publication Year: 2002
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (218 KB) | HTML iconHTML

    Summary form only given. Telecommunications systems were among the first to use modeling and analysis to improve designs. Since those early days, researchers have made many advances in the technology and tools. Performance models have been successfully applied to a variety of other computer systems design problems. When we consider the current state of the art and state of the practice, are we sat... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Author index

    Publication Year: 2002, Page(s):519 - 521
    Request permission for commercial reuse | PDF file iconPDF (185 KB)
    Freely Available from IEEE
  • Playing with time: on the specification and execution of time-enriched LSCs

    Publication Year: 2002, Page(s):193 - 202
    Cited by:  Papers (18)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (475 KB) | HTML iconHTML

    We extend live sequence charts (LSCs), a highly expressive variant of sequence diagrams, with timing constructs, thus making the language suitable for specifying the behavioral requirements of time-intensive systems. We follow R. Alur and T.A. Henzinger (see Software Tools for Technology Transfer, vol.1, p.86-109, 1997) in basing the extension on a single clock object. We have implemented the exte... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Network level capacity planning with efficiently computable global optimum

    Publication Year: 2002, Page(s):229 - 236
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (396 KB) | HTML iconHTML

    A novel, network level capacity planning model is presented with the following key properties. (1) The link level traffic and blocking model is very general. It allows multiclass traffic and the individual bandwidth demands may aggregate in complex, nonlinear ways. The conventional assumptions, such as Poisson arrivals or exponential holding times, are not required, thus allowing non-standard beha... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A new mechanism for supporting differentiated services in cluster-based network servers

    Publication Year: 2002, Page(s):427 - 432
    Cited by:  Papers (4)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (295 KB) | HTML iconHTML

    As the Web is becoming a medium widely used as a preferential channel for critical information exchange, business, and e-commerce, it is necessary to enable differentiated service (DiffServ) mechanisms not only at the network but also at the Web server level. We present a new service differentiation mechanism (arrival-related dynamic partitioning) for cluster-based network servers. We demonstrate ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Disha: a performance model of a true fully adaptive routing algorithm in k-ary n-cubes

    Publication Year: 2002, Page(s):183 - 190
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (322 KB) | HTML iconHTML

    A number of analytical models for predicting message latency in k-ary n-cubes have recently been reported in the literature. Most of these models, however, have been discussed for adaptive routing algorithms based on deadlock avoidance. Several research studies have empirically demonstrated that routing algorithms based on deadlock recovery offer maximal adaptivity that can result in considerable ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Global caching mechanisms in clusters of Web servers

    Publication Year: 2002, Page(s):421 - 426
    Cited by:  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (338 KB) | HTML iconHTML

    We investigate how to improve Web cluster performance through cooperation protocols for a shared use of the main memories of the server nodes (global caching). Many popular schemes to locate requested documents are based upon locality information sharing (namely, informed cooperation); we also propose a novel approach for document lookup through a query broadcasting mechanism (namely, on-demand co... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Analysis of interference in a wireless link with frequency hopping

    Publication Year: 2002, Page(s):303 - 312
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (321 KB) | HTML iconHTML

    We analyze the effect of interference on traffic performance in a fixed wireless access system that uses frequency hopping (FH). The system consists of an access device that buffers traffic for transmission over N FH channels. The N FH channels are subject to random interference, hence characterized by different bit error rates (BERs). We show that, compared to a purely random FH, an adaptive FH t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Modified LC-trie based efficient routing lookup

    Publication Year: 2002, Page(s):177 - 182
    Cited by:  Papers (9)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (276 KB) | HTML iconHTML

    IP address lookup at the router is a complex problem. This has been primarily due to the increasing table sizes, growth in traffic rate and high link capacities. We propose an algorithm for fast routing lookup with reduced memory utilization and access time. This approach shows significant performance improvement in the average case and optimizes the overall time taken for packet routing. Since st... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance analysis using coloured Petri nets

    Publication Year: 2002, Page(s):217 - 221
    Cited by:  Papers (14)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (271 KB) | HTML iconHTML

    This paper provides an overview of improved facilities for performance analysis using coloured Petri nets. Coloured Petri nets is a formal method that is well suited for modeling and analyzing large and complex systems. The paper describes steps that have been taken to make a distinction between modeling the behavior of a system and observing the behavior of a model. Performance-related facilities... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Understanding the object retrieval dependence of Web page access

    Publication Year: 2002, Page(s):413 - 420
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (387 KB) | HTML iconHTML

    We propose a chunk-level client's latency dependence model (C-LDM) to describe the effect of network protocol, streaming data transfer mechanism, and Web page structure on the latency perceived by a Web client. Object retrieval latency is made up of four components: (i) definition - finding the definition of embedded objects in a page; (ii) queuing - waiting for object request dissemination into t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Variable heavy tailed durations in Internet traffic. Part I. Understanding heavy tails

    Publication Year: 2002, Page(s):43 - 50
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1605 KB) | HTML iconHTML

    The paper is part of a larger paper (see Hernandez-Campos, F. et al., http://www.cs.unc.edu/Research/dirt/proj/marron/VarHeavyTails, 2002) that studies the tails of the duration distribution of Internet data flows, and their "heaviness". Data analysis motivates the concepts of moderate, far and extreme tails for understanding the richness of information available in the data. The analysis also mot... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance of batch-based digital signatures

    Publication Year: 2002, Page(s):291 - 299
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (383 KB) | HTML iconHTML

    A digital signature is an important type of authentication in a public-key (or asymmetric) cryptographic system, and it is in wide use. The performance of an Internet server computing digital signatures online is limited by the high cost of modular arithmetic. One simple way to improve the performance of the server is to reduce the number of computed digital signatures by combining a set of docume... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance modelling and evaluation of k-ary n-cube networks in the presence of bursty traffic

    Publication Year: 2002, Page(s):383 - 390
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (340 KB) | HTML iconHTML

    The paper presents a more realistic performance model for k-ary n-cube networks under bursty traffic. The validity of the model is demonstrated by comparing analytical results to those obtained through simulation experiments of the actual systems. The proposed model is then used to investigate the implications of bursty traffic on network performance. The results reveal that the performance of k-a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Evaluating advanced routing algorithms for content-based publish/subscribe systems

    Publication Year: 2002, Page(s):167 - 176
    Cited by:  Papers (14)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1352 KB) | HTML iconHTML

    We present an evaluation of advanced routing algorithms for content-based publish/subscribe systems that focuses on the inherent characteristics of routing algorithms (routing table sizes and filter forwarding overhead) instead of system-specific parameters (CPU load etc.). The evaluation is based on a working prototype instead of simulations and compares several routing algorithms to each other. ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Workload characterization in Web caching hierarchies

    Publication Year: 2002, Page(s):13 - 22
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (803 KB) | HTML iconHTML

    The paper uses trace-driven simulation and synthetic Web workloads to study the request arrival process at each level of a simple Web proxy caching hierarchy. The simulation results show that a Web cache reduces both the peak and the mean request arrival rate for Web traffic workloads. However, the variability of the request arrival process may either increase, decrease, or remain the same after t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Novel formulae for GSPN aggregation

    Publication Year: 2002, Page(s):209 - 216
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (417 KB) | HTML iconHTML

    Stationary analysis of generalized stochastic Petri nets (GSPNs) often suffers from the state space explosion problem. Large reachability sets somorphic to continuous-time Markov chains - are not only expensive to generate, but related high-dimensional data structures also put excessive demands on numerical algorithms. In particular, sequences of transitions and alternative branches contribute mul... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Statistical service assurances for applications in utility grid environments

    Publication Year: 2002, Page(s):247 - 256
    Cited by:  Papers (13)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (444 KB) | HTML iconHTML

    We focus on techniques to support admission control and advance resource reservation for applications acquiring information technology (IT) resources from utility grid environments. Utility grid environments offer programmatic access to resources for complex multi-tier applications. In particular we consider business applications which require resources continuously but that have resource demands ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A discrete-time model of TCP Reno with background traffic interference

    Publication Year: 2002, Page(s):445 - 452
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (368 KB) | HTML iconHTML

    This paper introduces a discrete-time model which captures the essential protocol features of the congestion control mechanism used by the TCP Reno protocol, subject to interference from other sources. Under this model, a single target session is modeled according to the TCP Reno mechanism, including fast retransmit and fast recovery. At the same time, other sources are modeled as a background pro... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The effect of peer selection and buffering strategies on the performance of peer-to-peer file sharing systems

    Publication Year: 2002, Page(s):63 - 70
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (409 KB) | HTML iconHTML

    Peer-to-peer systems contain a collection of equivalent entities that form an application-layer overlay network. Each entity acts as client, server, and overlay network router. Peer-to-peer systems enable the rapid development of distributed applications; peer-to-peer file sharing has become one of the most popular Internet applications. There are two primary functions in a peer-to-peer file shari... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Generation of high bandwidth network traffic traces

    Publication Year: 2002, Page(s):401 - 410
    Cited by:  Papers (8)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (342 KB) | HTML iconHTML

    High bandwidth network traffic traces are needed to understand the behavior of high speed networks (such as the Internet backbone). However, the implementation of a mechanism to collect such traces is difficult in practice. In the absence of real traces, tools to generate high bandwidth traces would aid the study of high speed network behavior. We describe three methods of generating high bandwidt... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Two-level iterative queuing modeling of software contention

    Publication Year: 2002, Page(s):267 - 276
    Cited by:  Papers (9)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (343 KB) | HTML iconHTML

    Being able to model contention for software resources (e.g., a critical section or database lock) is paramount to building performance models that capture all aspects of the delay encountered by a process as it executes. Several methods have been offered for dealing with software contention and with message blocking in client-server systems. This paper presents a general, straightforward, easy to ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A self-tuning page cleaner for DB2

    Publication Year: 2002, Page(s):81 - 89
    Cited by:  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (338 KB) | HTML iconHTML

    The buffer pool in a DBMS is used to cache the disk pages of the database. Because typical database workloads are I/O-bound, the effectiveness of the buffer pool management algorithm is a crucial factor in the performance of the DBMS. In IBM's DB2 buffer pool, the page cleaning algorithm is used to write changed pages to disks before they are selected for replacement. We conducted a detailed study... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.