• Journal of the Korea Society of Computer and Information
• /
• v.10 no.6 s.38
• /
• pp.253-260
• /
• 2005

Active networks not only allows the network nodes, switches or routers. to perform routing and forwarding but so allows their users inject customized programs into the nodes of the network or the packets. that may modify, store or redirect the user data flowing through the network. In this paper, we proposed a new network management system built using active network technology, that can solve problems inherent in most of existing legacy centralized network management systems. The main contribution is to present the Smart Router model that can reduce traffics due to managing networks by way of making control packets into simplified patterns. The disadvantages of the centralized network management are presented and the current solution for distributed network management are discussed. The performance improvements that our architecture offers are showed through a service example experiment.

• 한국정보통신설비학회:학술대회논문집
• /
• 2004.08a
• /
• pp.137-141
• /
• 2004

네트워크 사용자의 급속한 증가로 네트워크 내의 부하를 감당하기에는 많은 어려움을 가져왔다. 이와 같은 이유로 기존의 TCP/IP에서 세션을 통하여 노드들 간의 통신을 연결하는 방식에서 현재는 하나의 채널을 통해 고속의 I/O가 가능하도록 하는 기술이 많이 연구되고 있다. 그 대표적인 것으로 인피니밴드가 있다. 인피니밴드는 프로세싱 노드와 입출력 장치 사이의 통신, 프로세스간 통신에 대한 산업 표준이 되고 있고 프로세싱 노드와 입출력 장치를 연결하기 위해 스위치 기반의 상호 연결은 전통적인 버스 입출력을 대체하는 새로운 입출력 방식이 사용된다. 또한 인피니밴드에서는 현재 많은 이슈가 되고 있는 RDMA 방식을 이용해 원격지 서버들 간에 직접 메모리 접근 방식을 통해 CPU와 OS의 로드를 최소화하고 있다. 본 논문에서는 RDMA를 적용한 새로운 채널 기반 네트웍의 프로토콜인 SDP(Socket Direct Protocol)를 구현하여 SDP_STREAM의 패킷 처리량에 대한 성능을 평가한다. 그리고 이에 대한 성능 평가를 위해서 Netperf 툴을 이용했다. 특히 Zero-Copy방식을 사용하지 않는 일반적인 소켓 API을 이용한 TCP_STREAM과 Zero-Copy방식을 이용한 SDP_STREAM의 패킷 처리량을 비교했으며 성능 평가 결과는 기존의 TCP_STREAM 패킷 처리량에 비해 약 3배 이상 향상된 결과를 나타냈다.

• Journal of KIISE:Information Networking
• /
• v.30 no.3
• /
• pp.416-423
• /
• 2003

This paper proposes a continuous-time queuing model of a shared-buffer packet switch and an approximate algorithm. N arrival processes have heterogeneous busty traffic characteristics. The arrival processes are modeled by Coxian distribution with order 2 that is equivalent to Interruped Poisson Process. The service time is modeled by Erlang distribution with r stages. First the approximate algorithm performs the aggregation of N arrival processes as a single state variable. Next the algorithm discompose the queuing system into N subsystems which are represented by aggregated state variables. And the balance equations based on these aggregated state variables are solved for by iterative method. Finally the algorithm is validated by comparing the results with those of simulation.

• Journal of the Korea Society of Computer and Information
• /
• v.11 no.2 s.40
• /
• pp.351-360
• /
• 2006

Proposed security system attacks it, and detect it, and a filter generation, a business to be prompt of interception filtering dates at attack information public information. inner IPS to attack detour setting and a traffic band security, different connection security system, and be attack packet interceptions and service and port interception setting. Exchange new security rule and packet filtering for switch type implementation through dynamic reset memory by real time, and deal with a packet. The attack detection about DDoS, SQL Stammer, Bug bear, Opeserv worm etc. of the 2.5 Gbs which was an attack of a hacker consisted in network performance experiment by real time. Packet by attacks of a hacker was cut off, and ensured the normal inside and external network resources besides the packets which were normal by the results of active renewal.

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

In this paper, a session allocation algorithm for a switch with multiple shared links is proposed. The algorithm guarantees the reserved bandwidth to each service class and keeps the delay of sessions belonging to a service class as close as possible even if the sessionsare allocated to different shared links. To support these qualities of services, a new scheduling model for multiple shared links is defined and a session allocation algorithm to decide a shared link to be allocated to a new session on the connection establishmentis developed based on the model. The proposed heuristic algorithm allocates a session to a link including the subclass with the shortest (expected) delay that subclasses of the service class the session belongs to will experience. Simulation results verify that a switch with multiple shared links hiring the proposed algorithm provides service classes with fairer bandwidth allocation and higher throughput, and guarantees reserved bandwidth better than the switch hiring other session algorithms. It also guarantees very similarservice delay to the sessions in the same service class.

