• Journal of KIISE:Computer Systems and Theory
• /
• v.26 no.6
• /
• pp.644-661
• /
• 1999

인터넷에서 통합서비스를 제공하기 위해서는 종단간 다양한 QoS를 지원해야 하는데 이를 위해서는 인터넷뿐 아니라 종단 사용자와 인터넷을 연결하는 랜에서의 QoS 지원이 필요하다. 이에, IETF는 특정 링크 계층으로 구성되는 서브넷에서 QoS 지원을 위한 기본 골격을 제안하였다. 그런데 , 매체 접근방식에 따라 서브넷이 제공할 수 있는 서비스의 정도가 크게 달라지기 때문에 실제로 IS802 모델을 특정서브넷에 구현하기 위해서는 이에 대한 고려가 필요하다. 본 논문에서는 통합서비스를 지원하기 위한 기반이 되는 서브넷 차원에서의 우선순위 지원을 목표로 IS802 모델을 전통적인 이더넷과 토큰링에 적용하여 보았다. 먼저, IS802 모델의 대역폭관리자를 적용한 이더넷 IS모델과 토큰링_IS 모델의 구현을 제안하고 특별히, 이더넷의 경우 매체 접근 방식의 특성상 IS802 모델의 적용만으로는 서브넷차원에서의 우선순위에 따른 전송을 지원할 수 없기 때문에 이를 보완하기 위한 페이즈 모델을 추가로 제안하였다. 시뮬레이션을 통해 기존의 전통적인 이더넷과 토큰링 및 새롭게 표준화된 IS802 모델을 적용한 이더넷 _IS와 토큰링 _IS, 그리고 페이즈 모델간의 성능을 비교하였다. 시뮬레이션결과 토큰링의 경우 단순한 입장 제어에 의해서도 QoS 지원 정도가 크게 향상될수 있음을 볼 수 있었다. 또한 , 페이즈 모델의 경우 이더넷의 매체 접근 방식을 상당히 보완함으로써 QoS 지원 정도가 크게 향상될 수 있음을 볼 수 있었다. 또한, 페이즈 모델의 경우 이더넷의 매체 접근 방식을 상당히 보완함으로써 QoS 지원을 요구하는 플로우에대해서는 전통적인 이더넷이나 이더넷_IS 비해 훨씬 안정적인 서브넷 차원의 우선순위지원 서비스를 제공할 수 있음을 확인할 수 있었다.제공하는 멀티미디어 동기화 편집기와 변환기 및 상영기를 ScriptX를 이용하여 Windows95 상에 구현하였다.기 위한 간단한 例를 들어 봄으로써 이 글을 쓰는 동기으 일면을 대신하고자 한다.置함으로 이것을 Multi-Drop(points) system으로 swiching System을 利用 Mini-Network을 構成할 수도 있다.크 구성 관리 서버 시스템 개발에 대한 비용을 줄일 수 있다. 기대된다.e 함량이 대체로 높게 나타났다. 점미가 수가용성분에서 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$사이의 아이에서 그 주산기사망률(周産基死亡率)이 각각 가장 낮았다. 2. 사산(死産)과 초생아사망(初生兒死亡)을 구분(區分)하여 고려해 볼때 사산(死産)은 모성(母性)의 임신력(姙娠歷)

• The Transactions of the Korea Information Processing Society
• /
• v.5 no.10
• /
• pp.2627-2640
• /
• 1998

In this paper, we analyze the performance of the virtual cell system[1] for the transmission of IP datagrams in mobile computer communications. A virtual cell consistsof a group of physical cells shose base stationsl are implemented b recote bridges and interconnected via high speed datagram packet switched networks. Host mobility is supported at the data link layer using the distributed hierachical location information of mobile hosts. Given mobility and communication ptems among physical cells, the problem of deploying virtual cells is equivalent to the optimization cost for the entire system where interclster communication is more expesive than intracluster communication[2]. Once an iptimal partitionof disjoint clusters is obtained, we deploy the virtual cell system according to the topology of the optimal partition such that each virtual cell correspods to a cluser. To analyze the performance of the virtual cell system, we adopt a BCMP open multipel class queueing network model. In addition to mobility and communication patterns, among physical cells, the topology of the virtual cell system is used to determine service transition probabilities of the queueing network model. With various system parameters, we conduct interesting sensitivity analyses to determine network design tradeoffs. The first application of the proposed model is to determine an adequate network bandwidth for base station networking such that the networks would not become an bottleneck. We also evaluate the network vlilization and system response time due to various types of messages. For instance, when the mobile hosts begin moving fast, the migration rate will be increased. This results of the performance analysis provide a good evidence in demonsratc the sysem effciency under different assumptions of mobility and communication patterns.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.18 no.1
• /
• pp.59-69
• /
• 2018

