• Proceedings of the Korea Multimedia Society Conference
• /
• 2000.04a
• /
• pp.449-452
• /
• 2000

This paper proposes a new, adaptive Dead Reckoning model, called Dynamic Dead Reckoning , for Distributed Interactive Simulation and humanoid avatar systems. The proposed model can overcome the weak points of traditional Dead Reckoning caused by a fixed threshold and strong dependency on rotation event. This paper introduces new criteria for update message filtering , named as Update lifetime. The Dynamic Dead Reckoning keeps the balance between extrapolation fidelity and filtering performance by two component models, Variable Threshold Mechanism and Rotation Event model. The experimental results show that the proposed model can lower the increment rate of update traffic to the increase of rotation frequency without any significant loss of accuracy.

• Journal of the Korea Society for Simulation
• /
• v.6 no.2
• /
• pp.45-57
• /
• 1997

MAC (media access control) bridge is used to interconnect separate LANs and to relay frames between the BLANs (bridged LANs). Bridge architecture consists of MAC entity, MAC relay entity and bridge protocol entity protocol entity and performs learning, filtering and forwarding functions using filtering database. In this paper, we simulate these functions of bridge and the STP (spanning tree protocol). The STP derives an active topology from an arbitrarily connected BLAN. Our simulation model assumes a BLAN consisted of three bridge forming a closed loop. In order to remove the loop, each bridge process exchanges configruation BPDU (bridge protocol data unit0 with other bridge processes connected to the bridge itself. To simulate the communication between bridges, we implement the IPC (inter-process communication) server using message queues. Our simulation results show that the assumed BLAN contains no closed loop and then there is no alternative route and no unnecessary traffic.

• The Transactions of the Korea Information Processing Society
• /
• v.3 no.7
• /
• pp.1727-1738
• /
• 1996

This paper proposes a extended service filtering technique to solve overload control problems inService Con-trol Poin(SCP) due to Televoting (VOT) services with heavy traffic characteristics. Also, this paper compares this new technique with existing IN overload control lechniques, and calculate steady state call blocking probabilities in In under overload conditions. The proposed technique considers SCP overload and IN CS-1services such as VOT service that need to use the specialized resources of IP. This technique uses first an activating step which SCP sends service filtering request to SSP and IP for the start of service filtering. Then, in the filtering step SSP sendas filtering results to SCP periodically or each N-calls.Also,when filtering time-out timer expired or call counter value exceeded maximum number of calls,SSP stops service filtering,and sends ser-vice filteing response to SCP in the deactivating step. The application of this techique to VOT service defined in IN CS-1 service is investigated and analyzed by using an analytical VOT service model.In order to apply this technique to VOT service, this paper also discusses VOT service and the corresponding N architecture including Service Switching Point(SSP),SCP and IP. Then this paper also constructs an analytical VOT service model,and calculates SCP and SSP/IP(circuit)call blocking probablities.With the application of this new technique,this paper shows good performance enhancements in SCP call blocking probability.

• ETRI Journal
• /
• v.31 no.5
• /
• pp.631-633
• /
• 2009

We introduce an improved Ethernet ring protection method, selective filtering database (FDB) advertisement, to minimize traffic overshoot in the event of a failure or recovery. On the protection switching event, the proposed method makes all ring nodes perform an FDB flush except the FDB entries associated with their client subnets. Then, ring nodes rapidly exchange their client MAC address lists so that their FDBs are immediately updated by indirect MAC address learning. The proposed scheme guarantees fast and reliable protection switching over the standard scheme.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2003.11b
• /
• pp.1077-1080
• /
• 2003

본 연구는 룰들의 각 필드들을 index하여 곱한 cross-product 테이블을 이용한 packet classification 알고리즘에 대해 연구하고 그 것의 성능을 평가하고 분석한다. 현재 Packet Classification은 Packet Filtering, Policy Routing, Accounting & Billing, Traffic Rate Limiting, Traffic Shaping, 등등의 서비스를 위한 가장 핵심적인 작업이다. 그러나 이들을 빠르게 서비스하는 알고리즘은 아직 존재하지 않는다. 단지 하드웨어 TCAM 을 이용해서 작은 룰들에 대한 처리만이 어느 정도 가능한 실정이다. 이에 본 연구는 소프트웨어를 이용한 cross-product 알고리즘의 효용성을 가늠하고자 연구하고 이를 실제 구현해 평가하고자 한다.

• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 1997.04a
• /
• pp.185-191
• /
• 1997

The study presents the linear dynamic analysis of bridges under vehicular movement to examine the performance characteristics due to the various structural and loading conditions. The road surface roughness and bridge-vehicle interactions are considered. The road surface profiles for the approaching roadway and bridge decks are generated from power spectral density functions for different road roughness conditions. A new filtering method using the wheel trace is proposed to obtain the more rational bridge-vehicle interactions from the randomly generated road surface. The dynamic responses of various bridges designed according to current design practice are examined, in which important structural parameters(such as span length, girder spacing, etc.) are considering systematically. In addition, the traffic conditions of multi-truck traveling either consecutively on the same lane or side-by-side on the adjacent lanes are also evaluated.

• The KIPS Transactions:PartC
• /
• v.14C no.1 s.111
• /
• pp.45-54
• /
• 2007

As one of the most threatening attacks, DDoS attack makes distributed multiple agents consume some critical resources at the target within the short time, thus the extent and scope of damage is serious. Against the problems, the existing defenses focus on detection, traceback (identification), and filtering. Especially, in the hierarchical networks, the traffic congestion of a specific node could incur the normal traffic congestion of overall lower nodes, and also block the control traffic for notifying the attack detection and identifying the attack agents. In this paper, we introduce a DDoS attack tolerant network structure using a hierarchical overlay for hierarchical networks, which can convey the control traffic for defense such as the notification for attack detection and identification, and detour the normal traffic before getting rid of attack agents. Lastly, we analyze the overhead of overlay construction, the possibility of speedy detection notification, and the extent of normal traffic transmission in the attack case through simulation.

• Proceedings of the Korean Information Science Society Conference
• /
• 2000.10c
• /
• pp.269-271
• /
• 2000

인터넷의 속도가 점차 빨라지고 대역폭이 증가함에도 불구하고 네트워크 대역폭은 여전히 부족한 자원이다. 이는 네트워크 속도가 빨라짐에도 불구하고 그 만큼 이를 모두 활용하는 어플리케이션이 계속 개발되어 사용되기 때문이다. 기업 차원에서는 주요한 자산인 네트워크 대역폭을 효율적으로 활용하는 것이 매우 중요하며, 개인 차원에서는 미성년들이 유해한 정보에 노출되는 것을 방지하는 것이 필요하다. 본 논문에서는 이러한 필요성에 따라 네트워크 트래픽을 분석하고, 이를 바탕으로 관리 정책에 따라 네트워크 트래픽을 필터링하는 시스템을 설계하고 이를 구현하였다.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.45 no.3
• /
• pp.113-122
• /
• 2008

In RFID system, Middleware collects and filters streaming data gathered continuously from readers to process applications requests. The enormous amount of data makes middleware in highly overloaded. Hence, we propose reader level filtering in order to reduce overall middleware load. In this paper, we consider reader filtering capability and define query plan to minimize number of queries for processing into middleware and reader level. We design and implement middleware system based on proposed query plan. We perform several experiments on implemented system. Our experiments show that the proposed query plan considerably improves the performance of middleware by diminishing processing time and network traffic between reader and middleware.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.5S
• /
• pp.1666-1675
• /
• 2000

This paper proposes a RTWM (Real-Time Web Middleware) framework for real-time EC(Electronic Commerce) systems. RTWM system is extended the existing COS( CORBA Object Service) model added to the event monitoring, real-time scheduler, real-time event filtering for supporting real-time concept of EC systems. Especially, this paper is concentrated on providing suitable event filtering function for EC system in order to meed various user time requirements under distributed system environment. It stores time constraint requirements an interesting event information input from users into QoS repository, then processes the data through appropriate RTFA(Real-Time Filtering Agent) module when real-time events occur. From this method, users can get the filtered event result reflected their requirements about real-time filtering. It means this system provides thigh QoS to users. In addition, it results in decreasing network traffic as unnecessary event information is filtered from network.