• The Transactions of the Korea Information Processing Society
• /
• v.6 no.11S
• /
• pp.3269-3277
• /
• 1999

To promote the inclusion of end-to-end congestion control in the design of future protocols using best-effort traffic, we propose a router mechanism, Extended FRED(ex-FRED). In this paper, we catagorize the TCP controlled traffics into robust and fragile traffic and discuss several unfairness conditions between them caused by the diverse applications. For example, fragile traffic from bursty application cannot use its fair share due to their slow adaptation. Ex-FRED modifies the FRED(Fair Random Early Drop), which can show wrong information due to the narrow view of actual buffer. Therefore, Ex-FRED uses per-flow accounting in larger virtual buffer to impose an each flow a loss rate that depends on the virtual buffer use of a flow. The simulation results show that Ex-FRED uses fair share and has good throughput.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2011.05a
• /
• pp.184-186
• /
• 2011

최근 사물지능통신에 대한 연구가 활발히 진행 중이다. 사물지능통신은 인간의 개입 없이 네트워크를 통해 사물 또는 기기들 사이에서 데이터를 주고 받는 통신으로 정의하고 있다. 사물지능통신을 위한 네트워크 인프라 기술에 대한 논의가 3GPP, ISO, IETF 등에서 활발히 논의 중이다. 더불어 사물지능통신의 응용에 따라서 기반 인프라가 결정될 것으로 보고 있다. 특히 3GPP에서는 LTE 네트워크 기반의 Machine Type Communications 기술 표준 기술이 논의 중이다. 본 논문에서는 사물지능 통신에 사용될 인프라 기술에 대해서 장단점을 정의하고 기존 인프라 기반에서 Machine Type Communications 서비스를 제공할 시 발생할 수 있는 혼잡 상황을 정의하고 이를 해결하기 위한 혼잡 제어 기술을 제안한다.

• Journal of Communications and Networks
• /
• v.5 no.3
• /
• pp.230-239
• /
• 2003

In this paper, we propose a framework to study how to route packets efficiently in multipath communication networks. Two traffic congestion control techniques, namely, flow assignment and packet scheduling, have been investigated. The flow assignment mechanism defines an optimal splitting of data traffic on multiple disjoint paths. The resequencing delay and the usage of the resequencing buffer can be reduced significantly by properly scheduling the sending order of all packets, say, according to their expected arrival times at the destination. To illustrate our model, and without loss of generality, Gaussian distributed end-to-end path delays are used. Our analytical results show that the techniques are very effective in reducing the average end-to-end path delay, the average packet resequencing delay, and the average resequencing buffer occupancy for various path configurations. These promising results can form a basis for designing future adaptive multipath protocols.

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.04a
• /
• pp.526-528
• /
• 2004

본 논문은 유무선 환경에서 TCP를 이용한 데이터 전송 시 에이젼트를 이용하여 패킷 손실의 원인을 분석, 무선 링크에서 발생한 패킷 손실에 대해서는 혼잡 윈도우 크기를 유지하고, 유선 링크에서 발생한 패킷 손실에 대해서는 지역 재전송을 수행하는 저 전력 전송기법을 제안한다. 제안하는 저 전력 전송기법은 전송 후 WNIC를 저 전력 모드로 전환시킴으로써 WNIC 전력소비를 최소화한다. NS2 시뮬레이션 결과 기존 TCP 보다 무선 링크에서 에러 발생시 67~177(%) 성능향상과 22~44(%) 에너지 감소효과를 보였고, 유선 링크에서 에러 발생시 3~22(%)의 성능 향상과 2~13(%) 에너지 감소 효과를 나타냈다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.26 no.10A
• /
• pp.1746-1755
• /
• 2001

본 논문에서는 인터넷 트래픽의 자기 유사성 특성을 이용한 큐 관리 기법을 제안한다. 제안 기법은 LRD 프로세스의 특성을 이용하여 큰 타임 스케일에서 다음 혼잡 검출 주기 동안 평균 트래픽 입력율을 예측하고 이를 통해 혼잡 발생 여부를 미리 검출한다. 혼잡 검출시 입력 패킷을 확률적으로 폐기함으로써 망 내부에서 혼잡 발생을 사전에 방지한다. 제안 기법은 종단 시스템의 혼잡 제어 기법이나 각 플로우의 통신 환경에 무관하게 라우터의 평균 큐 길이와 큐 길이 변이를 작게 유지할 수 있으므로 지연과 지연 변이에 민감한 멀티미디어 서비스 제어에 적합하다. 또한 제안 기법은 입력율 예측을 통해 혼잡을 사전에 검출하기 때문에 종단간 혼잡 제어 기법을 사용하지 않는 플로우들에 의해 발생된 패킷들이 망 자원을 불평등하게 많이 사용하는 현상을 방지한다. 제안 기법은 각 플로우별 상태 정보를 관리하지 않으므로 확장성이 뛰어나며 이로 인해 소수의 PHB에 따라 각 홉별로 차등화된 서비스를 제공하는 Diffserv 구조에 적합하다. 또한 제안 기법은 기존 인터넷 구조에 변화를 주지 않고 라우터의 소프트웨어 업그레이드만으로 서비스가 가능하며, 필요한 버퍼의 양도 크지 않다는 장점을 가진다.

