• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.2B
• /
• pp.130-137
• /
• 2012

In this paper, we propose core and edge router architectures with LPI(Low Power Idle) for reducing energy consumption in OBS networks. The proposed core router architecture is comprised of a BCP switch, a burst switch, line cards and sleep/wake controller for LPI. When the offered load of network is low, sleep/wake controller can change the state of the core router line card from active to sleep state for saving the energy after receiving network control packet. The edge router consists of a switch for access line card, a SCU and OBS edge router line cards. The LPI function in edge router line card is performed through network level control by network control packet, individually. Additionally, PHY/transceiver modules can transition active state to sleep state when burst assemble engine generates new bursts. To evaluate the energy saving performance of proposed architecture with LPI, the power consumption of each router is analyzed by using data sheet of commercial router and optical device. And, simulation is also performed in terms of sleep time of PHY/Transceiver through OPNET.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2002.11b
• /
• pp.1591-1594
• /
• 2002

BE(Best-Effort)방식의 인터넷에서 제공되던 Text위주의 서비스 제공 방식이 Multimedia 위주의 서비스로 점차 바뀌어 감에 따라, 기존의 BE(Best-Effort)방식으로는 Multimedia QoS(Quality of Service)를 보장하기가 어려워졌다. 이에 IETF(Internet Engineering Task Force)에서는 변화하는 인터넷 환경에서 QoS 보장을 위해 Diffserv(Differentiated Service)방식을 제안하게 되었다. 본 논문에서는 Content를 제공하는 Linux Web Server에서 패킷을 클래스 분류기준(Classification Method)에 의해 분류하고 Scheduling Algorithm을 적용하여 DSCP(Differentiated Service CodePoint) 값을 Web Server 자체에서 결정하여 경계라우터(Edge Router)로 전송하는 방식을 취하였으며, 이를 토대로 하여 경계라우터의 Traffic 부하를 줄이고, 경계라우터의 코어라우터(Core Router)화를 통해 더욱더 향상된 Differentiated Service를 제공하는 것이 목적이다. 이를 본 논문에서는 ns2 를 통해 IETF에서 제안된 Diffserv방식과 본 논문에서 제안한 방식의 Diffserv 방식과 현재의 BE방식을 비교하여 어느 정도의 성능 향상이 있었는지 비교 분석하였다.

• Journal of Game and Entertainment
• /
• v.2 no.1
• /
• pp.8-16
• /
• 2006

The development of multicast communication services in the Internet is expected to lead a stable packet transfer even though On-Line Games generate heavy traffic. The Core Based Tree scheme among many multicast protocols is the most popular and suggested recently. However, CBT exhibits two major deficiencies traffic concentration or poor core placement problem. Thus, measuring the bottleneck link bandwidth along a path is important to understand the performance of multicast. We propose a method in which the core router's state is classified into SS(Steady State), NS(Normal State) and BS(Bottleneck State) according to the estimated link speed rate, and also the changeover of multicast routing scheme for traffic overload. In addition, we introduce Anycast routing tree, an efficient architecture for constructing shard multicast trees.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2016.05a
• /
• pp.174-177
• /
• 2016

Wireless network-on-chip (WNoC) can alleviate critical path problem of existing typical NoCs by integrating radio-frequency module on router. In this paper, core-connection-aware genetic algorithm-based core and WIR mapping methodology at small world WNoC is presented. The methodology could optimize the critical path between cores with heavy communication. The 33% of average latency improvement is achieved compared to random mapping methodology.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.5 no.6
• /
• pp.1083-1088
• /
• 2001

In this paper, we propose a new CBT(core-based tree)multicast routing Mechanism by load balancing mechanism. CBT may result in traffic concentration and bottlenecks near the core routers since traffic from all sources nodes the same set of links as approaches the core. So the router have to load packet to new core router for such congestion. Congestion information is given by rtt(round trip time) between designed core router and the other router.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2001.10a
• /
• pp.154-157
• /
• 2001

In this paper, we propose a new CBT(core-based tree)multicast routing Mechanism by load balancing mechanism. CBT may result in traffice concentration and bottlenecks near the lore routers since traffice from all sources nodes the same set of links as approaches the core. So the router have to load packet to new core router for such congestion. Congestion information is given by rtt(round trip time) between designed core router and the other router.

• The KIPS Transactions:PartC
• /
• v.13C no.7 s.110
• /
• pp.905-912
• /
• 2006

