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
  • 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
  • nem: a software for network topology analysis and modeling

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

    The design of network protocols is greatly accelerated by the use of simulators, particularly when studying a protocol's behavior in a large internetwork topology. However the accuracy of the simulation results are heavily affected by the input network topology. As taking a real map as an input is not always feasible, artificially created topologies are often used. There are many network topology ... 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.
  • 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.
  • Analyzing the short-term fairness of IEEE 802.11 in wireless multi-hop radio networks

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

    We extensively analyze the short (and long) term fairness performance of wireless ad hoc networks. Recently the fairness of the MAC layer of such systems has been studied. The primary goal of our study is to investigate how multi-hop routing in an ad hoc network affects the fairness of the MAC layer. We demonstrate that higher-level protocols must also be considered when studying fairness. We anal... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Cone clustering principles for parallel logic simulation

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

    Parallelization following the replicated worker principle can significantly accelerate functional logic simulation of microprocessor structures. Successful application of this method strongly depends on circuit model partitioning. We have developed a hierarchical partitioning strategy with prepartitioning and main partitioning as core phases that appear as bottom-up cone clustering. Cones can be s... 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.
  • WebTraff: a GUI for Web proxy cache workload modeling and analysis

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

    The paper describes an interactive graphical user interface (GUI) that can be used for the modeling and analysis of Web proxy workloads. The WebTraff GUI has three main components. First, the WebTraff tool provides a visual front-end to ProWGen, a Web proxy workload generation tool developed in prior work (see Busari, M. and Williamson, C., Computer Networks, vol.38, no.6, p.779-94, 2002), which c... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A simulation study of non-cooperative pricing strategies for circuit-switched optical networks

    Publication Year: 2002, Page(s):257 - 263
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (298 KB)

    We consider a non-cooperative community of users that share a number of circuit-switched optical channels. After specifying an example user utility function that corresponds to inelastic bandwidth requirements, we study numerically the existence and nature of Nash equilibrium point(s) reached by the users, for a fixed charge per circuit per unit time imposed by the network for each successfully tr... 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.
  • Analytical modeling of optical burst switching with fiber delay lines

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

    We develop a performance model for an optical burst switch employing fiber delay lines (FDLs) to enhance system performance. An M/M/k queueing model with balking is derived to predict the system behavior for both classless and prioritized traffic. Simple closed-form expressions are obtained for the burst loss probability of classless traffic. Using a conservation relation, the balking model is ext... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Energy-aware routing in cluster-based sensor networks

    Publication Year: 2002, Page(s):129 - 136
    Cited by:  Papers (177)  |  Patents (29)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (453 KB) | HTML iconHTML

    There has been a growing interest in the applications of sensor networks. Since sensors are generally constrained in on-board energy supply, efficient management of the network is crucial in extending the life of the sensor. We present a novel approach for energy-aware and context-aware routing of sensor data. The approach calls for network clustering and assigns a less-energy-constrained gateway ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Distributed simulation of dynamic channel access protocols

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

    We make use of time warp for the distributed simulation of a dynamic channel allocation scheme known as channel segregation. Channel segregation requires that signal strength computation be made continuously, imposing a heavy load on the simulation. We compare the performance of the channel segregation algorithm to a fixed channel allocation algorithm. The main objective of our experiments was 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.
  • 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.
  • 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 case study in performance, modifiability and extensibility analysis of a telecommunication system software architecture

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

    We present a case study in architecture analysis. The analysis was conducted on a real system, the Ericsson product "GSM On the Net", in order to evaluate two alternative software architectures with respect to a set of attributes required by the customer namely extensibility, performance and modifiability. The two architectures differ because of the use of different internal protocols, session ini... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Queueing analysis of delays in Bluetooth slave/slave bridge

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

    The performance of a Bluetooth scatternet with a slave/slave bridge is analyzed using queueing theory tools and through simulations. The exhaustive service discipline is found to provide lower values for all delay variables, over a wide range of parameter values. All analytical results have been confirmed through simulations. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Shaman: a distributed simulator for shared memory multiprocessors

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

    The paper describes Shaman, our distributed architectural simulator of shared memory multiprocessors (SMP). The simulator runs on a PC cluster that consists of multiple front-end nodes to simulate the instruction level behavior of a target multiprocessor in parallel and a back-end node to simulate the target memory system. The front-end also simulates the logical behavior of the shared memory usin... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A performance evaluation of a temporally correct and optimistic concurrency control protocol

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

    In this paper we focus on the temporary return of data values that are incorrect for given transactional semantics and could have catastrophic effects similar to those in parallel and discrete event simulation. In many applications using on-line transaction processing (OLTP) environments, for instance, it is best to delay the response to a transaction's read request until it is either known or unl... 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.
  • 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.