• The KIPS Transactions:PartA
• /
• v.9A no.4
• /
• pp.547-554
• /
• 2002

This paper proposes an efficient dynamic routing algorithm for Multistage Bus Networks(MBN's) in distributed shared memory environment. Our algorithm utilizes extra paths available on MBN and determines routing paths adaptively according to switch traffic in order to distribute traffic among switches. Precisely, a packet is transmitted to the next switch on an extra path having a lighter traffic. As a consequence the proposed algorithm reduces the mean response time and the average number of waiting tasks. The results of simulations, carried out with varying numbers of processors and varying switch sizes, show that the proposed algorithm improves the mean response time by 9% and the average number of waiting tasks by 21.6%, compared to the existing routing algorithms which do not consider extra paths on MBN.

• Journal of Internet Computing and Services
• /
• v.5 no.6
• /
• pp.11-20
• /
• 2004

Proportional Fair (PF) share policy has been adopted as a downlink scheduling scheme in CDMA2000 l×EV-DO standard. Although It offers optimal performance in aggregate throughput conditioned on equal time share among users, it cannot provide a bandwidth guarantee and a strict delay bound. which is essential requirements of real-time (RT) applications. In this study, we propose a new scheduling policy that provides quality-of-service (QoS) guarantees to a variety of traffic types demanding diverse service requirements. In our policy data traffic is categorized Into three classes, depending on sensitivity of Its performance to delay or throughput. And the primary components of our policy, namely, Proportional Fair (PF), Weighted Fair Queuing (WFQ), and delay-based prioritized scheme are intelligently combined to satisfy QoS requirements of each traffic type. In our policy all the traffic categories run on the PF policy as a basis. However the level of emphasis on each of those ingredient policies is changed in an adaptive manner by taking into account the channel conditions and QoS requirements. Such flexibility of our proposed policy leads to offering QoS guarantees effectively and. at the same time, maximizing the throughput. Simulations are used to verify the performance of the proposed scheduling policy. Experimental results show that our proposal can provide guaranteed throughput and maximum delay bound more efficiently compared to other policies.

• 전자공학회논문지 IE
• /
• v.45 no.1
• /
• pp.15-23
• /
• 2008

In this paper, an algorithm, that provisions absolute differentiation of packet delays is proposed, simulated, and implemented with VHDL on XPC 860 CPU based test board with an objective for enhancing quality of service (QoS) in future packet networks. It features a scheme that compensates the deviation for prediction on the traffic to be arrived continuously. It predicts the traffic to be arrived at the beginning of a time slot and measures the actual arrived traffic at the end of the time slot and derives the difference between them. The deviation is utilized to the delay control operation for the next time slot to offset it. As it compensates the prediction error continuously, it shows superior adaptability to the bursty traffic as well as the exponential traffic. It is demonstrated through both simulation and the real traffic test on the board that the algorithm meets the quantitative delay bounds and shows superiority to the traffic fluctuation in comparison with the conventional non-adaptive mechanism.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.26 no.11C
• /
• pp.33-42
• /
• 2001

We consider a model describing large scale performance of multiservice networks supporting both constant- and adaptive-rate services. As the number of constant-rate connection changes over time in multiservice networks, the available bandwidth for adaptive-rate connections changes as well. We estimate the available bandwidth for adaptive-rate service in a dynamically changing traffic environment based on Erlang fixed point equation and Little\`s law. The bandwidth allocation for adaptive-rate service is determined by the max-min fairness criterion. We find an upper bound on the average minimum throughput for adaptive-rate service, and 7how that the bound is achieved in large-capacity networks. This is verified using network examples. Since max-min fair allocation may not maximize the total throughput or revenue in a network, we consider adjustments via network level priority schemes to increase efficiency.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.4A
• /
• pp.451-463
• /
• 2000

In this paper, we design the radio data link protocols with QoS provisioning for mobile multimedia such as voice, data, and video in CDMA-based ATM networks, and analyze the performance of the data link protocols. To support mobile multimedia traffic, the required QoS parameters and the characteristics are analyzed, and wireless protocol stacks are proposed for integrating the wireless access network and ATM transport networks, and radio data link protocols are designed for provisioning QoS Control. The data link protocols are analyzed assuming that the system is supporting voice and data traffic simultaneously. In case of data traffic, the delay and throughput of SREJ ARQ and Type-1 Hybrid ARQ scheme are compared, and in case of voice traffic, the packet loss rate of BCH coding is analyzed according to the varying data traffic loads. The results indicate that the adaptive radio link protocols are efficient to support QoS requirements while the complexities are increased.

• Journal of Internet Computing and Services
• /
• v.11 no.4
• /
• pp.1-10
• /
• 2010

As recent fusion industry and ubiquitous technology have grown fast, network contents, which require high load, are provided in various infrastructures and facilities such as u-city and smart phones. Therefore, it is anticipated that the playback quality of multimedia compared to network loads degrades dramatically due to the drastic increment of real-time reference of conventional high load contents (eg. multimedia data). In this paper, we improved the method of the traffic assignment based on MPP which elevated the playback quality of multimedia by assigning discriminately the possible traffic of MMS with TP coefficients. When the TP coefficient which combines content preference with media preference was applied to a real-time traffic assignment scheduler, the simulation results showed that the multimedia playback stream was assigned within the possible traffic of a server. The real-time scheduling algorithm was improved by using the TP coefficient that combines the time-dependent image contents and the weighted value of media preference. It was observed from the experiment that the loss of the possible traffic decreases to 3.91% and 3.88% for three and four clients respectively.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.19 no.9
• /
• pp.2129-2137
• /
• 2015

Lots of research and development works have been actively focused on the self-driving vehicles, locally and globally. In order to implement the self-driving vehicles, lots of fundamental core technologies need to be successfully developed and, specially, it is noted that traffic lights detection and recognition system is an essential part of the computer vision technologies in the self-driving vehicles. Up to nowadays, most conventional algorithm for detecting and recognizing traffic lights are mainly based on the color signal analysis, but these approaches have limits on the performance improvements that can be achieved due to the color signal noises and environmental situations. In order to overcome the performance limits, this paper introduces the morphological analysis for the traffic lights recognition. That is, by considering the color component analysis and the shape analysis such as rectangles and circles simultaneously, the efficiency of the traffic lights recognitions can be greatly increased. Through several simulations, it is shown that the proposed method can highly improve the recognition rate as well as the mis-recognition rate.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2006.05a
• /
• pp.95-98
• /
• 2006

Data collected by sensors in field are transmitted to the base station gathering all of data. Because sensors have to gather data in surroundings and periodically transmit data to the base station, it makes energy consumed much. In this paper, we propose the scheme that is to avoid traffic congestion with achievement of energy efficiency, so collected data is transmitted efficiently. This is to adjust transmission rate differently in case of increasing or decreasing traffic and minimize the energy consumption with setting ideal options up basic CSMA(Carrier Sense Multiple Access) protocol in each sensor. Through the simulation, we find the ideal CSMA options and apply the proposed scheme of traffic control mechanism to them, then show energy efficiency and effective traffic control mechanism.

• Environmental Engineering Research
• /
• v.23 no.1
• /
• pp.107-113
• /
• 2018

Air quality and pollution have recently become a major concern; vehicle emissions significantly pollute the air, especially in large and crowded cities. There are various factors that affect vehicle emissions; this research aims to find the most influential factors affecting $CO_2$ and $NO_x$ emissions using Adaptive Neural Fuzzy Inference System (ANFIS) as well as a systematic approach. The modified ANFIS (MANFIS) was developed to enhance modelling and Root Mean Square Error was used to evaluate the model performance. The results show that percentages of $CO_2$ from trucks represent the best input combination to model. While for $NO_x$ modelling, the best pair combination is the vehicle delay and percentage of heavy trucks. However, the final MANFIS structure involves two inputs, three membership functions and nine rules. For $CO_2$ modelling the triangular membership function is the best, while for $NO_x$ the membership function is two-sided Gaussian.

• Journal of Institute of Control, Robotics and Systems
• /
• v.7 no.11
• /
• pp.962-966
• /
• 2001

The major problem at a branch point for point-to-multipoint available bit rate(ABR) services in asynchronous transfer mode (ATM) networks is how to consolidate backward resource management(BRM) cells from each branch for a multicast connection. In this paper, we propose an efficient feedback consolidation algorithm based on an adaptive dynamic threshold(ADT) to eliminate the consolidation noise and the reduce the consolidation delay. The main idea of the ADT algorithm lies in that each branch point estimates the ABR traffic condition of the network through the virtual queue estimation and the transmission threshold of the queue level in branch points is adaptively controlled according to the estimation. Simulation results show that the proposed ADT algorithm can achieve a faster response in congestion status and a higher link utilization compared with the previous works.