• Title/Summary/Keyword: Core Router

Search Result 51, Processing Time 0.023 seconds

Traffic Engineering Based on Local States in Internet Protocol-Based Radio Access Networks

  • Barlow David A.;Vassiliou Vasos;Krasser Sven;Owen Henry L.;Grimminger Jochen;Huth Hans-Peter;Sokol Joachim
    • Journal of Communications and Networks
    • /
    • v.7 no.3
    • /
    • pp.377-384
    • /
    • 2005
  • The purpose of this research is to develop and evaluate a traffic engineering architecture that uses local state information. This architecture is applied to an Internet protocol radio access network (RAN) that uses multi-protocol label switching (MPLS) and differentiated services to support mobile hosts. We assume mobility support is provided by a protocol such as the hierarchical mobile Internet protocol. The traffic engineering architecture is router based-meaning that routers on the edges of the network make the decisions onto which paths to place admitted traffic. We propose an algorithm that supports the architecture and uses local network state in order to function. The goal of the architecture is to provide an inexpensive and fast method to reduce network congestion while increasing the quality of service (QoS) level when compared to traditional routing and traffic engineering techniques. We use a number of different mobility scenarios and a mix of different types of traffic to evaluate our architecture and algorithm. We use the network simulator ns-2 as the core of our simulation environment. Around this core we built a system of pre-simulation, during simulation, and post-processing software that enabled us to simulate our traffic engineering architecture with only very minimal changes to the core ns-2 software. Our simulation environment supports a number of different mobility scenarios and a mix of different types of traffic to evaluate our architecture and algorithm.

An Efficient Multicast Architecture for IP-Based Mobile Core Networks (IP기반 모바일 코어 네트워크에서의 효율적인 멀티캐스트 아키텍처)

  • Kim Won-Tea;Kim Hyo-Eun;Park Yong-Jin
    • 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.

IP lookup scheme for high speed packet forwarding (고속 패킷(packet) 처리를 위한 IP lookup scheme)

  • 박우종;정민섭;정진우;강성봉
    • Proceedings of the IEEK Conference
    • /
    • 2000.11a
    • /
    • pp.213-216
    • /
    • 2000
  • In this paper, we propose a new scheme which improves the IP address lookup time. The new scheme is composed of two core technologies, named the prefix alignment and the prefix distance ordering. Now, as the Internet is being used commonly by improving the data transmission capacity, the need for enlarging the bandwidth of the Internet is on the rise. IP address lookup performance problem is an important obstacle in the router executing high speed packet forwarding. This results from the fact that the prefixes routing table is composed of and the traffic being processed in unit time are largely on the increase. The proposed lookup scheme is divided into two parts in technology, the one is the algorithm forming a routing database(routing table), the other is the lookup procedure in the actual packet processing.

  • PDF

RIO-DC Buffer Design for Core Routers in DiffServ Assured Services

  • Hur, Kyeong
    • Journal of information and communication convergence engineering
    • /
    • v.9 no.5
    • /
    • pp.539-544
    • /
    • 2011
  • In this paper, a parameter optimization method of RIO-DC (RED (Random Early Detection) with In and Out-De-Coupled Queues) scheme for Assured Service (AS) in Differentiated Services (DiffServ) is proposed. In order to optimize QoS (Quality of Service) performance of the RIO-DC policy for AS in terms of maximum tolerable latency, link utilization, fairness, etc., we should design router nodes with proper RIO-DC operating parameter values. Therefore, we propose a RIO-DC configuration method and the admission control criterion, considering the allocated bandwidth to each subclass and the corresponding buffer size, to increase throughput for In-profile traffic and link utilization. Simulation results show that RIO-DC with the proposed parameter values guarantees QoS performance comparable with the RIO scheme and it improves fairness between AS flows remarkably.

Optical BGP Routing Convergence in Lightpath Failure of Optical Internet

  • Jeong, Sang-Jin;Youn, Chan-Hyun;Kang, Min-Ho;Min, Kyoung-Seon;Hong, Hyun-Ha;Kim, Hae-Geun
    • ETRI Journal
    • /
    • v.24 no.2
    • /
    • pp.97-108
    • /
    • 2002
  • Optical Border Gateway Protocol (OBGP) is an extension to BGP for Optical Cross Connects (OXCs) to automatically setup multiple direct optical lightpaths between many different autonomous domains. With OBGP, the routing component of a network may be distributed to the edge of the network while the packet classification and forwarding is done in the core. However, it is necessary to analyze the stable convergence functions of OBGP in case of lightpath failures. In this paper, we first describe the architecture of the OBGP model and analyze the potential problems of OBGP, e.g., virtual BGP router convergence behavior in the presence of lightpath failure. We then propose an OBGP convergence model derived from an inter-AS (Autonomous System) relationship. The evaluation results show that the proposed model can be used for a stable OBGP routing policy and OBGP routing convergence under lightpath failures of the optical Internet.

  • PDF

Implementation of a ZigBee-based High Performance Sensor Node for the Robot Environment Platform (로봇환경플랫폼을 위한 직비 기반의 고성능 센서노드 구현)

  • Kim, Kee-Min;Lee, Kyung-Jung;Kim, Jae-O;Moon, Chan-Woo;Ahn, Hyun-Sik
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.10 no.4
    • /
    • pp.69-75
    • /
    • 2010
  • In this paper, a ZigBee-based wireless sensor network is configured for the robot to effectively communicate with the environment platform where sensor nodes are implemented using high performance microcontrollers. The localization and the navigation functions are also required to the robot which performs the given task using various types of sensor information. A new type of ZigBee stack is developed using the RUM(Router Under MAC) of the Atmel Corp. and it is applied to a 32-bit ARM core microcontroller for the high performance sensor data manipulation and transmission. It is verified by experiments that the wireless sensor network consisting of developed high performance sensor nodes can be effectively used for the robot environment platform.

