By Topic

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

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
  • 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.
  • 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.
  • Simulation of broadband multiple access protocols for wireless networks

    Publication Year: 1999, Page(s):92 - 100
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (116 KB)

    This paper describes the simulation of two broadband multiple access protocols. The protocols are modeled using OPNET. A formal verification for one of the protocols is also provided. The simulation models and verification procedures will be useful for network designers who wish to understand the operation of the two protocols View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Approximate analysis of open network of GE/GE/m/N queues with transfer blocking

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

    In this paper we describe an approximate method for the analysis of an open network of finite capacity queues. Finite buffer capacities at the nodes introduce blocking of jobs that finish service at a node and find that the destination node is full at that time. When this happens, we assume that the blocked job is held at the server of the queue where it just completed service, blocking that serve... 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.
  • 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 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.
  • 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.
  • Analytical modelling of the network traffic performance

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

    Interconnection network modeling is an important field in order to study and understand interconnection network behaviour and its significance in telecommunication applications and distributed systems. In this paper, we show an analytical model that represents interconnection networks. The model accepts as inputs the network load consisting of the network topology, routing, and the communication p... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • SDH digital cross-connect traffic generation algorithm

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

    Synchronous digital hierarchy (SDH) customers require complex connections, and cross-connect manufacturers attempt to design switching architectures and algorithms-referred henceforth as cross-connect systems-that will meet these needs. However, the designs are constrained by physical and economic considerations. Thus, the manufacturers are forced to restrict the capabilities of their designs. Suc... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Simulation of ultra-large communication networks

    Publication Year: 1999, Page(s):112 - 119
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (108 KB)

    The steady growth in size and complexity of communication networks has necessitated corresponding advances in the underlying networking technologies including communication protocols. This multi-faceted growth has rendered analysis of today's ultra-large networks, a complex task. Simulations have been used to model and analyze communication networks. Complete models of the ultra-large networks nee... 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.
  • 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.
  • 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.
  • A generic framework for parallelization of network simulations

    Publication Year: 1999, Page(s):128 - 135
    Cited by:  Papers (41)
    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.
  • Model checking the secure electronic transaction (SET) protocol

    Publication Year: 1999, Page(s):358 - 364
    Cited by:  Papers (15)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (72 KB)

    We use model checking to establish five essential correctness properties of the secure electronic transaction (SET) protocol. SET has been developed jointly by Visa and MasterCard as a method to secure payment card transactions over open networks, and industrial interest in the protocol is high. Our main contributions are to firstly create a formal model of the protocol capturing the purchase requ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • 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.
  • 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.
  • 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.
  • Feature interaction as a satisfiability problem

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

    We present a formal model for the specification of telephone features by means of description logics. Our framework permits the formal definition of the basic telephone system as well as the specification of additional features (call waiting, call forwarding, etc.). Furthermore, by using standard reasoning tasks from description logics, the properties of features can be formally proved and interac... 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 (20)
    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.
  • TCP performance and buffer provisioning for Internet in wireless networks

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

    This paper addresses the performance of packet-based Internet data services over CDMA cellular/PCS wireless networks. Packet-based services are provided to bursty information sources modeled as on-off processes. For these services, transmission is discontinued at the end of data burst (on-period) as no information is generated during the unpredictable off-intervals. TCP (transmission control proto... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Modeling overhead in servers with transactional workloads

    Publication Year: 1999, Page(s):182 - 189
    Cited by:  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (84 KB)

    Our research focuses on reducing the computing time in large simulation models of client-server architectures by replacing server models by load dependent servers (LDSs), whose solution requires less computational effort. As these LDSs include overhead information, it is necessary to design a set of measurements for collecting overhead data. We are proposing a methodology that indicates how to red... View full abstract»

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