• Journal of Communications and Networks
• /
• 제8권4호
• /
• pp.391-400
• /
• 2006

With the on-going wireless access technologies, the Internet has become accessible anytime anywhere. In wireless networks, link errors significantly degrade the performance of the transmission control protocol (TCP). To cope with this issue, this paper improves the recently-proposed terrestrial REFWA (T-REFWA) scheme by adding a new error recovery mechanism to its original design. In the T-REFWA scheme, senders are acknowledged with appropriate sending rates at which an efficient and fair utilization of network resources can be achieved. As the feedback values are computed independently of link errors, senders can keep transmitting data at high rates even in case of link error occurrences. Using this feature, the proposed error recovery mechanism can achieve high throughput in environments with high bit error rates. The throughput is further improved by disabling the exponential back-off algorithm of TCP so that long idle times are avoided in case of link errors. We show through simulations that the proposed method improves TCP performance in high bit error rates. Compared with several TCP variants, the proposed error recovery scheme exhibits higher link utilization and guarantees system fairness for different bit error rates.

• Journal of Communications and Networks
• /
• 제9권4호
• /
• pp.394-401
• /
• 2007

High speed all optical network is a viable option to satisfy the exponential growth of internet usage in the recent years. Optical networks offer very high bit rates and, by employing technologies like internet protocol over wavelength division multiplexing(IP-over-WDM), these high bit rates can be effectively utilized. However, failure of a network component, carrying such high speed data traffic can result in enormous loss of data in a few seconds and persistence of a failure can severely degrade the performance of the entire network. Designing IP-over-WDM networks, which can withstand failures, has been subject of considerable interest in the research community recently. Most of the research is focused on the failure of optical links in the network. This paper addresses the problem of designing IP-over-WDM networks that do not suffer service degradation in case of a single link failure. The paper proposes an approach based on the framework provided by a recent paper by M. Kurant and P. Thiran. The proposed approach can be used to design large survivable IP-over-WDM networks.

• 한국경영과학회지
• /
• 제28권2호
• /
• pp.75-89
• /
• 2003

Media Access Control (MAC) Protocol in IEEE 802.11 Wireless LAN standard supports two types of services, synchronous and asynchronous. Synchronous real-time traffic is served by Point Coordination Function (PCF) that implements polling access method. Asynchronous nonreal-time traffic is provided by Distributed Coordination Function (DCF) based on Carrier Sense Multiple Access with Collision Avoidance (CSMA/CA) protocol. Since real-time traffic is sensitive to delay, and nonreal-time traffic to error and throughput, proper traffic scheduling algorithm needs to be designed. But it is known that the standard IEEE 802.11 scheme is insufficient to serve real-time traffic. In this paper, real-time traffic scheduling and admission control algorithm is proposed. To satisfy the deadline violation probability of the real time traffic the downlink traffic is scheduled before the uplink by Earliest Due Date (EDD) rule. Admission of real-time connection is controlled to satisfy the minimum throughput of nonreal-time traffic which is estimated by exponential smoothing. Simulation is performed to have proper system capacity that satisfies the Quality of Service (QoS) requirement. Tradeoff between real-time and nonreal-time stations is demonstrated. The admission control and the EDD with downlink-first scheduling are illustrated to be effective for the real-time traffic in the wireless LAN.

• 전기학회논문지
• /
• 제65권12호
• /
• pp.2159-2166
• /
• 2016

In the IEEE 802.11 DCF (Distributed Coordination Function) protocol, the binary exponential backoff algorithm is used to avoid data collisions. However, as the number of stations increases of, the collision probability tends to grow and the overall network performance is reduced. To solve this problem, this paper proposes a data transmission scheme based on the channel reservation method. In the proposed scheme, channel time is divided into reservation period and contention period. During the reservation period, stations succeeded in channel reservation transmit their own data packets in sequence without contention. During the contention period, each station sends its data packets through contentions as in DCF. During both the reservation period and the contention period, each station sends a request for channel reservation for the next reservation period to an AP (Access Point). After receiving such a channel reservation request from each station, the AP decides whether the reservation is succeeded and sends the result via a beacon frame to each station. Performance of the proposed scheme is analyzed through simulations. The simulation results show that the proposed scheme tends to reduce the collision probability of DCF and to improve the overall network performance.

• 한국정보통신학회논문지
• /
• 제14권10호
• /
• pp.2237-2246
• /
• 2010

본 논문에서는 기존의 RCO-MAC 협력통신용 프로토콜을 실제 환경에 더욱 근접한 모델을 사용하여 성능평가를 수행하였다. 트래픽 데이터가 지수함수 분포에 따라 발생하고, 발생한 데이터 패킷은 버퍼에 저장하는 모델을 사용하였으며, 성능평가 척도로는 시스템 처리량, 평균 액세스 지연시간, 그리고 평균 시스템 지연시간을 사용하였다. 성능평가는 컴퓨터 모의실험을 통해 수행하였으며 성능평가 결과로부터 RCO-MAC 프로토콜의 시스템 처리량 성능이 기존 rDCF 기법에 비해 18%정도 우수함을 확인할 수 있었다. 그리고 기존연구에서 채택했던 트래픽 모델의 한계 때문에 확인하지 못했던 결과, 즉 RCO-MAC 프로토콜의 평균 시스템 지연시간 성능이 기존 rDCF 기법에 비해 우수함도 확인할 수 있었다.