• Journal of Electrical Engineering and information Science
• /
• v.2 no.6
• /
• pp.74-81
• /
• 1997

Xcent-Net is a new system network designed to support a clustered SMP called SPAX(Scalable Parallel Architecture based on Xbar) that is being developed by ETRI. It is a duplicated hierarchical crossbar network to provide the connections among 16 clusters of 128 nodes. Xcent-Net is designed as a packet switched, virtual cut-through routed, point-to-point network. Variable length packets contain up to 64 bytes of data. The packets are transmitted via full duplexed, 32-bit wide channels using source synchronous transmission technique. Its plesiochronous clocking scheme eliminates the global clock distribution problem. Two level priority-based round-robin scheme is adopted to resolve the traffic congestion. Clear-to-send mechanism is used as a packet level flow control scheme. Most of functions are built in Xcent router, which is implemented as an ASIC. This paper describes the architecture and the functional features of Xcent-Net and discusses its implementation.

• Annual Conference of KIPS
• /
• 2007.05a
• /
• pp.1286-1287
• /
• 2007

무선 네트워크에서 TCP Vegas는 다양한 원인으로 발생하는 패킷 손실로 인해 전송률이 떨어진다. 다수의 패킷 손실이 발생하면 TCP Vegas의 혼잡제어 기법은 패킷 손실로 인해 혼잡윈도우가 증가되지 않는다. 본 논문은 TCP Vegas의 혼잡제어 기법을 수정하여 무선 네트워크에서 TCP Vegas의 성능을 향상시킨 wirelessVegas를 제안한다. wirelessVegas는 NS-2를 이용하여 시뮬레이션 한 결과 TCP Vegas 보다 1%의 무선 링크 에러율에서 약 20% 높은 성능을 보인다.

• The KIPS Transactions:PartC
• /
• v.11C no.2
• /
• pp.245-252
• /
• 2004

Stream Control Transmission Protocol(SCTP) is a new connection-oriented, reliable delivery transport protocol operating on top of an unreliable connectionless packet service such as IP. It inherits many of the functions developed for TCP, including flow control and packet loss recovery functions. In addition, it also supports transport layer multihoming and multistreaming In this paper, we study the impact of multi-homing on the performance of SCTP. We first compare performance of single-homed SCTP. multi-homed SCTP, TCP Reno and TCP SACK. We, then describe potential flaw in the current SCTP retransmission policy, when SCTP host is multihomed. Our Results show that SCTP performs better than TCP Reno and TCP SACK due to several changes from TCP in its congestion control mechanism. In particular. multi-homed SCTP shows the best result among the compared schemes. Through experimentation for multi-homed SCTP, we found that the current SCTP retransmission policy nay deteriorate the perfomance when the retransmission path it worse than the original path. Therefore, the condition of retransmission path is a very important factor In SCTP performance and a proper mechanism would be required to measure the condition of the retransmission path.

• Journal of Satellite, Information and Communications
• /
• v.10 no.3
• /
• pp.53-56
• /
• 2015

In this paper, we want provide improved services with faster transmission, IEEE 802.11n was standardized. A-MPDU (Aggregation MAC Protocol Data UNIT) is a vital function of the IEEE 802.11n standard, which was proposed to improve transmission rate by reducing frame transmission overhead. In this paper, we show the problems of TCP retransmission with A-MPDU and propose a solution utilizing the property of TCP cumulative ACK. If the transmission of an MPDU subframe fails, A-MPDU mechanism allows selective re-transmission of failed MPDU subframe in the MAC layer. In TCP traffic transmission, however, a failed MPDU transmission causes TCP Duplicate ACK, which causes unnecessary TCP re-transmission. Furthermore, congestion control of TCP causes reduction in throughput. By supressing unnecessary duplicate ACKs the proposed mechanism reduces the overhead in transmitting redundant TCP ACKs, and transmitting only a HS-ACK with the highest sequence number. By using the RACK mechanism, through the simulation results, it was conrmed that the RACK mechanism increases up to 20% compared the conventional A-MPDU, at the same time, it tightly assures the fairness among TCP flows.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.8
• /
• pp.3621-3640
• /
• 2016

In the process of k-coverage of the target node, there will be a lot of data redundancy forcing the phenomenon of congestion which reduces network communication capability and coverage, and accelerates network energy consumption. Therefore, this paper proposes a novel energy balanced k-coverage control algorithm based on probability model (EBKCCA). The algorithm constructs the coverage network model by using the positional relationship between the nodes. By analyzing the network model, the coverage expected value of nodes and the minimum number of nodes in the monitoring area are given. In terms of energy consumption, this paper gives the proportion of energy conversion functions between working nodes and neighboring nodes. By using the function proportional to schedule low energy nodes, we achieve the energy balance of the whole network and optimizing network resources. The last simulation experiments indicate that this algorithm can not only improve the quality of network coverage, but also completely inhibit the rapid energy consumption of node, and extend the network lifetime.