• The Transactions of the Korean Institute of Electrical Engineers
• /
• v.43 no.5
• /
• pp.861-865
• /
• 1994

By using Neural Networks, a 8$\times$8 Banyan network controller is designed and implemented. In order to solve internal blocking and output blocking, Winner-Take-All method is used. The longer queue takes higher priority. First-in-first-out method is used among the non-blocking cells in the queue selected.The required time to select a cell is 2.7 $\mu$sec for 155Mbps. The implemented controller using Xilinx FPGA chip selects cells within 2.5$\mu$sec.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 1996.10a
• /
• pp.180-183
• /
• 1996

This work discusses simulation results for the fuzzy logic controller tested the project“Fuzzy Ramp Metering Algorithm Implementation.”The performance objectives were, in order of priority, to maximize total vehicle-miles, maximize mainline speeds, and minimize delay per vehicle while maintaining an acceptable ramp queue. In the fuzzy logic controller, the sensors from the on-ramps were helpful in maintaining reasonable ramp queue and mainline congestion because it considered these factors simultaneously. Each metered ramp had a parameter input file, which allowed the controller to be modified without recompiling the software. Consequently, maintenance costs should be minimal.

• Journal of Communications and Networks
• /
• v.16 no.2
• /
• pp.193-201
• /
• 2014

In cognitive radio networks, the packet transmissions of the secondary users (SUs) can be interrupted randomly by the primary users (PUs). That is to say, the PU packets have preemptive priority over the SU packets. In order to enhance the quality of service (QoS) for the SUs, we propose a spectrum access strategy with an ${\alpha}$-Retry policy. A buffer is deployed for the SU packets. An interrupted SU packet will return to the buffer with probability ${\alpha}$ for later retrial, or leave the system with probability (1-${\alpha}$). For mathematical analysis, we build a preemptive priority queue and model the spectrum access strategy with an ${\alpha}$-Retry policy as a two-dimensional discrete-time Markov chain (DTMC).We give the transition probability matrix of the Markov chain and obtain the steady-state distribution. Accordingly, we derive the formulas for the blocked rate, the forced dropping rate, the throughput and the average delay of the SU packets. With numerical results, we show the influence of the retrial probability for the strategy proposed in this paper on different performance measures. Finally, based on the trade-off between different performance measures, we construct a cost function and optimize the retrial probabilities with respect to different system parameters by employing an iterative algorithm.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.35 no.4
• /
• pp.162-170
• /
• 2012

We propose a new priority discipline called the strict T-preemptive priority discipline, and derive the waiting time distributions of each class in the strict T-preemptive priority M/G/1 queue. Using this queueing analysis, we evaluate the performance of an opportunistic spectrum access in cognitive radio networks, where a communication channel is divided into time slots, a licensed primary user is assigned to one channel, and multiple unlicensed secondary users may opportunistically exploit time slots unused by the primary user. We also present a numerical example of the analysis of the opportunistic spectrum access where the arrival rates and service times distributions of each users are identical.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.11 no.2
• /
• pp.77-82
• /
• 2012

To share the lanes with conventional vehicles, traffic operation strategy is needed for NEV (Neighborhood Electric Vehicle). Because NEV cannot accelerate sharply as fast as common car include gasoline, diesel and LPG cars, they may interrupt traffic conditions and make traffic delay. After green lights turn on, all vehicles run through the street including NEV, but NEV have a maximum speed which is 50km/h. It can be an obstacle for following vehicles and will make traffic delay of the intersection. In this reason, we need to organize traffic systems like queue jump with priority traffic signal. To analyze the necessity for NEV road operations, we simulate three scenarios in congested and non-congested conditions. First is that we examine the condition which is mixed NEV and cars on the road, the second one is that we set up lane only NEV can accepted in simulation and last one is making queue jump lane and providing priority signal for NEV. In conclusion, we can conclude that making lane only for NEV is effective to improve travel speed when rate of NEVs is over 20%. Also queue jump lane and priority signal cannot make good effect to intersection delay and average speed.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.33 no.2
• /
• pp.115-135
• /
• 2008