In this paper, we present a robust beamforming design to tackle the weighted sum-rate maximization (WSRM) problem in a multicell multiple-input multiple-output (MIMO) - non-orthogonal multipleaccess (NOMA) downlink system for 5G wireless communications. This work consider the imperfectchannel state information (CSI) at the base station (BS) by adding uncertainties to channel estimation matrices as the worst-case model i.e., singular value uncertainty model (SVUM). With this observation, the WSRM problem is formulated subject to the transmit power constraints at the BS. The objective problem is known as on-deterministic polynomial (NP) problem which is difficult to solve. We propose an robust beam forming design which establishes on majorization minimization (MM) technique to find the optimal transmit beam forming matrix, as well as efficiently solve the objective problem. In addition, we also propose a joint user clustering and power allocation (JUCPA) algorithm in which the best user pair is selected as a cluster to attain a higher sum-rate. Extensive numerical results are provided to show that the proposed robust beamforming design together with the proposed JUCPA algorithm significantly increases the performance in term of sum-rate as compared with the existing NOMA schemes and the conventional orthogonal multiple access (OMA) scheme.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.5B
• /
• pp.449-455
• /
• 2006

Due to advance in multimedia applications and integrated Internet services, the optical access networks have been actively studied. In particular, Ethernet passive optical network (EPON) has received much attention due to high bandwidth provision with low cost. In EPON system, the data transmission is carried out in two directions: downstream (from OLT to ONU) and upstream (from ONU to OLT). The downstream data is broadcasted to every ONUs, while the upstream data is point-to-point transmitted between each ONU and OLT, where the uplink is shared by all ONUs in the form of TDMA. The bandwidth allocation algorithm is required to efficiently manage the bandwidth on the uplink. The limited algorithm was proposed to enhance the capability of dynamic bandwidth allocation. In this paper, we propose the adaptive limited algorithm to enhance the shortcomings of limited algorithm. The adaptive limited algorithm enhances the dynamics on bandwidth allocation, and at the same time controls the fairness on packet delay. Through the computer simulations, it is shown that the adaptive limited algorithm achieves high dynamic on bandwidth allocation, maintains a good fairness on packet delay between ONUs, and keeps the fairness on the bandwidth on the demand basis.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.41 no.5
• /
• pp.555-564
• /
• 2016

This paper proposes a time slot allocation scheme for military patrol environments. This proposal comes from analysis of traffic properties in a military patrol environment. In the near future, robots are expected to explore enemy grounds and measure threat, taking the place of human patrol. In order to control such robots, control messages must be extremely accurate. One mistake from the control center could cause a tragedy. Thus, high reliability must be guaranteed. Another goal is to maintain a continual flow of multimedia data sent from patrol robots. That is, QoS (Quality of Service) must be guaranteed. In order to transmit data while fulfilling both attributes, the per-path based centralized TDMA slot allocation scheme is recommended. The control center allocates slots to robots allowing synchronization among robots. Slot allocation collisions can also be avoided. The proposed scheme was verified through the ns-3 simulator. The scheme showed a higher packet delivery ratio than the algorithm in comparison. It also performed with shorter delay time in the downlink traffic transmission scenario than the algorithm in comparison.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.10A
• /
• pp.1003-1013
• /
• 2006

There is a serious problem in an 802.11g VoWLAN (Voice over Wireless LAN) terminal that talk time is less than 30% compared with an 802.11b terminal. It is almost impossible to achieve talk time level of the 802.11b MAC transmission method because IEEE 802.11g uses OFDM modulation, which is a kind of multi-carrier method and OFDM transmission speed is 54 Mbps faster than normal modulation. In this paper, a new concept of a Holdover time as a power saving method during a call with 802.11g terminal is suggested for the first time. Increase in the number of engaged terminals as a result of holdover time causes to QoS problem because of the increase in the number of back-off and then contention window. In this paper, to solve the QoS problem, a new approach is suggested such that when in down lint the sequence number of 802.11 G.711 is analyzed in the MAC of the terminal and then the Hold over time depending on loss rate is changed. Also, consumption of an electric current of 802.11b/g and MAC parameter's performance due to busy traffic caused by increase in the number of terminal are analyzed and then real data using VQT and Airopeek are analyzed.

