• Proceedings of the KIEE Conference
• /
• 2006.07d
• /
• pp.1828-1829
• /
• 2006

In this paper, we propose sliding mode congestion controller for differentiated-services network. Two important issue in differentiated-services architecture are bandwidth guarantee and fair sharing of unsubscribed bandwidth among TCP flows with and without bandwidth reservation. We use tight upper and lower bounds for various settings of differentiated-services parameters using the loss-bounded model. The Sliding mode congestion controller scheme is designed using nonlinear control theory based on a nonlinear model of the network that is generated using fluid flow consideration. The methodology used is general and independent of technology, as for example TCP/IP or ATM. The sliding mode congestion controller methodology has been applied to an 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. as e.g, stable and robust behavior, high utilization with bounded delay and loss, together with good steady-state and transient behavior.

• The KIPS Transactions:PartC
• /
• v.10C no.2
• /
• pp.179-184
• /
• 2003

One of the remarkable problems in PIM-DM (Protocol Independent Multicast - Dense Mode) is the join latency time, increasing for specific periods. The reason of this problem is proved to the confusion of flooding prune message and leave prune message. We propose a new solution to this problem, reducing the average join latency by 37.4%, and prove the proposed solution by network simulation.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.10 no.4
• /
• pp.151-156
• /
• 2010

In this paper, several computer simulations are investigated to confirm the DVB-H system performance and to find proper single frequency network cell coverage. From the result, we confirm that 2K mode transmission is more robust to Doppler frequency than 8K mode. The result of this paper can be partially applied to the design the single frequency network.

• TTA Journal
• /
• s.84
• /
• pp.146-161
• /
• 2002

TTA(한국정보통신기술협회)는 2002년 10월 8일 (주)이스텔시스템즈(www.eastelsystems.com)의 ATM(asynchronous transfer mode) Router (모델명 : EAR-155)에 대하여 성능 및 aging 시험을 수행하여 국내 최초 TTA Verified 인증서(번호: TTA-V-02-001)를 발급하였다. 본 고에서는 두 대의 EAR-155 ATM Routers를 이용하여 각 라우터의 확장 slot에 Fast Ethernet port, ATM OC3(155 Mbps) port, ATM DS3(44.736 Mbps) port, ATM E1(2.048 Mbps) port 및 TDM E1(2.048 Mbps) port를 장착하여 back-to-back으로 연결한 환경에 대한 no-loss UDP throughput 시험결과를 소개한다.

• Journal of Korean Library and Information Science Society
• /
• v.53 no.2
• /
• pp.241-264
• /
• 2022

The Studies related to the Gwangju Student Movement which occurred in 1929 have been diversified on research topics since 2018. A number of studies have been conducted on the process of spreading the Gwangju Student Movement abroad. However, those studies show limitations in terms of difficulty in discovering new historical materials and the absence of research methods. Therefore, the researchers have analyzed the process of spreading Gwangju Student Movement abroad as the process of spreading information based on library and information science. The researchers have newly discovered Chinese newspaper records at that times and conducted 2-mode network analysis. The results are as follows: first, 125 Chinese newspaper records were discovered from 16 kinds of newspapers and 104 articles of them were newly discovered; second, the researcher found that there were earlier articles than the first claimed by previous researchers in their studies; third, Newspapers in Beijing, Sacheon, Shanghai, Tianjin, and Honam regions in China mainly reported the first and second joint demonstrations in Seoul and Gwangju. The significance of this study is to expand and diversify the research on the Gwangju Student Movement through network analysis.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.10 no.2
• /
• pp.157-171
• /
• 2014

