By Topic

Modeling, Analysis and Simulation of Computer and Telecommunication Systems, 2001. Proceedings. Ninth International Symposium on

Date 15-18 Aug. 2001

Filter Results

Displaying Results 1 - 25 of 51
  • MASCOTS 2001, Proceedings Ninth International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems

    Publication Year: 2001
    Request permission for commercial reuse | PDF file iconPDF (235 KB)
    Freely Available from IEEE
  • Author index

    Publication Year: 2001, Page(s):431 - 432
    Request permission for commercial reuse | PDF file iconPDF (77 KB)
    Freely Available from IEEE
  • Performance of finite field arithmetic in an elliptic curve cryptosystem

    Publication Year: 2001, Page(s):249 - 256
    Cited by:  Papers (4)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (752 KB) | HTML iconHTML

    The computational cost of encryption is a barrier to wider application of a variety of data security protocols. Virtually all research on elliptic curve cryptography (ECC) provides evidence to suggest that ECC can provide a family of encryption algorithms that require fewer computational resources for implementation than do current widely used methods. This efficiency is obtained since ECC allows ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Tuning of the Checkpointing and Communication Library for optimistic simulation on Myrinet based NOWs

    Publication Year: 2001, Page(s):241 - 248
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (824 KB) | HTML iconHTML

    Recently a Checkpointing and Communication Library (CCL) for optimistic simulation on Myrinet based network of workstations (NOWs) has been presented. CCL offloads checkpoint operations from the CPU by charging them to a programmable DMA engine on the Myrinet network card. CCL includes also functionalities for freezing the simulation application on demand, which can be used for data consistency ma... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performing file prediction with a program-based successor model

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

    Increases in CPU performance have surpassed those in hard drives. As a result, disk operations have become more expensive in terms of the number of CPU cycles spent waiting for them to complete. File prediction can mitigate this problem by prefetching files into cache before they are accessed. Identifying relationships between individual files plays a key role in successfully performing file prefe... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Plain end-to-end measurement for local area network voice transmission feasibility

    Publication Year: 2001, Page(s):235 - 240
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (448 KB) | HTML iconHTML

    It is well known that company Intranets are growing into ubiquitous communications media for everything. As a consequence, network traffic is notoriously dynamic, and unpredictable. Unfortunately, local area networks were designed for scalability and robustness, not for sophisticated traffic monitoring. This paper introduces a performance measurement method based on widely used IP protocol element... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Minimizing routing state for light-weight network simulation

    Publication Year: 2001, Page(s):108 - 116
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (768 KB) | HTML iconHTML

    We introduce a routing mechanism, referred to as algorithmic routing. It is a viable routing alternative for network simulations with minimal space complexity-O(N). In theory and for simulations the size of the Internet, algorithmic routing has the potential of reducing memory requirements by several orders of magnitude. In practice and through ns-2 simulations on random topologies, we find memory... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A modular, analytical throughput model for modern disk arrays

    Publication Year: 2001, Page(s):183 - 192
    Cited by:  Papers (23)  |  Patents (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (768 KB) | HTML iconHTML

    Enterprise storage systems depend on disk arrays for their capacity and availability needs. To design and maintain storage systems that efficiently satisfy evolving requirements, it is critical to be able to evaluate configuration alternatives without having to physically implement them. In this paper, we describe an analytical model to predict disk array throughput, based on a hierarchical decomp... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Analysis of timeout-based adaptive wormhole routing

    Publication Year: 2001, Page(s):275 - 282
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (640 KB) | HTML iconHTML

    Although many adaptive routing algorithms have been proposed for wormhole-routed networks, it is necessary to have a clear understanding of the factors that affect their potential performance before they can be widely adopted in commercial multicomputers. This paper proposes a new analytical model of an adaptive routing algorithm proposed by Duato (see Future Generation Computer Systems vol.10, no... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Generalized processor sharing with long-range dependent traffic input

    Publication Year: 2001, Page(s):224 - 231
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (544 KB) | HTML iconHTML

    We develop an upper bound on the individual session queue length of long range dependent (LRD) traffic under the generalized processor sharing (GPS) scheduling discipline. This work is based on the analysis of the arrival process of LRD traffic, which is demonstrated to be a Weibull bounded burstiness (WBB) process. Decomposing the GPS system into isolated queues and servers, we are able to obtain... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance study of a multipath routing method for wireless mobile ad hoc networks

    Publication Year: 2001, Page(s):99 - 107
    Cited by:  Papers (20)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (712 KB) | HTML iconHTML

    A Mobile Ad hoc NETwork (MANET) is a collection of wireless mobile computers forming a temporary network without any existing wire line infrastructure. Due to the dynamic nature of the network topology and the resource constraints, routing in MANETs is a challenging task. Multipath routing can increase end-to-end throughput and provide load balancing in wired networks. However, its advantage is no... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Traffic engineering label switched paths in IP networks using a pre-planned flow optimization model

    Publication Year: 2001, Page(s):70 - 77
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (536 KB) | HTML iconHTML

    We present a flow optimization model for IP networks where end-to-end paths are identified for each ingress-egress pair in the MPLS-capable part of the network. The model computes link- and path flows by incrementally distributing the offered traffic among the paths. Fault-tolerance and congestion control are achieved by spreading the offered traffic over a set of active paths. A set of back-up pa... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Effect of event orderings on memory requirement in parallel simulation

    Publication Year: 2001, Page(s):41 - 48
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (560 KB) | HTML iconHTML

    A new formal approach based on partial order set (poset) theory is proposed to analyze the space requirement of discrete-event parallel simulation. We divide the memory required by a simulation problem into memory to model the states of the real-world system, memory to maintain a list of future event occurrences, and memory required to implement the event synchronization protocol. We establish the... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Large-scale simulation of replica placement algorithms for a serverless distributed file system

    Publication Year: 2001, Page(s):311 - 319
    Cited by:  Papers (16)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (912 KB) | HTML iconHTML

    Farsite is a scalable, distributed file system that logically functions as a centralized file server but that is physically implemented on a set of client desktop computers. Farsite provides high degrees of reliability and availability by storing replicas of files on multiple machines. Replicas are placed to maximize the effective system availability, using a distributed, iterative, randomized pla... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Low-cost performance prediction of data-dependent data parallel programs

    Publication Year: 2001, Page(s):173 - 182
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (640 KB) | HTML iconHTML

    Current analytic solutions to the execution time distribution of an N-ary parallel composition of tasks having independent and identically distributed execution times are computationally complex, except for a limited number of distributions. In this paper we introduce an analytical solution based on approximating the execution time distributions in terms of a limited number of statistical moments.... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Service guarantees in deflection networks

    Publication Year: 2001, Page(s):267 - 274
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (824 KB) | HTML iconHTML

    We propose a mechanism for providing long term quality of service in deflection networks. Our proposed protocol is in fact a call admission control (CAC) scheme based on session probing combined with a feedback technique that allows a station originating a new session to notify other stations about its bandwidth requirements. This CAC scheme works in an environment in which there are no explicit c... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • How does TCP generate pseudo-self-similarity?

    Publication Year: 2001, Page(s):215 - 223
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (808 KB) | HTML iconHTML

    Long-range dependence has been observed in many recent Internet traffic measurements. In addition, some recent studies have shown that under certain network conditions, TCP itself can produce traffic that exhibits dependence over limited timescales, even in the absence of higher-level variability. In this paper, we use a simple Markovian model to argue that when the loss rate is relatively high, T... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Stability analysis on active queue management algorithms in routers

    Publication Year: 2001, Page(s):125 - 132
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (520 KB) | HTML iconHTML

    Numerous works have complained the sensitivity to network load and instability of random early detection (RED), an active queue management (AQM) scheme, under various network configurations. In this work, we focus on our investigation on the stability of AQM in routers. By modeling the close-looped congestion control systems in a differential fluid flow model, we reach the sufficient and necessary... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • MoSync: A synchronization scheme for cellular wireless and mobile multimedia systems

    Publication Year: 2001, Page(s):89 - 96
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (680 KB) | HTML iconHTML

    The advances in mobile computing and distributed multimedia systems allow mobile hosts (clients) to access wireless multimedia systems anywhere at anytime, but not without creating a new set of issues and trade-offs. To the best of our knowledge, there has been very little research done to deal with the synchronization problem in wireless and mobile multimedia systems. We propose an efficient dist... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimal resource assignment in Internet data centers

    Publication Year: 2001, Page(s):61 - 69
    Cited by:  Papers (4)  |  Patents (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (680 KB) | HTML iconHTML

    This paper presents a resource model that describes the computing and networking components in a resource sharing environment in an Internet Data Center (IDC), a model for multi-tier applications that need to be deployed in this environment, and an optimization problem for resource assignment aimed at minimizing the communication delay between the servers. A number of techniques are introduced to ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multi-resolution network simulations using dynamic component substitution

    Publication Year: 2001, Page(s):142 - 149
    Cited by:  Papers (5)  |  Patents (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (696 KB) | HTML iconHTML

    Modeling and simulation of large, high resolution network models is a time consuming task even when parallel simulation techniques are employed. Processing voluminous, detailed simulation data further increases the complexity of analysis. Consequently, the models (or parts of the models) are abstracted to improve performance of the simulations by trading-off model details and fidelity. However abs... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An evaluation of grouping techniques for state dissemination in networked multi-user games

    Publication Year: 2001, Page(s):33 - 40
    Cited by:  Papers (7)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (592 KB) | HTML iconHTML

    In a distributed multi-user game, entities need to communicate their state information to other entities. Usually only a subset of the game's entities are interested in information being disseminated by any particular entity. In a large scale distributed game, broadcasting messages containing each information to all participants and applying a relevance filter at the end host is wasteful in both n... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A bit-parallel search algorithm for allocating free space

    Publication Year: 2001, Page(s):302 - 310
    Cited by:  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (848 KB) | HTML iconHTML

    File systems that allocate data contiguously often use bitmaps to represent and manage free space. Increases in the size of storage to be managed creates a need for efficient algorithms for searching these bitmaps. We present an algorithm that exploits bit-parallelism, examining all bits within a processor word at the same time, to improve search performance. Measurements of our implementation sho... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance analysis of pools in soft real-time design architectures

    Publication Year: 2001, Page(s):15 - 22
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (608 KB) | HTML iconHTML

    Architectures for the design of soft real-time systems typically do not facilitate the use of performance tools that will enable a designer to analyse the performance of the system that is being designed. Intercommunication data areas, whose behaviours are characterised by interaction protocols, are the building blocks of many soft real-time systems. The interaction protocols are grouped into fami... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Design-why we don't do it right

    Publication Year: 2001
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (30 KB)

    Summary form only given, as follows. The design process is discussed as it is done today and the author shows through examples why we do not do it correctly. The place for simulation in the design process is emphasized and how it is not applied very well, consistently, or enough throughout the design process is highlighted View full abstract»

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