• 한국정보과학회논문지:정보통신
• /
• 제29권2호
• /
• pp.181-187
• /
• 2002

Connection admission control(CAC), which decides whether or not to accept a new call request, is one of the most Important preventive congestion control techniques in asynchronous transfer mode(ATM) networks. To develop a practical CAC scheme, first we propose a "Modified Cell Loss Probability MP${\nu}"$, which is based on "Virtual Cell Loss Probability P${\nu}"$, taking into account mean burst duration of input traffic source and buffer size in ATM networks. MP${\nu}"$ computes more accurate cell loss probability than P${\nu}"$ without increasing computational complexity, since P${\nu}"$ is formulated simply form the maximum and the average cell rate of input traffic. P${\nu}"$ is overestimated as compared to the real cell loss probability when the mean burst duration is relatively small to the buffer capacity. Then, we Propose a CAC scheme, based on "Modified Virtual Bandwidth(MVB)" method, which may individualize the cell loss probabilities in heterogeneous traffic environments. For the proposed approach, we define the interference intensity to identify interferences between heterogeneous traffic sources and use it as well as MP${\nu}"$ to compute MVB. Our approach is well suitable for ATM networks since it provides high bandwidth utilization and guarantees simple and real time CAC computation for heterogeneous traffic environments.heterogeneous traffic environments.

• ETRI Journal
• /
• 제28권1호
• /
• pp.77-83
• /
• 2006

In order to improve the accuracy of cell selection in heterogeneous cellular systems, this paper proposes a fuzzy multiple-objective decision-based cell selection (FMDCS) strategy. Since heterogeneous cellular systems have different access technologies and multiple traffic classes, the strategy adopts cell type, data rate, coverage, transmission delay, and call arrival rate as evaluation indices, and uses different weight vectors according to the traffic classes of the mobile host. Then, a fuzzy multiple-objective decision algorithm is applied to select the optimal cell from all candidates. This paper also gives an instance analysis and simulation. The instance analysis shows FMDCS makes different selections for different traffic classes. Simulation results of the after-handoff quality-of-service (QoS) show the selected cell can provide MH optimal service.

• 인터넷정보학회논문지
• /
• 제22권5호
• /
• pp.9-16
• /
• 2021

Recently, the traffic volume of mobile communications increases rapidly and the small-cell is one of the solutions using two offload schemes, i.e., local IP access (LIPA) and selected IP traffic offload (SIPTO), to reduce the end-to-end delay and amount of mobile data traffic in the core network (CN). However, 3GPP describes the concept of LIPA and SIPTO and there is no decision algorithm to decide the path from source nodes (SNs) to destination nodes (DNs). Therefore, this paper proposes a dynamic mobile data traffic offload scheme using small-cells to decide the path based on the SN and DN, i.e., macro user equipment, small-cell user equipment (SUE), and multimedia server, and type of the mobile data traffic for the real-time and non-real-time. Through analytical models, it is shown that the proposed offload scheme outperforms the conventional small-cell network in terms of the delay of end-to-end mobile data communications and probability of the mobile data traffic in the CN for the heterogeneous networks.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제9권10호
• /
• pp.3789-3809
• /
• 2015

In this paper, we deal with the problem of M2M gateways' network selection for different types of M2M traffic in heterogeneous wireless networks. Based on the difference in traffic's quality of service (QoS) requirements, the M2M traffic produced by various applications is mainly classified as two categories: flexible traffic and rigid traffic. Then, game theory is adopted to solve the problem of network-channel selection with the coexistence of flexible and rigid traffic, named as flexible network access (FNA). We prove the formulated discrete game is a potential game. The existence and feasibility of the Nash equilibrium (NE) of the proposed game are also analyzed. Then, an iterative algorithm based on optimal reaction criterion and a distributed algorithm with limited feedback based on learning automata are presented to obtain the NE of the proposed game. In simulations, the proposed iterative algorithm can achieve a near optimal sum utility of whole network with low complexity compared to the exhaustive search. In addition, the simulation results show that our proposed algorithms outperform existing methods in terms of sum utility and load balance.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제10권7호
• /
• pp.3171-3191
• /
• 2016

Due to growing demand on wireless data traffic, a large number of different types of base stations (BSs) have been installed. However, space-time dependent wireless data traffic densities can result in a significant number of idle BSs, which implies the waste of power resources. To deal with this problem, we propose an active state control algorithm based on semi-Markov decision process (SMDP) for a heterogeneous network. A MDP in discrete time domain is formulated from continuous domain with some approximation. Suboptimal on-line learning algorithm with a random policy is proposed to solve the problem. We explicitly include coverage constraint so that active cells can provide the same signal to noise ratio (SNR) coverage with a targeted outage rate. Simulation results verify that the proposed algorithm properly controls the active state depending on traffic densities without increasing the number of handovers excessively while providing average user perceived rate (UPR) in a more power efficient way than a conventional algorithm.

• Journal of Communications and Networks
• /
• 제4권3호
• /
• pp.199-208
• /
• 2002