• Journal of KIISE:Information Networking
• /
• v.29 no.6
• /
• pp.722-737
• /
• 2002

As the number of multimedia applications increases, various protocols and architectures have been proposed to provide QoS(Quality of Service) guarantees in the Internet. Most of these techniques, though, bear inherent contradiction between the scalability and the capability of providing QoS guarantees. In this paper, we propose a protocol, named DQSP(Dynamic QoS Support Protocol), which provides the dynamic resource allocation and admission control for QoS guarantees in a scalable way. In DQSP, the core routers only maintain the per source-edge router resource allocation state information. Each of the source-edge routers maintains the usage information for the resources allocated to itself on each of the network links. Based on this information, the source edge routers perform admission control for the incoming flows. For the resource reservation and admission control, DQSP does not incur per flow signaling at the core network, and the amount of state information at the core routers depends on the scale of the topology instead of the number of user flows. Simulation results show that DQSP achieves efficient resource utilization without incurring the number of user flow related scalability problems as with IntServ, which is one of the representative architectures providing end-to-end QoS guarantees.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38A no.7
• /
• pp.612-622
• /
• 2013

In this paper, we propose a coding packet group-based ARQ scheme (rNC) for file delivery in wireless networks. rNC assumes multiple network coding points between the source and the destination. Each network coding point gathers and codes a group of packets according to the queue polling system. A queue polling system makes a few or several packets available for coding in a queue while polling the other queues in the system. Thus, we assuem a queue polling system at each network coding point. We call this group of packets as coded packet group. Each coding point acknowledges the reception of every code packet group to its previous coding point for reliable delivery. Thus, the intermediate coding points including the source can release its buffer before the packet is delivered to the destination. To guarantee the ultimate file delivery to the destination, the destination sends acknowledgement to the sender. We evaluate our proposed scheme using ns-2 and compare the performance with CodeCast. The results show that rNC works better than CodeCast in terms of packet delivery ratio and control overhead in unreliable wireless networks.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.3B
• /
• pp.112-122
• /
• 2008

Basing on Piconet, The Bluetooth System forms network and transmits data. There is one Master and maximum 7 Slave bluetooth devices in one piconet. A job scheduler performed by Master bluetooth device, gives the chance of data transmission to Slave bluetooth devices, which connected to Master, using polling method in piconet. The maximum data rate is 723.2 kb/s when it uses ACL link with DH5 packet type in a piconet which is constructed by two bluetooth devices. However, if there are one master and two slave devices in a piconet, then the maximum data rate is reduced to a half(361.6kb/s), because a master device has to support same data rate for all connected devices. And, there is the defect in scatternet when data transmission rate becomes low(Maximum rate: 302.2kb/s). This paper proposals the new ad-hoc network topology called "DoublePico"for overcome the low data transmission in scatternet which is constructed by piconets. The method of doublepico that represented in this paper makes high data transfer rate(Maximum rate: 457.57kb/s) in bluetooth ad-hoc networks.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.2B
• /
• pp.100-107
• /
• 2007

Recently, a study of BcN(Broadband convergence Network) is progressing continuously, and it is important to improve the quality of the service according to subscribers because a scale of network is about to be larger. It is more important to manage QoS(Quality of Service) of all subscribers in layer 2 than layer 3 network since managing it in layer 3 network cost both additional processes and large hardware. Moreover, QoS based on Best-Effort service has been developed because tots of subscribers should use limited resource in BcN. However, they want to be supplied with different service even though they pay more charge. Therefore, it is essential to assign the different bandwidth to subscribers depending on their level of charge. The method of current Rate Limiter limits the bandwidth of each port that does not offer fair service to subscribers. The Rate Limiter proposed in this paper limits bandwidth according to each subscriber. Therefore, subscribers can get fair service regardless of switch structure. This new Rate Limiter controls the bandwidth of subscribers according to the information of learning subscriber and manages maximum performance of Ethernet switch and QoS.