3,207 research outputs found

    Impact of topology on layer 2 switched QoS sensitive services

    Get PDF
    High-bandwidth QoS sensitive services such as large scale video surveillance generally depend on provisioned capacity delivered by circuit-switched technology such as SONET/SDH. Yet development in layer 2 protocol sets and manageability extensions to Ethernet standards propose layer 2 packet switching technology as a viable, cheaper alternative to SONET/SDH. Layer 2 switched networks traditionally offer more complex topologies; in this paper we explain general QoS issues with layer 2 switching and show the impact of topology choice on service performance

    Performance study of voice over frame relay : a thesis presented in partial fulfilment of the requirements for the degree of Master of Engineering in Information Engineering, Massey University, Albany, New Zealand

    Get PDF
    Frame Relay (FR) represents an important paradigm shift in modern telecommunication. This technology is beginning to evolve from data only application to broad spectrum of multimedia users and potential to provide end users with cost effective transport of voice traffic for intra office communication. In this project the recent development in voice communication over Frame relay is investigated. Simulations were carried out using OPNET, a powerful simulation software. Following the simulation model, a practical design of the LAN-to-LAN connectivity experiment was also done in the Net Lab. From the results of the simulation, Performance measures such as delay, jitter, and throughput are reported. It is evident from the results that real-time voice or video across a frame relay network can provide acceptable performance

    A logic-level simulation of the ATMSWITCH : a thesis presented in partial fulfilment of the requirements for the degree of Master of Science in Computer Science at Massey University

    Get PDF
    ATM networks are intended to provide a "one-size-fits-all" solution to a variety of data communication needs, from low speed, delay-insensitive to high-speed, delay-intolerant. The basic ATM protocol certainly delivers traffic within this broad range, but it does not address the quality of service requirements associated with the various type of traffic. The ATMSW1TCH is designed to use two different mechanisms to provide the quality of service for the various type of traffic. It treats the cells according to their connected virtual channel type and services them as predefined scheme. The ATMSWITCH architecture is a shared-memory and output buffer strategy switch. The switch has been designed much of buffer location and identification can occur in parallel with the 12ns read/write cycle time required to buffer the cell data. The problem is essentially one of design circuitry so that buffer location and identification are as short as possible. The present project has therefore been intended to measure the number of clock cycles required to perform the buffer maintenance activities, and to determine whether the logic speed required to fit this number of clock cycles into the 12ns window is feasible using current technology. The simulated result and timing analysis shows that 10 clock cycles are required during 12ns buffer read and write time, and a reasonable clock speed is 1.2ns per clock cycle

    Time Driven Priority Router Implementation and First Experiments

    Get PDF
    This paper reports on the implementation of Time-Driven Priority (TDP) scheduling on a FreeBSD platform. This work is part of a TDP prototyping and demonstration project aimed at showing the implications of TDP deployment in packet-switched networks, especially benefits for real-time applications. This paper focuses on practical aspects related to the implementation of the technology on a Personal Computer (PC)-based router and presents the experimental results obtained on a testbed network. The basic building blocks of a TDP router are described and implementation choices are discussed. The relevant results achieved and here presented can be categorized into two types: qualitative results, including the successful integration of all needed blocks and the insight obtained on the complexity related to the implementation of a TDP router, and quantitative ones, including measures of achievable network utilization and of jitter experienced on a fully-loaded TDP network. The outcome demonstrates the effectiveness of the presented implementation while confirming TDP points of strengt

    Integration Protocols for Voice and Data Traffic

    Get PDF
    Increasing demands for multimedia services offer integration of multimedia traffic as a hot issue in the future research areas. As a result, in the literature, many multiplexing schemes have been proposed. However, most of them have been implemented with a high complexity, others may be non-effective to satisfy the multiplexing performance criteria, while the rest are still not subjected to a wide range of analysis. Therefore, there is a critical need for comparing some of the recommended multiplexing schemes as well as developing a simple and effective integration protocol while still achieving reasonable bandwidth utilization. This thesis is intended to examine integration protocols for multimedia traffic, with primary focusing on voice-data integration. Firstly, a survey of the existing multiplexing schemes and related issues are presented. Next, an Adaptive Round Robin (ARR) protocol is proposed, as an alternative for voice-data integration, and extensively simulated. Finally, further comparisons, based on computer simulations, are carried out for various multiplexing schemes including Strictly Priority Servicing (SPS), Fixed Round Robin (FRR), Dynamic Bandwidth Allocation/(T1, T2) and Queue Length Threshold (QLT).As a contribution of the thesis, the proposed protocol tries to avoid the drawbacks of the previous multiplexing schemes besides satisfying the multiplexing performance criteria. The protocol differs from the others in that, it gives a limited priority for voice over data, it organizes the incoming packets to the single First-in First-out (FIFO) output buffer rather than the only outgoing scheduling, i.e., all data sources are polled in order according to the adaptation policy; however, before a data source can send a packet, all active voice sources are polled in order. Thus it provides an improvement in voice delay performance without significant effect on data delay performance over previous protocols. In addition, simulation comparisons between various multiplexing schemes have been discussed. In these simulations voice packets are assumed to be generated from on-off sources (talkspurt-silence calls), which is closer to reality and which is not considered in most of the performance analyses of previous schemes
    corecore