A organization of social enterprises is to achieve various goals such as private interests, the public nature, and social policy. For fulfilling these goals, we have to understand the various success factors. These success factors were shared among peoples. This study explored a position of structure of social network formed by success factors of Social Enterprises with importance. A position within social network defined a number of link connected other nodes. A position is closely associated with to individual's behaviors, opinions and thinking. We used social network analysis with two mode method for explaining feathers of structure of social network formed by success factors shared among peoples. We choose degree centrality for determining a position within social network. Centrality is a key measure in social network analysis. Results is that shared success factors are operation capital(15.15%) totally, and by Buying experience of products of Social Enterprises, Business Compliance(14.39%) and planning(12.88%), and by usage time of smart devices, Business Support(17.05%) and planning(16.10%). and the dominant success factor was not explored.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.7A
• /
• pp.727-734
• /
• 2004

Collision Management Protocol (CMP) efficiently resolves collisions when data frames are transmitted in networks consisting of HomPNA 3.0 asynchronous MAC mode device with random access. Unlike Distributed Fair Priority Queueing (DFPQ) algorithm in HomePNA 2.0 or Binary Exponential Backoff (BEB) algorithm in IEEE 802.11, order of retransmission is decided according to Collision Signaling Sequence (CSS) values allocated to each device. Thus, CMP can minimize the number of mean collisions because order of retransmission is decided in a deterministic way. In this paper. we evaluate the saturation performance of CMP in HomePNA 3.0 using an analytic method.

• The Journal of the Korea Contents Association
• /
• v.10 no.2
• /
• pp.14-24
• /
• 2010

Because WSNs operate with limited resources of sensor nodes, its life is extended by cluster-based routing methods. In this study, we use data on direction, distance, density and residual energy in order to maximize the energy efficiency of cluster-based routing methods. Through this study, we expect to minimize the frequency of isolated nodes when selecting a new cluster head autonomously using information on the direction of the upper cluster head, and to reduce energy consumption by switching sensor nodes, which are included in both of the new cluster and the previous cluster and thus do not need to update information, into the sleep mode and updating information only for newly included sensor nodes at the setup phase using distance data. Furthermore, we enhance overall network efficiency by implementing secure and energy-efficient communication through key management robust against internal and external attacks in cluster-based routing techniques. This study suggests the modified cluster head selection scheme which uses the conserved energy in the steady-state phase by reducing unnecessary communications of unchanged nodes between selected cluster head and previous cluster head in the setup phase, and thus prolongs the network lifetime and provides secure and equal opportunity for being cluster head.

• Journal of Korea Society of Industrial Information Systems
• /
• v.11 no.2
• /
• pp.48-62
• /
• 2006

In recent years, wireless sensor networks(WSNs) have emerged as a new fast-growing application domain for wireless distributed computing and embedded systems. Recent Progress in computer and communication technology has made it possible to organize wireless sensor networks composed tiny sensor nodes. Furthermore, ad-hoc network protocols do not consider the characteristics of wireless sensor nodes, making existing ad-hoc network protocols unsuitable for the wireless sensor networks. First, we propose power-aware routing protocols based on energy-centered routing metrics. Second, we describe power management techniques for wireless sensor nodes using the spatial locality of sensed data. Many nodes can go into a power-down mode without sacrificing the accuracy of sensed data. Finally, combining the proposed techniques, we describe an overall energy-efficient protocol for data collection. Experimental results show that the proposed routing protocol can extend the routing path lifetime more than twice. The average energy consumption per sensing period is reduced by up to 30%.

• Journal of KIISE:Information Networking
• /
• v.29 no.2
• /
• pp.156-164
• /
• 2002

IPSec is a protocol which provides data encryption, message authentication and data integrity on public and open network transmission. In IPSec, ESP protocol is used when it needs to provide data encryption, authentication and Integrity In real transmission packets. ESP protocol uses DES-CBC encryption mode when sender encrypts packets and receiver decrypts data through this mode IV is used at that time. This value has many tasks of attack during transmission by attacker because it is transferred clean and opened. If IV value is modified, then decryption of ESP data is impossible and higher level information is changed. In this paper we propose a new algorithm that it encrypts IV values using DES-ECB mode for preventing IV attack and checks integrity of whole ESP data using message authentication function. Therefore, we will protect attacks of IV and data, and guarantee core safe transmission on the public network.