• Journal of KIISE:Computer Systems and Theory
• /
• v.35 no.11
• /
• pp.527-539
• /
• 2008

This paper presents a performance estimation technique based on queuing analysis for on-chip bus matrix architectures of Multi-Processor System-on-Chips(MPSoCs). Previous works relying on time-consuming simulation are not able to explore the vast design space to cope with increasing time-to-market pressure. The proposed technique gives accurate estimation results while achieving faster estimation time than cycle -accurate simulation by order of magnitude. We consider the followings for the modeling of practical memory subsystem: (1) the service time with the general distribution instead of the exponential distribution and (2) multiple-outstanding transactions to achieve high performance. The experimental results show that the proposed analysis technique has the accuracy of 94% on average and much shorter runtime ($10^5$ times faster at least) compared to simulation for the various examples: the synthetic traces and real-time application, 4-channel DVR.

• Journal of Korean Society of Transportation
• /
• v.26 no.1
• /
• pp.15-24
• /
• 2008

Located in the middle of lanes, the station of a median exclusive bus lane generates pedestrian groups on the green light of a crosswalk and causes pedestrians delays passing the access section. For the purpose of showing these facts, the pedestrian analysis, on which the queuing theory is applied, is presented in this study. The Result is that the pedestrian environment was deteriorated (LOS D) compared to an exciting pedestrian analysis based on 15 minutes of pedestrian volume (LOS A). A pedestrian level of service has been reevaluated based on an arrival rate on the median bus station in order to examine whether the result reflects reality or not. In result, it was similar outcomes to this study.

• The Journal of Korean Institute of Next Generation Computing
• /
• v.15 no.4
• /
• pp.80-88
• /
• 2019

Software Defined Networking (SDN) is the future network paradigm of decoupling control and data functions. In SDN structure, it is hard to address scalability in case of large-scale networks because single controller managed thousands of switches in a centralized fashion. Most of previous studies have focused on horizontal scalability, where distributed controllers are assigned to network devices. However, they have abstracted the control plane and the application plane into a single controller. The layer of the common SDN architecture is divided into data plane, control plane, and application plane, but the control plane and application plane have been modeled as a single controller although they are logically separated. In this paper, we propose a analytical traffic model considering the both application plane and control plane based on queuing theory. This model can be used to address scalability issues such as controller placement problem without complicated simulations.

• Journal of Korean Society of Transportation
• /
• v.20 no.5
• /
• pp.113-130
• /
• 2002

In this paper, we developed DNL(Dynamic Network Loading) model based on Moving cell theory to analyze the dynamic characteristics of traffic flow in congested network. In this paper vehicles entered into link at same interval would construct one cell, and the cells moved according to Cell following rule. In the past researches relating to DNL model a continuous single link is separated into two sections such as running section and queuing section to describe physical queue so that various dynamic states generated in real link are only simplified by running and queuing state. However, the approach has some difficulties in simulating various dynamic flow characteristics. To overcome these problems, we present Moving cell theory which is developed by combining Car following theory and Lagrangian method mainly using for the analysis of air pollutants dispersion. In Moving cell theory platoons are represented by cells and each cell is processed by Cell following theory. This type of simulation model is firstly presented by Cremer et al(1999). However they did not develop merging and diverging model because their model was applied to basic freeway section. Moreover they set the number of vehicles which can be included in one cell in one interval so this formulation cant apply to signalized intersection in urban network. To solve these difficulties we develop new approach using Moving cell theory and simulate traffic flow dynamics continuously by movement and state transition of the cells. The developed model are played on simple network including merging and diverging section and it shows improved abilities to describe flow dynamics comparing past DNL models.

• The KIPS Transactions:PartC
• /
• v.8C no.1
• /
• pp.75-87
• /
• 2001

The Conditional Access System is the complete system for ensuring that broadcasting services are only accessible to those who are entitled to receive them. Four major parts to this system are scrambling, descrambling, authentication and encryption. For the proper operation, which means hard-to- break and uninterrupted service, secure key management and efficient delivery mechanism are very important design factors to this system. Performance analysis is another important factor to this system that is used in massive subscriber environment. In this thesis, one of the secure and efficient key management mechanisms is proposed. For the secrecy of this mechanism, hierarchical stacking of keys and key generation matrix are proposed. For the proof of efficient delivery of those keys, simulation results and performance analysis. which is based on queuing analysis, are presented. Lastly, optimal key generation and delivery period, maximal and minimal key deliver time, and communication capacity for data collection are presented for various subscriber volume.

