• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.12 no.2
• /
• pp.148-159
• /
• 1987

This paper proposes CSMA/CD-TDM/SD(carrier sense multiple access/collision detection-time division multiplexing/silence detection) control scheme in bus type integrated data/voice local area networks. Simulation results show that this control scheme satisfies the lossless real-time constraints of the voice traffic and improves the data throughput-delay characteristics as compared to those of the CSMA/CD/MPD and the CSMA/CD-TDMA.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.1B
• /
• pp.29-40
• /
• 2004

In this paper, we propose a new early congestion detection and notification technique called QR-AQM. Unlike RED and it's variation, QR-AQM measures the total traffic rate from TCP sessions, predicts future network congestion, and determine the packet marking probability based on the measured traffic rate. By incorporating the traffic rate in the decision process of the packet marking probability, QR-AQM is capable of foreseeing future network congestion as well as terminating congestion resolution procedure in much more timely fashion than RED. As a result, simulation results show that QR-AQM maintains the buffer level within a fairly narrow range around a target buffer level that may be selected arbitrarily as a control parameter. Consequently, compared to RED and its variations, QR-AQM is expected to significantly reduce the jitter and delay variance of packets traveling through the buffer while achieving nearly identical link utilization.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.6
• /
• pp.1881-1900
• /
• 2014

Since 802.11 wireless LANs are so widely used, it has become common for numerous access points (APs) to overlap in a region, where most of those APs are managed individually without any coordinated control. This pattern of wireless LAN usage is called the private OBSS (Overlapping Basic Service Set) environment in this paper. Due to frame collisions across BSSs, each BSS in the private OBSS environment suffers severe performance degradation. This study approaches the problem from the perspective of congestion control rather than noise or collision resolution. The retry limit, one of the 802.11 attributes, could be used for traffic control in conjunction with TCP. Reducing the retry limit causes early discard of a frame, and it has a similar effect of random early drops at a router, well known in the research area of congestion control. It makes the shared link less crowded with frames, and then the benefit of fewer collisions surpasses the penalty of less strict error recovery. As a result, the network-wide performance improves and so does the performance of each BSS eventually. Reducing the retry limit also has positive effects of merging TCP ACKs and reducing HOL-like blocking time at the AP. Extensive experiments have validated the idea that in the OBSS environment, reducing the retry limit provides better performance, which is contrary to the common wisdom. Since our strategy is basically to sacrifice error recovery for congestion control, it could yield side-effects in an environment where the cost of error recovery is high. Therefore, to be useful in general network and traffic environments, adaptability is required. To prove the feasibility of the adaptive scheme, a simple method to dynamically adjust the value of the retry limit has been proposed. Experiments have shown that this approach could provide comparable performance in unfriendly environments.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.10A
• /
• pp.1131-1138
• /
• 2004

In Hierarchical Mobile Ipv6 (HMIPv6) networks, the mobility anchor point (MAP) handles binding update (BU) procedures locally to reduce signaling overhead for mobility. However, as the number of mobile nodes (MNs) handled by the MAP increases, the MAP suffers from the overhead not only to handle signaling traffic but also to Process data tunneling traffic. Therefore, it is important to control the number of MNs serviced by the MAP, in order to mitigate the burden of the MAP. We propose an adaptive load control scheme, which consists of two sub-algorithms: threshold-based admission control algorithm and session-to-mobility ratio (SMR) based replacement algorithm. When the number of MNs at a MAP reaches to the full capacity, the MAP replaces an existing MN at the MAP, whose SMR is high, with an MN that just requests binding update. The replaced MN is redirected to its home agent. We analyze the proposed load control scheme using the .Markov chain model in terms of the new MN and the ongoing MN blocking probabilities. Numerical results indicate that the above probabilities are lowered significantly compared to the threshold-based admission control alone.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.3 no.2 s.5
• /
• pp.29-40
• /
• 2004

The performance of the National Highway is raised, but the capacity of the signalized intersection on the National Highway is low. It's operated by TOD(Time Of Day) mode. To evaluate of the performance of COSMOS(Cycle, Offset, Split Model for Seoul), a real time traffic adaptive signal control system, on the National Highway, studied volume, travel time and queuing length at TOD control and TRC(Traffic responsive Control). Consequently, the average travel speed at TRC is high $2.9\~16.7$km/h then the average travel speed at TOD control. And te queuing length at TRC is low $15\~196m$ then the queuing length at TOD control.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.43 no.9 s.351
• /
• pp.135-141
• /
• 2006

