• 한국통신학회논문지
• /
• 제30권6A호
• /
• pp.474-480
• /
• 2005

본 논문에서는 MIMO OFDM (Multi Input Multi Output Orthogonal Frequency Division Multiplexing) 시스템에서 다중사용자 다이버시티 (Multiuser Diversity) 이득을 최적화함과 동시에 일부 사용자가 전송대역을 독점하는 현상을 방지하는 무선자원 스케쥴링 알고리즘을 제안한다. 제안된 알고리즘은 물리계층과 MAC (Media Access Control) 계층이 연동하는 형태의 시스템 구조를 기반으로 MIMO OFDM 수신단으로부터의 무선채널상태 궤환정보의 중복도 및 전송 큐(Queue) 크기를 동시에 고려하는 무선자원 분배 알고리즘이다. 모의 실험을 통하여 다중사용자 다이버시티 시스템을 위한 기존 스케쥴링 방식인 RR, K&H 방식과 성능을 비교 평가하였다.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2001년도 ICCAS
• /
• pp.180.3-180
• /
• 2001

In recent years, the remarkable development of communication network technology with the increasing demand of B-ISDN service helps the higg-speed ATM network to be applied a fully integrated global network. The considerable issue of high-speed communication network is a performance of service-link and stability of network queue. In this paper, we propose a feedback control algorithm and PID control method to improve the performance of service-link and stability of network queue and confirm upgraded traffic performance of the high-speed ATM network.

• Journal of the Korean Statistical Society
• /
• 제24권2호
• /
• pp.389-405
• /
• 1995

Output processes emanating from exit arcs in a mulitple server open Jackson network with node i having $s_i$ servers are determined. Beutler and Melamed (1978) showed, for traffics on all exit arcs of single server open Jackson network in equilibrium, that the customer streams leaving any exit set are Poisson and that the collections over all nodes which yield the Poisson departure processes are mutually independent. In this paper we generalize the above results to multiple servers open Jackson network in equilibrium. While no weak limit result is possible under the equilibrium condition, nonetheless approximations to the distributions of maximum queue lengths for no feedback nodes in multiple servers open Jackson network are established.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2007년도 제38회 하계학술대회
• /
• pp.1668-1669
• /
• 2007

In this paper, we propose nonlinear congestion controller for active queue management of differentiated-services networks. Two important issues in differentiated-services architecture are bandwidth guarantee and fair sharing of unsubscribed bandwidth among TCP flows with and without bandwidth reservation. The nonlinear congestion controller was composed fuzzy logic controller and state feedback controller. The nonlinear congestion controller methodology has been applied to a TCP network. We use NS-2 simulation to demonstrate that the proposed control methodology achieves the desired behavior of the network, and possesses important attributes.

• 산업경영시스템학회지
• /
• 제29권4호
• /
• pp.18-26
• /
• 2006

여러 형태의 고객이 외부로부터 포아송과정에 따라 각 대기행렬에 도착하고 정해진 서비스규칙에 따라 해당 서비스를 받은 후 마코비안 확률분포에 따라 시스템을 떠나거나 다른 형태의 고객으로 시스템을 다시 돌아 올 수도 있는 M/G/1 대기행렬시스템을 고려한다. 본 연구에서는 기존의 연구 모형을 확장하여 계층적 서비스 규칙을 갖는 우선순위 대기행렬모형을 제시하고 이에 대한 시스템 성능척도를 보다 체계적으로 구할 수 있는 방법을 소개한다. 이를 위하여 먼저 대기행렬시스템의 거동을 나타내는 시스템 상태를 정의하고, 바쁜기간과 서비스기간 분석을 통하여 시스템 상태의 선형 함수로 평균체제시간을 구할 수 있음을 보인다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제10권9호
• /
• pp.4342-4366
• /
• 2016