• Journal of the Korea Society of Computer and Information
• /
• v.14 no.6
• /
• pp.11-16
• /
• 2009

The queuing theory was adopted by Erlang to predict the availability of telephone lines in 1917 and had not been used for computer system performance analysis until late 1960s when Scherr published a performance analysis of time-shared computer system. In 2000s, the explosive Internet usage and the development of IT technology made the business environment speed-centric and analysts should react swiftly to the ever-changing situation to satisfy the user requirement. It's tempting to solve the performance problem by purchasing new devices because the price of computers and peripherals are rapidly decreasing along with their increasing performance. But this scheme not only makes it difficult to understand the overall performance of the system but also wastes money. A coarse performance model that is gotten quickly is sometimes preferred to a complex and precise one that takes longer time to get. This paper examines an analytic model suggested by Menasce based on the measured data and suggests a simulation model using ARENA that takes a short time to build.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.5
• /
• pp.2499-2522
• /
• 2017

Multi-hop networks are a low-setup-cost solution for enlarging an area of network coverage through multi-hop routing. Carrier sense multiple access with collision avoidance (CSMA/CA) is frequently used in multi-hop networks. Multi-hop networks face multiple problems, such as a rise in contention for the medium, and packet loss under heavy-load, saturated conditions, which consumes more bandwidth due to re-transmissions. The number of re-transmissions carried out in a multi-hop network plays a major role in the achievable quality of service (QoS). This paper presents a statistical, analytical model for the end-to-end delay of contention-based medium access control (MAC) strategies. These strategies schedule a packet before performing the back-off contention for both differentiated heterogeneous data and homogeneous data under saturation conditions. The analytical model is an application of Markov chain theory and queuing theory. The M/M/1 model is used to derive access queue waiting times, and an absorbing Markov chain is used to determine the expected number of re-transmissions in a multi-hop scenario. This is then used to calculate the expected end-to-end delay. The prediction by the proposed model is compared to the simulation results, and shows close correlation for the different test cases with different arrival rates.

• JSTS:Journal of Semiconductor Technology and Science
• /
• v.4 no.4
• /
• pp.286-292
• /
• 2004

In this paper we present a static performance estimation technique of on-chip bus architectures. The proposed technique requires the static scheduling of function blocks of a task to analyze bus conflicts caused by simultaneous accesses from processing elements to which function blocks are mapped. To apply it to multitask applications, the concurrent execution of the function blocks of different tasks also should be considered. Since tasks are scheduled independently, considering all cases of concurrency in each processing element is impractical. Therefore we make an average estimate on the effects of other tasks with respect to bus request rate and bus access time. The proposed technique was incorporated with our exploration framework for on-chip bus architectures, Its viability and efficiency are validated by a preliminary example.

• IEIE Transactions on Smart Processing and Computing
• /
• v.1 no.1
• /
• pp.50-64
• /
• 2012

Quality of Service (QoS) and fairness considerations are undoubtedly essential parameters that need to be considered in the design of next generation scheduling algorithms. This work presents a novel game theoretic cross-layer design that offers optimal allocation of wireless resources to heterogeneous services in Orthogonal Frequency Division Multiple Access (OFDMA) networks. The method is based on the Axioms of the Symmetric Nash Bargaining Solution (S-NBS) concept used in cooperative game theory that provides Pareto optimality and symmetrically fair resource distribution. The proposed strategies are determined via convex optimization based on a new solution methodology and by the transformation of the subcarrier indexes by means of time-sharing. Simulation comparisons to relevant schemes in the literature show that the proposed design can be successfully employed to typify ideal resource allocation for next-generation broadband wireless systems by providing enhanced performance in terms of queuing delay, fairness provisions, QoS support, and power consumption, as well as a comparable total throughput.

• Water for future
• /
• v.12 no.1
• /
• pp.60-71
• /
• 1979

In general, the lock structure is built at place of having great deal range for dealing with effective ships operation such as in the west coast of Korea. In Inchon harbour, the two locks of 10 KT and 50 KT tonnage class in total has been constructed for several years age, however, it has been recorded many waiting vessels at outer harbour due to the increment of oceangoing vessels & shortage of berthing facilities in accordance with beyond expectation of cargo amount increment. This paper attempts to solves the waiting vessels problem at outer harbour by simulation in applying queing theory. It is found that the simulation results such as average queue time, service time, and queue length during lock operation can be applied to find the minimum of the cost function for determination of optimum Lock Size