In order to prevent traffic accident, it is very important that the driver regulates the location of rear view mirror using the automatic seat regulation system which guarantees the maximum vision of the possibility for accuracy. In order to solve this problem the paper deals with the automatic seat control system which guarantees comfortable and safe seating and good visual field. Also a automatic car seat control algorithm has been developed to regulate the back mirror. Particularly, the automatic seat control algorithm function for the air bag operation in case of an accident has been added depending on passengers weight. Moreover when the driver passes a dangerous area an algorithm has been developed which gives the driver a naming sign and has been simulated in a ubiquitous environment. The simulation result proved that the Intelligence analysis for traffic accidents can reduce franc accidents more than 25% than the currently existing methods.

• The KIPS Transactions:PartC
• /
• v.10C no.3
• /
• pp.311-316
• /
• 2003

To deploy multicast protocols, fairness to current Internet traffic, particularly TCP, is an important requirement. PGMCC is one of the most promising multicast congestion control proposals but it suffers from degradation of fairness by fixed timeout and uncertain acker selection. In this paper, we suggest addition of an adaptive timeout mechanism and NAK suppression in router using throughput comparison to improve fairness. Our simulation show improved fairness.

• Journal of Korean Society of Transportation
• /
• v.19 no.4
• /
• pp.109-121
• /
• 2001

본 연구는 공간적 정보를 수집할 수 있는 영상검지기를 이용하여 주어진 대기행렬길이를 기반으로 하는 최적주기 알고리즘을 개발함으로써 교통신호 제어에 대한 새로운 신호계획을 제공한다. 본 연구에서는 교통수요의 공간적인 정보를 획득하는 방안으로서 영상검지기 기반의 대기행렬길이를 사용한다. 전략적 측면에서 다양한 교통상태를 적용하였으며, 주요 결과는 아래와 같다. 1. 영상검지기 기반의 대기행렬길이 계산방안을 제안한다. 이 방법은 한 링크의 상류부와 하류부에 2대의 영상검지기를 설치하여 대기행렬길이를 산출하는 방안이다. 2. 신호제어 변수인 주기 계산모형이 개발된다. 이 방법 역시 영상검지기를 기반으로 하는 대기행렬길이를 사용한다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.8
• /
• pp.1958-1969
• /
• 1996

This paper proposed a new approach to adaptive call admission control based on a neural network for multiple service classes with different quality of service (QoS) in the ATM-based Broadband Integrated Services Digital Networks. the proposed method extend Hiramatsu's neural network based "leaky pattern table" method for the single QoS[1, 2, 3] to deal with multiple services with different QoS by constructing multiple pattern tables based on each service's acceptance or rejection at the call set-up requests, and by simultaneously controlling each service's QoS according to the target QoS of the service and the trunk capacity. Computer simulation results on two service classes with different traffic characteristics and different cell loss rates as QoS, highlight good performance and effectiveness of the proposed call admission controller for multiple service classes.e classes.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.2
• /
• pp.709-730
• /
• 2017

To address the challenge of unprecedented growth in mobile data traffic, ultra-dense network deployment is a cost efficient solution to offload the traffic over some small cells. The overlapped coverage areas of small cells create more than one candidate access points for one mobile user. Signal strength based user association in IEEE 802.11 results in a significantly unbalanced load distribution among access points. However, the effective bandwidth demand of each user actually differs vastly due to their different preferences for mobile applications. In this paper, we formulate a set of non-linear integer programming models for joint user association control and user demand guarantee problem. In this model, we are trying to maximize the system capacity and guarantee the effective bandwidth demand for each user by soft-association control with a software defined network controller. With the fact of NP-hard complexity of non-linear integer programming solver, we propose a Kernighan Lin Algorithm based graph-partitioning method for a large-scale network. Finally, we evaluated the performance of the proposed algorithm for the edge users with heterogeneous bandwidth demands and mobility scenarios. Simulation results show that the proposed adaptive soft-association control can achieve a better performance than the other two and improves the individual quality of user experience with a little price on system throughput.