• ETRI Journal
• /
• v.27 no.1
• /
• pp.110-113
• /
• 2005

The resilient packet ring (RPR) is a data optimized ring network, where one of the key issues is on load balancing for competing streams of elastic traffic. This paper suggests three efficient traffic loading algorithms on the RPR. For the algorithms, we evaluate their efficiency via analysis or simulation.

• Proceedings of the Korean Institute of Communication Sciences Conference
• /
• 2004.11a
• /
• pp.16-16
• /
• 2004

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.9B
• /
• pp.581-590
• /
• 2005

The IEEE 802.17 Resilient Packet Ring Working Group develops standards to support the development and deployment of Resilient Packet Ring networks in Local, Metropolitan, and Wide Area Networks for resilient and efficient transfer of data Packets at rates scalable to many gigabits Per second. It was known that the fairness algorithm of the IEEE 802.17 Resilient Packet Ring suffers from throughput degradation under an unbalanced overload. This Paper proposes a congestion release advertisement method to improve this throughput degradation and discusses its performance. Under the proposed method, a congested node decides whether its congestion is released or not. If released, it advertises the congestion release to upstream nodes, and then upstream nodes transmit their traffic without uy regulation. The proposed method is compatible with the legacy fairness algorithm.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2004.05a
• /
• pp.135-138
• /
• 2004

This paper considers a ring loading problem on RPR(Resilient Packet Ring), where RPR is recommended by IEEE802.17 Resilient Packet Ring working group for data optimized networks without the requirements of provisioning circuits. RPR is well suitable for metropolitan area network with two counter-rotating rings that multiple stations share the bandwidth, where the data and its corresponding control traffic is transmitted to the two opposite directional ring, respectively. One of the major concerns on RPR is to provide fairness among traffic requirements. The paper discusses several fairness measures and analysis ring loading problems for the fairness.

• Journal of KIISE:Information Networking
• /
• v.32 no.5
• /
• pp.641-649
• /
• 2005

Metro networks use the existing circuit-switching technology like SONET/SDH. Such circuit-switching based networks are inefficient in tarrying Internet traffic with bursty nature. Therefore, metro networks can become a bottleneck In order to resolve this problem, the IEEE 802.17 working group has proposed the RPR (Resilient Packet Ring) technology. In addition to this, the RPR fairness mechanism has been defined to provide fairness among the stations in the RPR network. However, the current RPR fairness mechanism has the problem of inefficient use of the available bandwidth after when the congestion at a node is resolved. In this paper, we propose an improved bandwidth allocation mechanism in which, after the congestion resolution at a node, the node estimates the number of nodes transmitting data and measures the remaining bandwidth and fairly allocates the available bandwidth to active nodes. To show the performance of our proposed mechanism, we have performed simulation and showed that the proposed mechanism offers higher bandwidth utilization.

• Convergence Security Journal
• /
• v.8 no.2
• /
• pp.57-62
• /
• 2008

In this paper, we suggest new fast recovery mechanism in RPR network, in case of node addition or removing by exterior attack. A RPR network recovery time is consist of two. Failure detecting time and reporting time are that. In this paper we propose fast recovery mechanism that can reduce each time. In a Legacy recovery mechanism, To report node's state, rpr node transmit protection messages. But interval of this protection messages increase exponentially. Thus A transmission failure of protection message cause delay of reporting of network state. Therefore we propose new node state reporting mechanism that put a node state in type b fairness message. And We also suggest fast failure detecting mechanism.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2005.05a
• /
• pp.238-242
• /
• 2005

This paper considers a routing problem on a RPR(Resilient Packet Ring). The RPR is one of the ring-type data telecommunication network. Our major problem is to find an optimal routing algorithm for a given data traffic on the network under no splitting the traffic service, where the maximum load of a link is minimized. This paper characterizes the Minmax problem and develops two heuristic algorithms. By using the numerical comparison, we show that our heuristic algorithm is valuable for efficient routing the data traffic on a RPR.

• Electronics and Telecommunications Trends
• /
• v.17 no.5 s.77
• /
• pp.55-67
• /
• 2002

최근 인터넷 트래픽이 폭증하고 서비스 품질에 대한 요구가 증가함에 따라 백본과 가입자 망에 대하여 집중적인 투자가 이루어져 빠른 속도로 고속화되고 있으나, 메트로 영역에 대한 투자가 상대적으로 적어 메트로 망이 전체 네트워크에서 병목이 되는 결과를 초래하고 있다. 메트로 망을 고속화하기 위해서는 초기 설치비가 저렴하고 확장이 용이하여야 할 뿐만 아니라 사용자가 요구하는 대역폭을 신뢰성있게 제공할 수 있는 망 기술이 요구된다. 이러한 요구에 따라 충분한 대역폭을 저렴하고 신뢰성있게 제공하기 위한 RPR(Resilient Packet Ring) 기술이 제안되어 표준화되고 있다. 본 고에서는 향후 메트로 망의 링 기술로 부각되고 있는 RPR에 대하여 기술적 특징, 표준화 동향 및 적용 방안을 살펴보고 향후 기술을 전망해 본다.

• The Magazine of the IEIE
• /
• v.32 no.4 s.251
• /
• pp.47-61
• /
• 2005

현재의 인터넷은 가입자 액세스 망, 기업망, 메트로 망, 그리고 백본 망으로 이루어져 있다고 할 수 있다. 이러한 망 중에서 가입자 액세스 망과 기업 망, 그리고 백본 망은 현재의 폭발적으로 증가하고 있는 인터넷 트래픽을 효율적으로 수용할 수 있도록 고도화되어 있으나, 메트로 망은 기존의 회선 교환 방식의 SONET/SDH 기반 망을 이용함으로써 비효율적이고 또한 비싸다는 단점을 가지고 있다. 이러한 메트로 망에서 효율적으로 인터넷 트래픽을 전송할 수 있는 RPR(Resilient Packet Ring) 기술이 IEEE 802,17 위원회에서 표준화되었다. RPR에서는 메트로 망에서의 필수 요소인 망 보호 메커니즘이 정의되어 있으며, 토폴로지 발견 메커니즘을 제공함으로써 이더넷의 고유 성질인 plug-and-play를 유지할 수 있어서 새로운 노드의 추가가 용이하다는 장점을 가지고 있다. 또한 링 형태의 각 노드들 간에 공평하게 망을 이용할 수 있기 위한 알고리즘도 정의되어 있다 이 논문에서는 IEEE 802.17 위원회에서 정의된 RPR 기술 및 현재의 표준화 동향에 대해서 다루고자 한다.

• Journal of Korea Multimedia Society
• /
• v.9 no.7
• /
• pp.844-853
• /
• 2006

The IEEE 802.17 Resilient Packet Ring (RPR) for future Local, Metropolitan, and Wide Area Networks was recently standardized, but it still suffer from delay jitter deterioration and even some bandwidth loss under unbalanced overload. In order to overcome these drawbacks, this paper proposes a bandwidth redistribution based fairness control method, compatible with the legacy one, in which each congested node measures the amount of available bandwidth of its bottleneck link resulted from regulating upstream nodes' shares of the link bandwidth, calculates optimal fair rate with the number of uptream nodes requiring more bandwidth, and then redistributes the available bandwidth to the upstream nodes by advertising the rate. The performance evaluation results show that the proposed method fairly redistributes 95% of the bottleneck link bandwidth with even only two redistributions.