By Topic

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
  • Author index

    Publication Year: 2002, Page(s):519 - 521
    Request permission for commercial reuse | PDF file iconPDF (185 KB)
    Freely Available from IEEE
  • Workload service requirements analysis: a queueing network optimization approach

    Publication Year: 2002, Page(s):23 - 32
    Cited by:  Papers (12)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (370 KB) | HTML iconHTML

    The answers to many important performance related questions with multiclass queueing models depends upon having estimates for the service times of different classes of jobs. We present a general approach to infer the per-class service times at different servers in an environment where only server throughput, utilization and per-class response time measurements are available. The per-class service ... 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.
  • Cognitive packet networks: QoS and performance

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

    Reliability, security, scalability and QoS (quality-of-service) have become key issues as we envision the future Internet. The paper presents the "cognitive packet network" (CPN) architecture in which intelligent peer-to-peer routing is carried out with the help of "smart packets" based on best-effort QoS goals. Since packetized voice has stringent QoS requirements, we then discuss the choice of a... 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.
  • Evaluation of gossip to build scalable and reliable multicast protocols

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

    This paper provides an extensive experimental evaluation of the gossip technique that has been proposed to construct scalable and reliable multicast protocols. This evaluation has been done by simulating several gossip and non gossip-based multicast protocols in a network simulator NS2. The evaluation comprises of three parts: (1) a comparison of the gossip technique with other traditional message... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Power conservation strategies for MEMS-based storage devices

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

    Power dissipation by storage systems in mobile computers accounts for a large percentage of the power consumed by the entire system. Reducing the power used by the storage device is crucial for reducing overall power consumption. A new class of secondary storage devices based on microelectromechanical systems (MEMS) promises to consume an order of magnitude less power with 10-20 times shorter late... 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 (12)
    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.
  • 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.
  • 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.
  • A model of TCP in wide area networks

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

    This paper presents a discrete-time Markov chain model for the Reno version of TCP the transmission control protocol for reliable transport on the Internet. The purpose is the evaluation of stationary TCP flows behavior using performance measures such as the mean throughput. The model is based on previous works which are generalized by taking into account the slow start phases that appear after ea... 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.
  • An architectural infrastructure and topological optimization for end system multicast

    Publication Year: 2002, Page(s):481 - 488
    Cited by:  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (354 KB) | HTML iconHTML

    Although IP-multicast has been proposed and investigated for the some time, there are major problems inherent in the IP-multicasting technique, for example, scalability problems, difficulty to allocate a globally unique multicast address, complexity to support higher level features such as reliable data transfer congestion/flow control and security, and more importantly, deployment problem due to ... 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.
  • 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.
  • Two-level iterative queuing modeling of software contention

    Publication Year: 2002, Page(s):267 - 276
    Cited by:  Papers (6)  |  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.
  • 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.
  • Modeling and analysis of fast handoff algorithms for microcellular networks

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

    In urban microcellular environments, fast handoff algorithms are needed to react to sudden changes in path loss characteristics that typically occur when the mobile turns around street corners. We introduce a class of fast handoff algorithms based on a local averaging technique that removes only the fast fading component from the received signal strength. By exploiting the fact that local averagin... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An algorithmic and numerical approach to bound the performance of high speed networks

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

    Stochastic bounds and deterministic bounds (for instance network calculus) are promising methods to analyze QoS requirements for high speed networks. Indeed, it is sufficient to prove that a bound of the real performance satisfies the guarantee. However, stochastic bounds are quite difficult to prove and often require some sample-path proofs. We present a new method based on stochastic ordering, a... 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.
  • 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.
  • Playing with time: on the specification and execution of time-enriched LSCs

    Publication Year: 2002, Page(s):193 - 202
    Cited by:  Papers (16)
    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.
  • Evaluating advanced routing algorithms for content-based publish/subscribe systems

    Publication Year: 2002, Page(s):167 - 176
    Cited by:  Papers (11)
    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.
  • Collision avoidance in multi-hop ad hoc networks

    Publication Year: 2002, Page(s):145 - 154
    Cited by:  Papers (23)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (398 KB) | HTML iconHTML

    Collision avoidance is very important in contention-based medium access control protocols for multi-hop ad hoc networks due to the adverse effects of hidden terminals. Four-way sender-initiated schemes are the most popular collision-avoidance schemes to date. Although there has been considerable work on the performance evaluation of these schemes, most analytical work is confined to single-hop ad ... View full abstract»

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