• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.48 no.4
• /
• pp.84-91
• /
• 2011

Recently, WBAN(Wireless Body Area Network) which has progressed standardization based on IEEE 802.15.6 standardization is a network for the purpose of the short-range wireless communications within around 3 meters from the inner or outer human body. Effective QoS control technique and data efficient management in limited bandwidth such as audio and video are important elements in terms of users and loads in short-range wireless networks. In this paper, for high-speed WBAN IEEE 802.15.6 standard, the dynamic allocation to give an efficient bandwidth management and weighted fair queueing algorithm have been proposed through the adjustment of the super-frame about limited data and Quality of Service (QoS) based on the queuing algorithm. Weighted Fair Queueing(WFQ) Algorithm represents the robust performance about elements to qualitative aspects as well as maintaining fairness and maximization of system performance. The performance results show that the dynamic allocation expanded transmission bandwidth five times and the weighted fair queueing increased maximum 24.3 % throughput and also resolved delay bound problem.

• Proceedings of the Korean Information Science Society Conference
• /
• 2001.10c
• /
• pp.202-204
• /
• 2001

가상 세계의 공유 개념은, 특히 사용자들이 인터넷 같이 대규모 네트웍을 통해 지역적으로 분산된 경우는 복제가 수용할 수 있는 상호작용 성능을 제공하기 때문에 각 사용자의 사이트에 정보를 복제함으로써 확장된다. 그러나, 다수의 동시 갱신은 replicas간의 일관되지 않은 뷰를 일으키게 될 것이다. 따라서, 동시성 제어가 복제자들간에 일관된 상태를 유지하도록 하기 위한 중요한 요소가 된다. 우리는 단지 대상 객체의 주변에 있는 사용자들만이 소유권 요청을 다중 전송하게 하는 확장성 있는 예측기반 동시성 제어 스킴을 제안했었다. 이 작업에서, 우리는 모든 사용자들이 동일한 속도론 가지고 가상 세계를 이동한다고 가정했다. 이것은, 그러나, 좀더 사실성을 더하기 위해 사용자가 가상 세계와 상호작용을 할 매 그들의 이동속도를 변경하도록 하는 네트웍 게임같은 네트웍 가상 환경에서는 너무 common 하다. 본 논문은 다양한 속도를 가진 사자를 지원하기 위한 확장을 제안한다. 확장된 스킴은 다른 속도의 수만큼의 다중 Entity Radii를 가지며 각 속도를 가진 사용자에게 분리된 큐를 할당한다. 각 큐는 다음 소유자 후보를 예측하기 위해 동시에 예측을 수행하고 선택된 후보들간에서 최소의 Predicted Collision Time을 가지는 최종 후보자가 선택된다. 이는 사용자의 속도에 기반을 둔 적절한 Entity Radius를 사용함으로써 소유권의 timely advanced transfer과, 다른 이돔 속도와 latency를 가지는 사용자들 간의 간섭을 줄임으로써 공정(공평)한 소유권 양도, 그리고 불필요한 소유권 전송을 줄임으로써 놓은 예측 정확도를 제공한다.성을 지닌 AMMQL 학습법은 로봇축구와 같이 끊임없이 실시간적으로 변화가 일어나는 다중 에이전트 환경에서 특히 높은 효과를 볼 수 있다. 본 논문에서는 AMMQL 학습방법의 개념을 소개하고, 로봇축구 에이전트의 동적 위치 결정을 위한 학습에 어떻게 이 학습방법을 적용할 수 있는지 세부 설계를 제시한다.다.으로서 hemicellulose구조가 polyuronic acid의 형태인 것으로 사료된다. 추출획분의 구성단당은 여러 곡물연구의 보고와 유사하게 glucose, arabinose, xylose 함량이 대체로 높게 나타났다. 점미가 수가용성분에서 goucose대비 용출함량이 고르게 나타나는 경향을 보였고 흑미는 알칼리가용분에서 glucose가 상당량(0.68%) 포함되고 있음을 보여주었고 arabinose(0.68%), xylose(0.05%)도 다른 종류에 비해서 다량 함유한 것으로 나타났다. 흑미는 총식이섬유 함량이 높고 pectic substances, hemicellulose, uronic acid 함량이 높아서 콜레스테롤 저하 등의 효과가 기대되며 고섬유식품으로서 조리 특성 연구가 필요한 것으로 사료된다.리하였다. 얻어진 소견(所見)은 다음과 같았다. 1. 모년령(母年齡), 임신회수(姙娠回數), 임신기간(姙娠其間), 출산시체중등(出産時體重等)의 제요인(諸要因)은 주산기사망(周産基死亡)에 대(對)하여 통계적(統計的)으로 유의(有意)한 영향을 미치고 있어 $25{\sim}29$세(歲)의 연령군에서, 2번째 임신과 2번째의 출산에서 그리고 만삭의 임신 기간에, 출산시체중(出産時體重) $3.50{\sim}3.99kg$사이의 아

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.2 no.3
• /
• pp.379-388
• /
• 1998