An interesting problem in capacitated supply chains is how to guarantee customer service levels with limited resources. One of the common approaches to solve the problem is differentiating service depending on customer classes. High-priority customers receive a better service at the cost of low-priority customers' service level. One of common criteria to determine a customer's priority in practice is whether he has made a reservation before arrival or not. Customers with a reservation usually receive service based on the time the reservation was made. We examine the effect this advance information of customer arrival has on customer service levels. We show the trade-offs between the leadtime and other system characteristics such as the proportion of high-priority customers. when the service level is high. We also suggest how to differentiate service using the asymptotic ratio of the service levels for both types of customers.

• Communications of the Korean Mathematical Society
• /
• v.11 no.2
• /
• pp.481-493
• /
• 1996

We consider a retrial queue with two classes of customers where arrivals of class 1(resp. class 2) customers are MMPP and Poisson process, respectively. In the case taht arriving customers are blocked due to the channel being busy, the class 1 customers are queued in priority group and are served as soon as the channel is free, whereas the class 2 customers enter the retrial group in order to try service again after a random amount of time. We consider the following retrial rate control policy, which reduces their retrial rate as more customers join the retrial group; their retrial times are inversely proportional to the number of customers in the retrial group. We find the joint generating function of the numbers of custormers in the two groups by the supplementary variable method.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.31A no.6
• /
• pp.9-17
• /
• 1994

ATM (Asynchronous Transfer Mode) has a fixed-length packet transport scheme. It is one of the promising proposals in B-ISDN.Since the packet length is fixed, it can be potentially to perform the various service to users. In this paper, a queueing model for an ATM multip`exer loaded by CBR and ON/OFF input sources is considered, and the two-queue system which each type of input sources has a queue with a finite capacity is analyzed. The cell loss probabilities for a performance measures of ATM multiplexer are derived, and are also evaluated through numerical examples. As a result, the cell loss probability of ON/OFF sources for the queue size is rapidly decreased when the multiplexed number and burstiness are increased. Since cells of the CBR source have lower priority than cells of the ON/OFF source, cell loss probabilities of CBR sources are accordingly high independently of CBR cell arrival rate when the number of CBR sources is large.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.9A
• /
• pp.762-771
• /
• 2005

In this paper, an efficient Adaptive quality-of-service (QoS) traffic control scheme with priority scheduling is proposed for the multimedia traffic transmission over wireless access networks. The objective of the proposed adaptive QoS control (AQC) scheme is to realize end-to-end QoS, to be scalable without the excess signaling process, and to adapt dynamically to the network traffic state according to traffic flow characteristics. Here, the reservation scheme can be used over the wireless access network in order to get the per-flow guarantees necessary for implementation of some kinds of multimedia applications. The AQC model is based on both differentiated service model with different lier hop behaviors and priority scheduling one. It consists of several various routers, access points, and bandwidth broker and adopts the IEEE 802.1 le wireless radio technique for wireless access interface. The AQC scheme includes queue management and packet scheduler to transmit class-based packets with different per hop behaviors (PHBs). Simulation results demonstrate effectiveness of the proposed AQC scheme.

• Journal of the Institute of Electronics Engineers of Korea SC
• /
• v.45 no.2
• /
• pp.55-60
• /
• 2008

Packet-switched wavelength division multiplexing (WDM) ring networks have been extensively studied as solutions to the increasing amount of traffic in metropolitan area networks, which is widely expected to be a mix of unicast and multicast traffic. In this paper we study the fairness between unicasting and multicasting in slotted packet-switched WDM ring networks that employ a tunable transmitter and fixed tuned receiver at each node and a posteriori buffer selection. We find that single-step longest queue selection algorithm generally results in unfairness between unicasting and multicasting or a lilted relative priority for multicast vs. unicast traffic. We present the various virtual output queue structures and their performance.