• Journal of Korea Multimedia Society
• /
• v.7 no.7
• /
• pp.905-912
• /
• 2004

It is a study LVMPD to solve the fairness problem of inter-session shared bandwidth. Whenever congestion occurs in one session, the highest layer is dropped. Also the highest layer of other sessions in non-congestion is dropped by iner-session fairness. While there is spare bandwidth, receivers of session in non-congestion can't use bandwidth efficiently. In this paper, we proposed a distribution method to use efficiently spare bandwidth that occurred by inter-session fairness. In our method, we considered the highest layer those receivers receiving and the higher layer those receivers requesting. The sender assigns the packet-deleting priority to packets when congestion occurs in receivers, and sets layer add/drop flag when receivers of session in non-congestion request the higher layer. The switch deletes packets with packet-deleting priority and transfers packets with layer add/drop flag for session in non-congestion. Therefore receivers of session in non-congestion can add the higher layer. In experimental results, it was known that proposed algorithm use the inter-session shared bandwidth more effectively compared with already known method.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.11C
• /
• pp.1164-1170
• /
• 2002

In the ACE2000 MPLS system, MPLS Interface Module(MIM) is composed of an ATM Interface Module and a HFMA performing a packet forwarding. In the MIM, the HFMA RSAR receive cells from the Physical layer and reassemble the cells. And the IP Lookup controller perform a packet forwarding after packet classification. Forwarded packet is segmented into cells in the HFMA TSAR and transfer to the ALMA for the transmission to an ATM cell switch. When the MIM make use of an ATM Interface Module, it directly connect the ALMA with a PHY layer using the UTOPIA Level2 interface. Then, an ALMA performs Master Mode. Also, the HFMA TSAR performs the Master Mode in the MIM. Therefore, the UTOPIA-L2 Controller of the Slave Mode require for interfacing between an ALMA and a HFHA TSAR. In this paper, we implement the architecture and cell control mechanism for the UTOPIA-L2 Controller supporting Multi-ports.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.8 no.3
• /
• pp.577-585
• /
• 2004

System Packet Interface Level 4 Phase(SPI-4.2) is an interface for packet and cell transfer between a physical layer(PHY) device and a link layer device, for aggregate bandwidths of OC-192 ATM and Packet Over Sonet/SDH(POS), as well as 10Gbps Ethernet applications. In this paper, we performs the research for SPI-4.2. Also we analyze the performance of SPI-4.2 interface module after modeling using C programming language. This paper shows that SPI-4.2 interface module with 512-word FIFO depth is able to be adapted for the offered loads to 97％ in random uniform traffic and 94％ in bursty traffic with bursty length 32. SPI-4.2 interface module can experience an performance degradation due to heavy overhead when it massively receives small size packets less than 14-byte. SPI-4.2 interface module is suited for line cards in gigabit/terabit routers, and optical cross-connect switches, and SONET/SDH-based transmission systems.

• Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
• /
• v.23 no.10
• /
• pp.75-80
• /
• 2009

In order to prevent loss of communication packets and drop of transmission speed owing to the network fault occurrence, it should be considered network redundancy. That is why a messages of IED GOOSE is the critical signal in charge of protection and control of the substation. So most of users implement the substation automation system with Hybrid network topology ant IED supporting double ethernet ports. Because IEC 61850 GOOSE conformance test is limited in the functional test, this paper suggests how to test the performance of IED GOOSE transmission considering Network redundancy, and describes the analysis of an example test on real IEDs and how to impact the IED GOOSE performance to the substation automation system.

• The KIPS Transactions:PartA
• /
• v.18A no.1
• /
• pp.25-32
• /
• 2011

NoC is actively being studied recently in order to overcome the limitations of shared-bus architecture. We proposed an NoC architecture which employs a buffer that plays a similar role of a proxy server in a computer network to enhance the communication efficiency of NoC architecture. In the proposed NoC architecture, whenever the master has a difficulty in communicating with the slave directly, the master communicates with the proxy server which is able to communicate with the slave on behalf of the master. With the proposed scheme in NoC, we can increase the speed and the bandwidth of communication channel. The experimental results showed that overall communication efficiency was significantly improved by sending the packets to the proxy server rather than holding them in the switch buffer.