The downlink rate scheduling problem is considered for CDMA networks with multiple users carrying packets of heterogeneous traffic (voice/audio only, bursty data only or mixed traffic), with each type having its own distinct quality of service requirements. Several rate scheduling algorithms are developed, the common factor of which is that part of the decision on which users to serve is based on a function of the deadline of their head-ofline packets. An approach of Andrews et al., in which the basic Earliest-Deadline-First algorithm is studied for similar systems, is extended to result in better performance by considering a more efficient power usage and by allowing service of more than one user per timeslot if the power resources permit it. Finally, the performance of the proposed schemes is compared through simulations.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제12권11호
• /
• pp.5449-5464
• /
• 2018

Recent works have validated the possibility of reducing the energy consumption in wireless heterogeneous networks, achieved by switching on/off some base stations (BSs) dynamically. In this paper, to realize energy conservation, the discrete time Markov Decision Process (DTMDP) is developed to match up the BS switching operations with the traffic load variations. Then, an asynchronous decision-making algorithm, which is based on the Bellman equation and the on/off priorities of the BSs, is firstly put forward and proved to be optimal in this paper. Through reducing the state and action space during one decision, the proposed asynchronous algorithm can avoid the "curse of dimensionality" occurred in DTMDP frequently. Finally, numerical simulations are conducted to validate the effectiveness and advantages of the proposed asynchronous on/off strategies.

• 대한토목학회논문집
• /
• 제42권1호
• /
• pp.67-74
• /
• 2022

최근 높은 스마트폰 보급율과 ITS (intelligent transportation systems) 인프라 확충 등 정보통신기술(information and communications technology, ICT) 이용 활성화로 실시간 교통정보의 수집원이 증가하였다. 이렇게 다양하게 수집되는 실시간 교통정보의 정확도는 VDS(vehicle detection system), DSRC (dedicated short-range communications), GPS (global positioning system) probe와 같은 다양한 교통정보 수집원별 시공간 혹은 교통상황 등 다양한 환경에 따라 다르게 나타날 수 있다. 본 연구의 목적은 이질적 교통정보가 동시에 수집될 경우, 실시간 교통정보의 정확도를 향상시키기 위한 융합 전략의 제시에 있다. 이를 위해 고속국도(892.2 km, 227개 링크), 일반국도(937.0 km, 2,074개 링크)를 대상으로 주행 조사를 실시하였으며, 해당 링크 및 시간대에 probe 차량 5대의 평균 통행속도는 실시간 교통정보 수집원별(VDS or DSRC, GPS-based A, B) 정확도 평가의 기준 혹은 참값으로 활용되었다. 결과적으로 제시된 융합 전략에 대한 정확도 개선 효과는 일반국도에서 1개 수집원을 제외하고 모두 통계적으로 유의한 것으로 나타났으며, 향후 다양한 기관으로부터 서비스되는 실시간 교통정보가 동시에 연계되는 환경에서 보다 정확한 교통정보 서비스의 가능성을 확인하였다.

• 한국통신학회논문지
• /
• 제19권11호
• /
• pp.2215-2227
• /
• 1994

단일 교환기로 다양한 유형을 효율적으로 지원할 수 잇는 멀티캐스트 교환기는 광대역 종합망의 성공적인 확산에 필요 불가결한 요소이다. 본 논문에서는 멀티캐스트 교환기에서 이질적 트래픽이 혼합된 환경을 가정하고 회선 에뮬레이션 트래픽의 성능을 분석하였다. 기존의 연구에서, 모든 호가 동일한 fan-out을 갖는 동질 트래픽 환경에서 fan out이 증가함에 따라 호 불통률이 급격히 증가하는 것이 관찰되었다. 본 논문에서는 fan-out이 서로 다른 호가 혼합된 이질 트래픽 환경에서는 fan-out에 따른 호 불통률 차이가 동절 트래픽 경우보다 오히려 증가하는 결과를 도출하였다. 이 결과는 멀티캐스트 교환기에서 멀티캐스트 호의 성능을 향상시키기 위한 효율적인 자원 할당 알고리듬을 사용해야 한다는 것을 지적하고 있다. 본 논문에서는 멀티캐스트 교환기의 성능을 향상시킬 수 있는 몇가지 방안을 제시하였다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제10권8호
• /
• pp.3753-3771
• /
• 2016

Increasingly, numerous and various Internet-capable devices are connected in end user networks, such as a home network. Most devices use the combination of TCP and 802.11 DCF as a system platform, but whereas some devices such as a streaming video persistently generate traffic, others such as a motion sensor do so only intermittently with lots of pauses. This study addresses the issue of performance in this heterogeneous traffic wireless LAN environment from the perspective of fairness. First, instantaneous fairness is introduced as a notion to indicate how immediately and how closely a user obtains its fair share, and a new time-based metric is defined as an index. Second, extensive simulation experiments have been made with TCP Reno, Vegas, and Westwood to determine how each TCP congestion control corresponds to the instantaneous fairness. Overall, TCP Vegas yields the best instantaneous fairness because it keeps the queue length shorter than the other TCPs. In the simulations, about 60% of a fair share of the effective user bandwidth is immediately usable in any circumstance. Finally, we introduce two simple strategies for adjusting TCP congestion controls to enhance instantaneous fairness and validate them through simulation experiments.