Depending on the location of the rendezvous point (RP), the network efficiency is determined in the core based tree (CBT) or protocol independent multicast-sparse mode (PIM-5M) multicasting protocol to provide the multicast services based on the shared tree. In this paper, a new algorithm to allocate the RP using the estimated values of the total cost and the size(number of entries) of the routing tables is proposed for efficiently controlling the cost and the number of routing table entries. The numerical results show that the proposed algorithm reduces the total cost in 5.37%, and the size of routing tables in 13.35% as compared to the previous algorithm.

• Proceedings of the Korean Information Science Society Conference
• /
• 1998.10a
• /
• pp.383-385
• /
• 1998

MPLS망은 레이블 스위칭을 통해 고속의 라우팅은 제공하지만 서비스 질은 보장하지 않는다. 따라서 MPLS망을 통해 종단간 서비스 질을 보장하기 위한 방법으로 RSVP 흐름 군집을 이용한다. 즉, 입구 라우터와 출구 라우터 간의 흐름들이 요구하는 자원들의 군집하여 예약함으로써 각 흐름들을 요구하는 서비스 질을 보장하게 된다. 이와같이 각 흐름들이 요구하는 자원들을 군집하여 예약하는 이유는 각 흐름별로 예약하고 그 예약에 따라 처리를 하게 되었을 때 흐름 별 상태 정보 저장 및 처리하는 데 많은 비용이 들기 때문이다. 특히 이러한 흐름의 수가 매우 많은 코어 망에서 문제가 크다. 이처럼, 입구 라우터와 출구 라우터간의 흐름들이 요구하는 자원들을 군집하여 예약했을 때, 군집된 흐름들이 입구 라우터와 출구 라우터까지 레이블 스위칭을 통해 전달되면서 이렇게 예약된 자원을 이용하여 서비스 질을 보장 받을 수 있어야 한다. 본 논문에서는 군집된 RSVP 메시지를 통해 자원 예약이 이루어질 때 레이블을 할당하고 바인딩 시킴으로써(레이블이 자원 예약 상태 정보에 대한 구분자 역할을 함) 레이블 스위칭을 통해 패킷이 전달되면서 예약된 자원의 서비스를 받을 수 있게 된다. 자원예약 상태 정보를 레이블 운송 테이블에 저장함으로써 레이블 교환 시 자연적으로 자원 예약에 대한 구분이 됨으로 빠른 구분이 가능하다.

• Proceedings of the IEEK Conference
• /
• 2003.07a
• /
• pp.406-409
• /
• 2003

본 논문에서는 인터넷 QoS(Quality of Service)보장을 위하여 제안된 Diff-Serv(Differentiated Service)모델을 구현하고, QoS 를 보장하지 않는 BE(Best Effort)서비스와 우선 순위가 높은 패킷을 처리하여 QoS 를 보장하는 EF(Expedited Forwarding) 서비스의 차이를 통하여 Diff-Serv 망의 우수성을 입증하고자 한다. Diff-Serv 망은 BB(Bandwidth Broker)와 에지라우터 그리고 다수의 코어라우터로 구성된다. BB 로부터 라우터에 QoS Policy를 전송하기 위하여 COPS(Common Open Policy Service) 프로토콜을 구현하였으며, 사용자와 BB 사이의 SLAT/RAR(Service Level Agreement/Resource Allocation Request)를 처리하기 위하여 Admission Control 이라는 명명한 자체 프로토콜을 개발하였다. 구현된 Diff-Serv 망에서 QoS 보장 테스트를 위하여 19.2Mbps 대역폭이 요구되는 HDTV 스트리밍 서비스를 이용하여 인위적으로 Background Traffic 을 발생시켰을 때, BE 서비스만을 지원하는 망에서는 현저하게 서비스의 질이 떨어지는 반면에 Diff-Serv 망에서는 QoS가 보장됨을 알 수 있었다.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.43 no.6 s.348
• /
• pp.9-22
• /
• 2006

When the legacy multicast routing protocols are adopted in If-based mobile core networks, there are some problems such as traffic injection from unnecessary sources, traffic overhead by group management and router performance degradation by large amount of multicast session information. In this paper, we propose a stateless multicast mechanism which has no need to maintain multicast information for session status and reduces redundant network overhead for maintaining multicast tree. In addition interworking with IGMPv3 gets rid of traffic from unnecessary sources which have no registration from receivers. The operations of essential components including a gateway node for interworking with the legacy Internet multicast network, a gateway node for transparency to radio access network and a intermediate node in mobile core networks, are definitely defined and the proposed communication architecture is completed. Finally we evaluate and approve the performance of the proposed architecture by means of well-designed network simulation.