Active Congestion Control Using Active Router′s Feedback Mechanism (액티브 라우터의 피드백 메커니즘을 이용한 혼잡제어 기법)

  • Choe, Gi-Hyeon;Jang, Gyeong-Su;Sin, Ho-Jin;Sin, Dong-Ryeol
    • The KIPS Transactions:PartC
    • /
    • v.9C no.4
    • /
    • pp.513-522
    • /
    • 2002
  • Current end-to-end congestion control depends only on the information of end points (using three duplicate ACK packets) and generally responds slowly to the network congestion. This mechanism can't avoid TCP global synchronization which TCP congestion window size is fluctuated during congestion occurred and if RTT (Round Trip Time) is increased, three duplicate ACK packets is not a correct congestion signal because congestion maybe already disappeared and the host may send more packets until receive the three duplicate ACK packets. Recently there is increasing interest in solving end-to-end congestion control using active network frameworks to improve the performance of TCP protocols. ACC (Active congestion control) is a variation of TCP-based congestion control with queue management In addition traffic modifications nay begin at the congested router (active router) so that ACC will respond more quickly to congestion than TCP variants. The advantage of this method is that the host uses the information provided by the active routers as well as the end points in order to relieve congestion and improve throughput. In this paper, we model enhanced ACC, provide its algorithm which control the congestion by using information in core networks and communications between active routers, and finally demonstrate enhanced performance by simulation.

A Local Tuning Scheme of RED using Genetic Algorithm for Efficient Network Management in Muti-Core CPU Environment (멀티코어 CPU 환경하에서 능률적인 네트워크 관리를 위한 유전알고리즘을 이용한 국부적 RED 조정 기법)

  • Song, Ja-Young;Choe, Byeong-Seog
    • Journal of Internet Computing and Services
    • /
    • v.11 no.1
    • /
    • pp.1-13
    • /
    • 2010
  • It is not easy to set RED(Random Early Detection) parameter according to environment in managing Network Device. Especially, it is more difficult to set parameter in the case of maintaining the constant service rate according to the change of environment. In this paper, we hypothesize the router that has Multi-core CPU in output queue and propose AI RED(Artificial Intelligence RED), which directly induces Genetic Algorithm of Artificial Intelligence in the output queue that is appropriate to the optimization of parameter according to RED environment, which is automatically adaptive to workload. As a result, AI RED Is simpler and finer than FuRED(Fuzzy-Logic-based RED), and RED parameter that AI RED searches through simulations is more adaptive to environment than standard RED parameter, providing the effective service. Consequently, the automation of management of RED parameter can provide a manager with the enhancement of efficiency in Network management.

Multicore Flow Processor with Wire-Speed Flow Admission Control

  • Doo, Kyeong-Hwan;Yoon, Bin-Yeong;Lee, Bhum-Cheol;Lee, Soon-Seok;Han, Man Soo;Kim, Whan-Woo
    • ETRI Journal
    • /
    • v.34 no.6
    • /
    • pp.827-837
    • /
    • 2012
  • We propose a flow admission control (FAC) for setting up a wire-speed connection for new flows based on their negotiated bandwidth. It also terminates a flow that does not have a packet transmitted within a certain period determined by the users. The FAC can be used to provide a reliable transmission of user datagram and transmission control protocol applications. If the period of flows can be set to a short time period, we can monitor active flows that carry a packet over networks during the flow period. Such powerful flow management can also be applied to security systems to detect a denial-of-service attack. We implement a network processor called a flow management network processor (FMNP), which is the second generation of the device that supports FAC. It has forty reduced instruction set computer core processors optimized for packet processing. It is fabricated in 65-nm CMOS technology and has a 40-Gbps process performance. We prove that a flow router equipped with an FMNP is better than legacy systems in terms of throughput and packet loss.

Dynamic On-Chip Network based on Clustering for MPSoC (동적 라우팅을 사용하는 클러스터 기반 MPSoC 구조)

  • Kim, Jang-Eok;Kim, Jae-Hwan;Ahn, Byung-Gyu;Sin, Bong-Sik;Chong, Jong-Wha
    • Proceedings of the IEEK Conference
    • /
    • 2006.06a
    • /
    • pp.991-992
    • /
    • 2006
  • Multiprocessor system is efficient and high performance architecture to overcome a limitation of single core SoC. In this paper, we propose a multiprocessor SoC (MPSoC) architecture which provides the low complexity and the high performance. The dynamic routing scheme has a serious problem in which the complexity of routing increases exponentially. We solve this problem by making a cluster with several PEs (Processing Element). In inter-cluster network, we use deterministic routing scheme and in intra-cluster network, we use dynamic routing scheme. In order to control the hierarchical network, we propose efficient router architecture by using smart crossbar switch. We modeled 2-D mesh topology and used simulator based on C/C++. The results of this routing scheme show that our approach has less complexity and improved throughput as compared with the pure deterministic routing architecture and the pure dynamic routing architecture.

  • PDF