In this paper we propose a DMR-II shared-medium access control protocol which was developed for the ATM access network users to support isochronous and non-isochronous traffics simultaneously under the bandwidth sharing environment, and describe its architecture and operation principles. The DMR-II protocol uses the slotted-ring topology, and gives the higher transmission priority to the isochronous traffic than the non-isochronous traffic. To support the isochronous traffic it uses the slot reservation mechanism, and maintains the delay variation of the isochronous traffic beyond the threshold value by using the blocking mechanism whenever the total user traffic overflows the network's bandwidth limitation. for the non-isochronous traffic the DMR-II protocol lets all the nodes to have fair transmission chances by using the reset mechanism based on the window counter scheme.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.3B
• /
• pp.168-174
• /
• 2007

All of users who connect to mobile game want to play seamless real-time game without any loads on game servers. However, as for existing methods, it is not available to effectively distribute server loads. Therefore, in this paper, we design and implement an uniform variance-based load balancer for distributing loads of game servers for wireless online games by suitable load balancing methods. With this methods, we can deal with dynamically increasing game servers as the information about load balancing of specific period is applied to the administrator.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.8C
• /
• pp.617-626
• /
• 2008

Opportunistic Beamforming (OBF) offers a way to provide the multiuser diversity even in slow fading channel by using randomly generated beam weights, leading to the substantially reduced feedback in the form of the instantaneous SNR from users. In spite of the advantage of the reduced feedback, the imperfect channel estimation might influence the quality of the estimated SNR and channel scheduler so bad that the selected AMC level would be higher than the achievable rate of the actual channel, resulting the corruption of transmitted packet. In this paper, we propose a conservative link adaptation, where the estimated SNR is scaled down by a conservative factor which minimizes the variance of the maximum difference between the actual channel SNR and the resultant SNR. To support the proposed scheme, we analyze the statistics of the difference of the channel SNR and the estimated SNR. Simulation results show that the introduction of conservative factor achieves more than two-fold performance improvement in the presence of channel estimation error and the fairness of PF scheduler is maintained when the least squared channel estimator is applied.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.10A
• /
• pp.896-905
• /
• 2005

In this paper, we propose a SPD(Selective Packet Delay) scheme to improve the performance of High-Speed Downlink Shared Channel(HS-DSCH) employing N-Channel Stop and Wait retransmission scheme in High Speed Downlink Packet Access(HSDPA) system. The proposed SPD coordinates packet transmissions according to the channel condition. When the channel condition is bad, packet transmission is forcedly delayed, and the designated time slot is set over to other users in good channel condition. Hence, the SPD is able to reduce the average transmission delay for packet transmission under the burst error environments. In addition, we propose two packet scheduling schemes called SPD-LDPF(Long Delayed Packet First) and SPD-DCRR(Deficit Compensated Round Robin) that are effectively combined with the SPD scheme. Simulation results show that the proposed scheme has better performance in terms of delay, throughput and fairness.