• 정보처리학회논문지C
• /
• 제10C권1호
• /
• pp.71-76
• /
• 2003

인터넷 사용자의 증가와 인터넷을 이용한 전자상거래(E-commerce)의 확산 그리고 네트워크 게임 등으로 인해 인터넷상의 사용자 데이터는 끊임없이 증가하고 있는 상태이다. 이러한 인터넷의 확산을 지원하기 위해 고속 통신을 가능하게 할 초고속 라우터가 상용화되는 추세이다. 고속의 패킷 라우팅 처리를 위해 고안된 라우터 구조를 살펴보면, 라인 인터페이스와 호스트 프로세서는 각각 제어용 프로세서를 가지고 있어 독립된 디바이스로 동작하며 패킷 스위칭과 고속의 패킷 포워딩, 신속한 FIB(Forwarding Information Base)처리 등을 구현하고 있다. 본 논문에서는 라우팅 정보를 관리하는 유니캐스트 및 멀티캐스트 라우팅 프로토콜과 OAM(Operation And Maintenance) 관련 패킷을 비포워딩(nonforwarding) 패킷으로 정의하고, 이를 처리하는 라인 인터페이스와 호스트 프로세서에서의 소프트웨어 구조를 제시하였다. 또한 분산 시스템에 요구되는 프로세서 간의 통신 메커니즘으로 프로세서간 통신 처리용 프로토콜(Inter-Processor Communication Message Protocol)을 설계 및 적용하여 기존의 UDP/IP를 이용하는 통신 메커니즘에 비해 성능이 향상됨을 확인하였다.

• 대한전자공학회논문지TC
• /
• 제38권8호
• /
• pp.30-41
• /
• 2001

본 논문에서는 ATM 기반 MPLS 망에서 효율적으로 IP 서비스를 전송하기 위한 동적 버퍼관리 방식의 Dynamic GSMP V3(General Management Protocol Version 3)를 구현하였으며, 하드웨어 모델링 구조를 제안하였다. 또한 현재 표준화중인 GSMP와 동적 버퍼관리 방식을 수용한 GSMP를 셀 손실률 측면에서 비교 분석하였다. ATM 스위치 상에 연결 제어의 성능 향상을 위해 스위치에서 연결설정 및 제어를 수행하는 Dynamic GSMP V3의 Slave 블록을 산성 SoG $0.5{\mu}m$ 공정으로 설계하였다. 기존의 방식과 제안한 방식의 성능 평가를 위해 확률 랜덤 변수에 의해 발생된 셀과 최소 버퍼 알고리즘을 이용하여 모의 실험을 하였으며, 이때 셀 손실률이 향상되었음을 알 수 있었다.

• Journal of Magnetics
• /
• 제19권1호
• /
• pp.43-48
• /
• 2014

Magnetic materials with large coercive force and high squareness ratio are currently developing to meet an industrial demand. Since a ferromagnetic material has hysteresis characteristics, it is hard to demagnetize a ferromagnetic material precisely. In this paper, we describe deperm processes and conduct an analysis of residual magnetization of ferromagnetic material using the Preisach modeling with a two-dimensional finite elements method (FEM). From the results, it was shown that an exponential decrement form of deperm protocol is more efficient than a linear decrement form because of the demagnetizing field in the ferromagnetic material.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2002년도 ITC-CSCC -3
• /
• pp.1851-1854
• /
• 2002

The Internet with conventional routing scheme cannot meet user demands driven from drastic growth in the Internet user and various service and traffic type. MPLS(Multi Protocol Label Switching) was introduced to the Internet fur solution to resolve this problem. MPLS is a paradigm to integrate higher layer’s software routing functions including layer-3 routing with layer-2 switching. But, the exponential growth of Internet traffic brings out of label space. One scalable solution to cope with this problem is to introduce flow merge technique, i. e. a group of flows is forwarded using the same label. Specially, IETF(Internet Engineering Task Force) recommends that ATM based MPLS system may include VC merge function, so it is scalable to increase of internet traffic. We implemented the MPLS LER system that includes the look-up and forwarding function in incoming path and VC merging function and limited traffic management function in outgoing path. This paper describes the implementation of the LER’s outgoing parts.

• Journal of information and communication convergence engineering
• /
• 제5권3호
• /
• pp.205-208
• /
• 2007

The IEEE 802.11 is a MAC protocol which has been standardized by IEEE for Wireless Local Area Networks (WLANs). In the IEEE 802.11 WLANs, network nodes experiencing collisions on the shared channel need to backoff for a random period of time, which is uniformly selected from the Contention Window (CW). This contention window is dynamically controlled by the Binary Exponential Backoff (BEB) algorithm. However, the BEB scheme suffers from a fairness problem; some nodes can achieve significantly larger throughput than others. This paper proposes a new backoff algorithm for the IEEE 802.11 DCF scheme. This algorithm uses the hop count for considering fairness. It causes flows with high hop count to generate short backoff interval than those with low hop count, thus getting high priority. Therefore, when a collision occurs, the modified IEEE 802.11 DCF assigns higher priority to flow to be close to a destination.