By Topic

Modeling, Analysis and Simulation of Computer and Telecommunication Systems, 1999. Proceedings. 7th International Symposium on

Date 24-28 Oct. 1999

Filter Results

Displaying Results 1 - 25 of 43
  • MASCOTS '99. Proceedings of the Seventh International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems

    Publication Year: 1999
    Request permission for commercial reuse | PDF file iconPDF (66 KB)
    Freely Available from IEEE
  • Table of contents

    Publication Year: 1999, Page(s):v - viii
    Request permission for commercial reuse | PDF file iconPDF (145 KB)
    Freely Available from IEEE
  • Adaptive CPU scheduling policies for mixed multimedia and best-effort workloads

    Publication Year: 1999, Page(s):252 - 261
    Cited by:  Papers (4)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (200 KB)

    As multimedia applications with real-time constraints rapidly invade today's desktops, it becomes increasingly important for the operating system to provide robust resource allocation mechanisms for both multimedia and traditional best-effort workloads. We present a flexible CPU scheduling policy that adjusts the CPU proportion allocated to each application class using recent history as a feedback... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A design and management framework for mobile agent systems

    Publication Year: 1999, Page(s):314 - 321
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (192 KB)

    A framework for developing `mobile agent' systems is described based on Petri net models of design patterns in the Aglets workbench. The `Meeting' and `Interaction' design patterns are investigated. The models can be automatically configured from Java source programs, and can account for stochastic parameters such as port contention at hosts, agent registration, background workloads and scalabilit... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An auction-based flexible pricing scheme for renegotiated QoS connections and its evaluation

    Publication Year: 1999, Page(s):244 - 251
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (484 KB)

    This work presents a new renegotiated flexibly-priced communication service. The service is based on a novel auction-based flexible pricing scheme, where the flexibility is expressed in terms of client-supplied budget functions that represent the upper bound on the bandwidth unit price the client is willing to pay, as a function of time. This flexibility allows for the admission control and the ba... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Prediction of disk arm movements in anticipation of future requests

    Publication Year: 1999, Page(s):305 - 312
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (196 KB)

    Algorithms for performing predictive movements of a disk arm in anticipation of future requests, aimed at reducing the disk access time, are described in this paper. The prediction is based on the past history of the requested disk tracks. A continuum of optimization algorithms has been derived, featuring different prediction performances and hence different complexities. Trace-driven simulations ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Analysis of self-similarity in I/O workload using structural modeling

    Publication Year: 1999, Page(s):234 - 242
    Cited by:  Papers (19)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (280 KB)

    Demonstrates that disk-level I/O requests are self-similar in nature. We show evidence (both visual and mathematical) that I/O accesses are consistent with self-similarity. For this analysis, we have used two sets of disk activity traces collected from various systems over different periods of time. In addition to studying the aggregated I/O workload that is directed to the storage system, we perf... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A system-assisted disk I/O simulation technique

    Publication Year: 1999, Page(s):296 - 304
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (120 KB)

    Simulation and modeling are useful tools in prototyping advances in many areas of technology. The performance of modern processors is advancing much faster than that of storage components, making disk systems prime candidates for simulation. Simulating disk systems allows researchers to determine and quantify the performance impact of alternative file system designs and disk data rearrangement tec... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Predicting behavior patterns using adaptive workload models [computer networks]

    Publication Year: 1999, Page(s):226 - 233
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (168 KB)

    Workload characteristics in a modern networking environment are very dynamic. In order to maximize performance continuously, it is natural to explore the possibility of intelligent systems which can take cognizance of the workload dynamics and adapt themselves for future control applications. In this paper, we propose a mechanism which represents the previous state of the system as a string. The u... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimizing message aggregation for parallel simulation on high performance clusters

    Publication Year: 1999, Page(s):76 - 83
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (120 KB)

    High performance clusters (HPCs) based on commodity hardware are becoming more and more popular in the parallel computing community. These new platforms offer hardware capable of a very low latency and a very high throughput at an unbeatable cost, making them attractive for a large variety of parallel and distributed applications. With adequate communication software, HPCs have the potential to ac... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Modeling memory reference patterns of programs in cache memory systems

    Publication Year: 1999, Page(s):288 - 295
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (200 KB)

    Proposes a novel model to characterize the behavior of individual programs in the presence of cache memory. The model goes beyond the traditional hit/miss ratios often used in the current literature to describe program-cache interactions. Instead, it looks at the characteristics of the sequences of hits and misses during a program execution. The model includes several distributions that describe t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Failure distance based bounds for steady-state availability without the knowledge of minimal cuts

    Publication Year: 1999, Page(s):138 - 147
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (240 KB)

    We propose an algorithm to compute bounds for the steady-state unavailability using continuous-time Markov chains, which is based on the failure distance concept. The algorithm generates incrementally a subset of the state space until the tightness of the bounds is the specified one. In contrast with a previous algorithm also based on the failure distance concept, the proposed algorithm uses lower... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Modeling user behavior: a layered approach

    Publication Year: 1999, Page(s):218 - 225
    Cited by:  Papers (9)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (92 KB)

    The simulation of computer systems requires representative, reliable workload models. When simulating computer systems or components that are influenced by user behavior, this very behavior has to be modeled by using mathematical means. In this article, we propose a user behavior model framework that is constructed in a top-down manner consisting of various layers. The layers offer services to the... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The SimUTC fault-tolerant distributed systems simulation toolkit

    Publication Year: 1999, Page(s):68 - 75
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (132 KB)

    We introduce our SimUTC toolkit, a fault-tolerant distributed systems simulation built upon the discrete event simulation package C++SIM. SimUTC has been developed in the course of our project SynUTC and targets distributed algorithms for high-accuracy fault-tolerant clock synchronization. This application domain requires detailed simulation models for network transmission and local clock devices,... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Evaluating concurrency options in software specifications

    Publication Year: 1999, Page(s):330 - 338
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (164 KB)

    An approach called PERFECT is described which evaluates the feasibility of proposed software concurrency architectures for a set of scenarios and a set of quality-of-service requirements. An evaluation is performed by constructing and simulating a virtual implementation which conforms to the specified behaviour and the specified concurrency architecture. For simulation, the execution of applicatio... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Jump transitions in second order FSPNs

    Publication Year: 1999, Page(s):156 - 163
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (192 KB)

    In this paper jump transitions for the fluid model part in second order fluid stochastic Petri nets (FSPNs) are introduced. The extended formalism is defined, and the underlying partial differential equations are derived. With a jump a certain amount of fluid is added to a fluid place or taken out at once. This amount, the jump height, is sampled from a probability distribution. The dynamics of a ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An analytical comparison of cooperation protocols for Web proxy servers

    Publication Year: 1999, Page(s):174 - 181
    Cited by:  Papers (3)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (144 KB)

    Sharing cached documents among cooperative Web proxies is an effective solution to reduce Web traffic and alleviate network bottlenecks. This paper aims at comparing the performance of two cooperation protocols which follow opposite approaches: the Internet Cache Protocol (ICP) and the Full Informed Protocol (FIP). The former activates information exchange among proxies on client demand; the latte... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multiprocessor memory reference generation using Cerberus

    Publication Year: 1999, Page(s):278 - 287
    Cited by:  Papers (4)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (172 KB)

    Presents Cerberus, an efficient system for simulating the execution of shared-memory, multiprocessor programs on a uniprocessor workstation. Using EDS (execution-driven simulation), it generates address traces which can be used to drive cache simulations on-the-fly, eliminating the large disk space requirements needed by trace files. It is fast because it links the program to be traced together wi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • CAC performance with self-similar traffic: simulation study and performance results

    Publication Year: 1999, Page(s):102 - 111
    Cited by:  Papers (2)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (64 KB)

    This paper investigates, through simulation, the performance of five connection admission control (CAC) algorithms used in ATM networks, namely: PCR CAC, SCR CAC, AVG CAC, GCAC, and Norros CAC, when presented with synthetically generated homogeneous self-similar traffic sources. Various traffic and system parameters have been used. The simulation results show that statistical multiplexing gains bo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A generic framework for parallelization of network simulations

    Publication Year: 1999, Page(s):128 - 135
    Cited by:  Papers (29)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (180 KB)

    Discrete event simulation is widely used within the networking community for purposes such as demonstrating the validity of network protocols and architectures. Depending on the level of detail modeled within the simulation, the running time and memory requirements can be excessive. The goal of our research is to develop and demonstrate a practical, scalable approach to parallel and distributed si... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance and robustness testing of explicit-rate ABR flow control schemes

    Publication Year: 1999, Page(s):10 - 19
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (188 KB)

    This paper compares and evaluates three ABR flow control strategies (ERICA, ERICA+, and DEBRA) for ATM networks, using simulation. A set of benchmark network scenarios is used to illustrate the properties of each algorithm, such as efficiency, fairness, responsiveness, and scalability, as well as robustness in the presence of uncooperative sources. The simulation results show that ERICA+ and DEBRA... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Analysis of personal computer workloads

    Publication Year: 1999, Page(s):208 - 217
    Cited by:  Papers (7)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (252 KB)

    Most published research on system behavior and workload characterization has been based on either Unix systems or large (usually IBM) mainframe systems. It is reasonable to believe that user behaviors and workloads are different for PC systems. Further, the aspects of system design and most-needed study have changed from the mainframes that were dominant in the 1960s and 1970s, and the Unix system... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fair scheduling in an optical interconnection network

    Publication Year: 1999, Page(s):56 - 65
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (232 KB)

    Existing fair scheduling schemes have focused primarily on scheduling multiple flows to a single output. The limited work that has focused on scheduling multiple flows to multiple outputs has assumed a non-blocking, slotted-time, cell-based network with a centralized controller. This paper presents a fair scheduler suitable for use in bufferless circuit-switched blocking networks operating with di... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the design of efficient video-on-demand broadcast schedules

    Publication Year: 1999, Page(s):262 - 269
    Cited by:  Papers (16)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (160 KB)

    In order to address the scalability problems of video-on-demand systems, several periodic broadcast schemes have been proposed that partition a video into segments and repetitively broadcast each segment on a separate channel. A new scheme is presented for the bandwidth-efficient periodic broadcast of video. The proposed scheme determines the segment sizes and their corresponding channel bandwidth... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A synchronization protocol for group communication systems

    Publication Year: 1999, Page(s):322 - 329
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (80 KB)

    With the evolution of network technologies, integrated services networks make possible real-time multimedia applications. However, the delay jitter and the absence of a physical global clock may disrupt the temporal relationships among media units composing theses multimedia applications. The Δ-causal ordering is designed to ensure real-time delivery of messages by respecting the causal orde... View full abstract»

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