Congestion control in Cluster Wireless Sensor Networks (CWSNs) has drawn widespread attention and research interests. The increasing number of nodes and scale of networks cause more complex congestion control and management. Active Queue Management (AQM) is one of the major congestion control approaches in CWSNs, and Random Early Detection (RED) algorithm is commonly used to achieve high utilization in AQM. However, traditional RED algorithm depends exclusively on source-side control, which is insufficient to maintain efficiency and state stability. Specifically, when congestion occurs, deficiency of feedback will hinder the instability of the system. In this paper, we adopt the Additive-Increase Multiplicative-Decrease (AIMD) adjustment scheme and propose an improved RED algorithm by using neighbor feedback and scheduling scheme. The congestion control model is presented, which is a linear system with a non-linear feedback, and modeled by Lur'e type system. In the context of delayed Lur'e dynamical network, we adopt the concept of cluster synchronization and show that the congestion controlled system is able to achieve cluster synchronization. Sufficient conditions are derived by applying Lyapunov-Krasovskii functionals. Numerical examples are investigated to validate the effectiveness of the congestion control algorithm and the stability of the network.

• International Journal of Control, Automation, and Systems
• /
• 제4권1호
• /
• pp.53-62
• /
• 2006

In this paper, ATM network congestion control with explicit rate feedback is considered. In ATM networks, delays commonly appear in data transmission and have to be considered in congestion control design. In this paper, a bounded single round delay on the return path is considered. Our objective is to design an explicit rate feedback control that achieves a robust optimal $H_2$ performance regardless of the bounded time-varying delays. An optimization approach in terms of linear matrix inequalities (LMIs) is given. Saturation in source rate and queue buffer is also taken into consideration in the proposed design. Simulations for the cases of single source and multiple sources are presented to demonstrate the effectiveness of the design.

• 한국통신학회논문지
• /
• 제28권1C호
• /
• pp.9-13
• /
• 2003

We consider a two-phase queueing system with Bernoulli feedback. Customers arrive at the system according to a Poison process and receive batch service in the first phase followed by individual services in the second phase. Each customer who completes the individual service returns to the tail of the second phase service queue with probability 1 -$\sigma$. This type of queueing problem cad be easily found in computer and telecommunication systems. By deriving a relationship between the generating functions for system size at various embedded epochs, we obtain the system size distribution. The exhaustive and gated cases for the batch service are considered.

• 한국정보과학회논문지:정보통신
• /
• 제27권1호
• /
• pp.98-107
• /
• 2000

본 논문에서는 멀티캐스트 가용비트율 (Available Bit Rate: ABR) 서비스를 위해 현재 ATM 포럼 등을 통해 제안되고 있는 신속한 폭주 통지 (fast overload indication) 기능을 기존 피드백통합 알고리즘들에 적용하여 이들의 성능을 시뮬레이션을 통해 비교 분석하였다. 성능 분석의 지표로 송신원의 허용된 셀률 (Allowed Cell Rate: ACR), 스위치에서의 큐 길이, 링크 이용 효율, 공평성, 역방향 자원관리 셀 (Backward Resource Management: BRM) 셀의 오버헤드 등을 사용하였다. 분석 결과, 신속한 폭주 통지 기능이 추가된 피드백 통합 알고리즘들은 망에 심각한 폭주가 발생한 경우에 매우 효과적임을 알 수 있었다. 신속한 폭주 통지 기능은 기본적인 피드백 통합 알고리즘에 관계없이 쉽게 추가될 수 있는 반면에, 이러한 기능이 추가된 알고리즘들의 성능은 기본적인 피드백 통합 알고리즘들의 성능에 매우 의존적임을 알 수 있었다.

• 한국경영과학회지
• /
• 제11권1호
• /
• pp.7-11
• /
• 1986

Throughout this paper we analyze the system at output point t of two stage cyclic queueing model. Our main result characterize the stochastic process (X$^{o}$ , T$^{o}$ ), the system at output point, as a Markov renewal process. The subsequent lemma exhibits the semi-Markov kernel of (X$^{o}$ , T$^{o}$ ) with state dependent feedback, the possibility of a reducible state space arises. A simple necessary and sufficient condition for the irreducibility of (X$^{o}$ , T$^{o}$ was determinded. This irreducibility implied that (X$^{o}$ , T$^{o}$ ) was aperiodic.