By Topic

Modeling, Analysis and Simulation of Computer and Telecommunications Systems, 2002. MASCOTS 2002. Proceedings. 10th IEEE International Symposium on

Date 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
    Save to Project icon | Request Permissions | PDF file iconPDF (357 KB)  
    Freely Available from IEEE
  • Author index

    Publication Year: 2002 , Page(s): 519 - 521
    Save to Project icon | Request Permissions | PDF file iconPDF (185 KB)  
    Freely Available from IEEE
  • 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)
    Save to Project icon | Request Permissions | 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.
  • WebTraff: a GUI for Web proxy cache workload modeling and analysis

    Publication Year: 2002 , Page(s): 356 - 363
    Cited by:  Papers (8)
    Save to Project icon | Request Permissions | 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.
  • An efficient routing algorithm for all-optical networks with turn constraints

    Publication Year: 2002 , Page(s): 161 - 166
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (268 KB) |  | HTML iconHTML  

    In all-optical networks, adjacent link constraints (known as turn constraints) can model existing restrictions in all-optical networks with limited wavelength converters and blocking optical switches. We present two different concrete implementations for a shortest path routing algorithm that accounts for link and turn constraints in all-optical networks. The efficiency of our new algorithm implem... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Modeling and evaluation of control flow prediction schemes using complete system simulation and Java workloads

    Publication Year: 2002 , Page(s): 391 - 400
    Cited by:  Papers (2)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (541 KB) |  | HTML iconHTML  

    Program control flow transfer (branch) prediction is considered to be a performance hurdle and a key design issue for current and future microprocessors. Branch prediction schemes with high prediction accuracy have been proposed to support longer processor pipelines with higher frequency clocks. In the previously published literature, the design and evaluation of branch predictors have been based ... 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
    Save to Project icon | Request Permissions | 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.
  • Cognitive packet networks: QoS and performance

    Publication Year: 2002 , Page(s): 3 - 9
    Cited by:  Papers (15)
    Save to Project icon | Request Permissions | 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.
  • nem: a software for network topology analysis and modeling

    Publication Year: 2002 , Page(s): 364 - 371
    Cited by:  Papers (8)
    Save to Project icon | Request Permissions | 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.
  • A new mechanism for supporting differentiated services in cluster-based network servers

    Publication Year: 2002 , Page(s): 427 - 432
    Cited by:  Papers (3)  |  Patents (1)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (295 KB) |  | HTML iconHTML  

    As the Web is becoming a medium widely used as a preferential channel for critical information exchange, business, and e-commerce, it is necessary to enable differentiated service (DiffServ) mechanisms not only at the network but also at the Web server level. We present a new service differentiation mechanism (arrival-related dynamic partitioning) for cluster-based network servers. We demonstrate ... 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 (10)
    Save to Project icon | Request Permissions | 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.
  • A self-sizing framework for adaptive resource allocation in label-switched networks

    Publication Year: 2002 , Page(s): 491 - 500
    Cited by:  Papers (3)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (323 KB) |  | HTML iconHTML  

    For adaptive resource allocation to maintain its crucial timing requirements in large-scale networks, fast analysis and synthesis algorithms are required in order to process freshly collected traffic data. In this paper we build on previous work to introduce a general measurement-based self-sizing framework for resource allocation in label-switched networks. Furthermore, we study the scaling behav... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Analysis of interference in a wireless link with frequency hopping

    Publication Year: 2002 , Page(s): 303 - 312
    Cited by:  Papers (5)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (321 KB) |  | HTML iconHTML  

    We analyze the effect of interference on traffic performance in a fixed wireless access system that uses frequency hopping (FH). The system consists of an access device that buffers traffic for transmission over N FH channels. The N FH channels are subject to random interference, hence characterized by different bit error rates (BERs). We show that, compared to a purely random FH, an adaptive FH t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • DFS: a de-fragmented file system

    Publication Year: 2002 , Page(s): 71 - 80
    Cited by:  Papers (3)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (336 KB) |  | HTML iconHTML  

    Small file accesses are still limited by disk head movement on modern disk drives with the high disk bandwidth. Small file performance can be improved by grouping and clustering, each of which places multiple files in a directory and places blocks of the same file on disks contiguously. These schemes make it possible for file systems to use large data transfers in accessing small files, reducing d... 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 (2)
    Save to Project icon | Request Permissions | 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.
  • An algorithmic and numerical approach to bound the performance of high speed networks

    Publication Year: 2002 , Page(s): 375 - 382
    Cited by:  Papers (2)
    Save to Project icon | Request Permissions | 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.
  • Workload characterization in Web caching hierarchies

    Publication Year: 2002 , Page(s): 13 - 22
    Cited by:  Papers (2)
    Save to Project icon | Request Permissions | 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.
  • Modified LC-trie based efficient routing lookup

    Publication Year: 2002 , Page(s): 177 - 182
    Cited by:  Papers (7)  |  Patents (2)
    Save to Project icon | Request Permissions | 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.
  • Power conservation strategies for MEMS-based storage devices

    Publication Year: 2002 , Page(s): 53 - 62
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | 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 (10)
    Save to Project icon | Request Permissions | 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.
  • You can run, but you can't hide: an effective methodology to traceback DDoS attackers

    Publication Year: 2002 , Page(s): 433 - 440
    Cited by:  Papers (2)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (366 KB) |  | HTML iconHTML  

    With the increase of sophistication and severity of DDoS (distributed denial of service) attack, it is important for a victim site to quickly identify the potential attackers and eliminate their traffic. Our work is based on the probabilistic marking algorithm by Savage et al. (2000) in which an attack graph can be constructed by a victim site. We extend the concept further such that we can deduce... 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)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (490 KB)  

    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.
  • Modeling and analysis of fast handoff algorithms for microcellular networks

    Publication Year: 2002 , Page(s): 321 - 328
    Cited by:  Papers (13)
    Save to Project icon | Request Permissions | 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.
  • Evaluation of gossip to build scalable and reliable multicast protocols

    Publication Year: 2002 , Page(s): 463 - 470
    Save to Project icon | Request Permissions | 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.
  • Studying sensitivities of an EJB performance model

    Publication Year: 2002 , Page(s): 277 - 280
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (303 KB) |  | HTML iconHTML  

    Often, at the time when a performance model is built, some of its input parameters are not known exactly. This can be for a variety of reasons, such as the system itself not having been completed, a benchmarking process not yet having been carried out, or that precise estimates for the parameters are very difficult to obtain. In these situations, interval values can be used to express the uncertai... View full abstract»

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