• Journal of KIISE:Computer Systems and Theory
• /
• v.30 no.5_6
• /
• pp.223-231
• /
• 2003

Video-on-Demand (VOD) service needs high resource consumption because of high bandwidth and long playback duration which are characteristics of multimedia. Various techniques such as Patching and Channel-Reserving Patching have been proposed to reduce the demand on the network-I/O bandwidth. Patching allows new clients to join an existing multicast for realization of true VOD, and Channel-Reserving Patching reserves the part of total channel capacity of video server in order to serve the requests for popular videos on which requests of users concentrate. To improve the performance of Channel-Reserving Patching, we propose the method that determines the reserved channel capacity of video server for the popular videos in this paper. The performance of our method is evaluated in terms of average servile latency, defection ratio and fairness through simulation, and is compared with those of Patching and another Channel-Reserving Patching.

• Journal of KIISE:Computer Systems and Theory
• /
• v.30 no.10
• /
• pp.523-532
• /
• 2003

Video on Demand(VOD) services cause high resource consumption in a video seuer, because multimedia are characterized by continuous playback, a high bandwidth requirement, and long playback duration. Patching has been proposed to save the network I/O bandwidth of a video server. To achieve true VOD, patching uses multicasting to share video streams, thereby providing immediate VOD services to users without any service latency. A communication channel is used to either multicast the entire video as a regular channel or multicast only the leading portion of a video as a Patching channel. This paper Proposes a buffering patching technique that divides regular channels, as used in patching, into sub-regular channels and regular channels to shorten the holding time of the channels. In the proposed technique, the last portion of video data, corresponding to the size of the buffering window, is not transferred by sub-regular channels, but rather downloaded and buffered in the user buffer from the latest regular channel. When simulations were performed to compare the performance of the proposed technique with that of conventional patching, the results indicated that the proposed technique was superior in terms of the defection rate, average service latency, and fairness, although the amount of video data buffered at each user station was higher than that with patching.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.42 no.12
• /
• pp.149-158
• /
• 2005

This paper proposes a congestion avoidance algorithm which provides stable throughput and transmission rate regardless of buffer size by limiting the TCP congestion window in fixed bandwidth networks. Additive Increase, Multiplicative Decrease (AIMD) is the most commonly used congestion control algorithm. But, the AIMD-based TCP congestion control method causes unnecessary packet losses and retransmissions from the congestion window increment for available bandwidth verification when used in fixed bandwidth networks. In addition, the saw tooth variation of TCP throughput is inappropriate to be adopted for the applications that require low bandwidth variation. We present an algorithm in which congestion window can be limited under appropriate circumstances to avoid congestion losses while still addressing fairness issues. The maximum congestion window is determined from delay information to avoid queueing at the bottleneck node, hence stabilizes the throughput and the transmission rate of the connection without buffer and window control process. Simulations have performed to verify compatibility, steady state throughput, steady state packet loss count, and the variance of congestion window. The proposed algorithm can be easily adopted to the sender and is easy to deploy avoiding changes in network routers and user programs. The proposed algorithm can be applied to enhance the performance of the high-speed access network which is one of the fixed bandwidth networks.

• The KIPS Transactions:PartC
• /
• v.8C no.1
• /
• pp.51-59
• /
• 2001

In order to support various QoS, IETF has proposed the Differentiated Services Model which provides discrimination service according to t the user’s requirements and payment intention intention for each traffic characteristic. This model is an excellent mechanism, which is not too c complicated in terms of the management for service and network model. Also, it has scalability that satisfies the requirement of Differentiated Services. In this paper, We define the Differentiated Services Model using feedback control, propose its control procedure, and analyze its p performance. In conventional model, non-adaptive traffic, such as UDP traffic, is more occupied the network resource than adaptive traffic, such a as TCP traffic. On the other hand, the Differentiated Services Model using feedback control fairly utlizes the network resources and even p prevents congestion occurrence due to its ability of congestion expectation.