3,199 research outputs found

    Study of passenger-bus-traffic interactions on bus stop operations

    Get PDF
    Buses are the unsung heroes of public transport in modern cities around the world in high,medium and low income countries. However, the bus system is usually cobbled by poordesign which has resulted from poor understanding of how a busThis paper examines theimpacts of the interactions between buses, passengers and traffic on bus operations, especiallyin relation to delays and capacity at bus stops. First, the principles of bus stop operations arepresented. Issues like the stages of bus stop operations, the classification of times spent at busstops, causes of delays, and the interaction between bus flow and stop delays are analysed.This leads to the necessity of microscopic simulation to study stops operations. Then, anillustration of the sort of understanding that can be achieved with a simulation modem isshown. Simulation experiments regarding arrival patterns of buses and passengers, boardingtimes, difficulties for buses to leave the stop, and vehicle capacity are presented. Resultsindicate that it is important not to underestimate the real situation found at bus stops, asdesigning for ideal conditions will be insufficient if the reality is different

    Cost minimization for unstable concurrent products in multi-stage production line using queueing analysis

    Get PDF
    This research and resulting contribution are results of Assumption University of Thailand. The university partially supports financially the publication.Purpose: The paper copes with the queueing theory for evaluating a muti-stage production line process with concurrent goods. The intention of this article is to evaluate the efficiency of products assembly in the production line. Design/Methodology/Approach: To elevate the efficiency of the assembly line it is required to control the performance of individual stations. The arrival process of concurrent products is piled up before flowing to each station. All experiments are based on queueing network analysis. Findings: The performance analysis for unstable concurrent sub-items in the production line is discussed. The proposed analysis is based on the improvement of the total sub-production time by lessening the queue time in each station. Practical implications: The collected data are number of workers, incoming and outgoing sub-products, throughput rate, and individual station processing time. The front loading place unpacks product items into concurrent sub-items by an operator and automatically sorts them by RFID tag or bar code identifiers. Experiments of the work based on simulation are compared and validated with results from real approximation. Originality/Value: It is an alternative improvement to increase the efficiency of the operation in each station with minimum costs.peer-reviewe

    Characterizing and Managing Intrusion Detection System (IDS) Alerts with Multi-Server/Multi-Priority Queuing Theory

    Get PDF
    The DoD sets forth an objective to employ an active cyber defense capability to prevent intrusions onto DoD networks and systems. Intrusion Detection Systems (IDS) are a critical part of network defense architectures, but their alerts can be difficult to manage. This research applies Queuing Theory to the management of IDS alerts, seeking to answer how analysts and priority schemes effect alert processing performance. To characterize the effect of these two variables on queue wait times, a MATLAB simulation was developed to allow parametric analysis under two scenarios. The first varies the number of analysts and the second varies the number of alert priority levels. Results indicate that two analysts bring about drastic improvements (a 41% decrease) in queue wait times (from 116.1 to 49.8 minutes) compared to a single analyst, due to the reduced potential for bottlenecks, with diminishing returns thereafter. In the second scenario, it was found that three priority levels are sufficient to realize the benefits of prioritization, and that a five level priority scheme did not result in shorter wait queue times for Priority 1 alerts. Queuing models offer an effective approach to make IDS resource decisions in keeping with DoD goals for Active Cyber Defense

    A hybrid queueing model for fast broadband networking simulation

    Get PDF
    PhDThis research focuses on the investigation of a fast simulation method for broadband telecommunication networks, such as ATM networks and IP networks. As a result of this research, a hybrid simulation model is proposed, which combines the analytical modelling and event-driven simulation modelling to speeding up the overall simulation. The division between foreground and background traffic and the way of dealing with these different types of traffic to achieve improvement in simulation time is the major contribution reported in this thesis. Background traffic is present to ensure that proper buffering behaviour is included during the course of the simulation experiments, but only the foreground traffic of interest is simulated, unlike traditional simulation techniques. Foreground and background traffic are dealt with in a different way. To avoid the need for extra events on the event list, and the processing overhead, associated with the background traffic, the novel technique investigated in this research is to remove the background traffic completely, adjusting the service time of the queues for the background traffic to compensate (in most cases, the service time for the foreground traffic will increase). By removing the background traffic from the event-driven simulator the number of cell processing events dealt with is reduced drastically. Validation of this approach shows that, overall, the method works well, but the simulation using this method does have some differences compared with experimental results on a testbed. The reason for this is mainly because of the assumptions behind the analytical model that make the modelling tractable. Hence, the analytical model needs to be adjusted. This is done by having a neural network trained to learn the relationship between the input traffic parameters and the output difference between the proposed model and the testbed. Following this training, simulations can be run using the output of the neural network to adjust the analytical model for those particular traffic conditions. The approach is applied to cell scale and burst scale queueing to simulate an ATM switch, and it is also used to simulate an IP router. In all the applications, the method ensures a fast simulation as well as an accurate result

    A New CAC Method Using Queuing Theory

    Get PDF
    The CAC (Connection Admission Control) method plays an important role in the ATM (Asynchronous Transfer Mode) network environment. The CAC is the first step in the prevention of congested states in the network topology, and conducts to the optimal network resources utilization. The paper is aimed to propose an enhancement for a convolution method that is one of the statistical CAC methods used in ATM. The convolution method uses a buffer-less assumption in the estimation of the cell loss. Using formulas for the G/M/1 queuing system, the cell loss can be estimated as the buffer overflow probability. In this paper, the proposed CAC method is compared with other three statistical CAC methods, and conclusions regarding the exploitation of the CAC method are presente
    • 

    corecore