• Journal of IKEEE
• /
• v.23 no.4
• /
• pp.1203-1207
• /
• 2019

As the number of IP cores has been increasing in a System-on-Chip (SoC), multiple routers are included in on-chip-networks. Each router has its own arbitration policy and it is difficult to obtain a desired arbitration result by combining multiple routers. Allocating desired bandwidths to the ports across the routers is more difficult. In this paper, a guaranteed bandwidth allocation scheme using an IP-level QoS control is proposed to overcome the limitations of existing local arbitration policies. Each IP can control the priority of a packet depending on the data communication requirement within the allocated bandwidth. The experimental results show that the proposed mechanism guarantees for IPs to utilize the allocated bandwidth in multiple router on-chip-networks. The maximum error rate of bandwidth allocation of the proposed scheme is only 1.9%.

• Journal of KIISE:Information Networking
• /
• v.35 no.5
• /
• pp.384-394
• /
• 2008

A wireless router is a device which allows several wireless clients to share an internet line using NAT (Network Address Translation). In a school or a small office environment where many clients use multiple wireless routers, a client may select anyone of wireless routers so that most clients can be clustered to a small set of the wireless routers. In such a case, there exists load unbalancing problem between clients and wireless routers. One of its result is that clients using the busiest router get poor service. The other is that the resource utilization of the whole wireless routers becomes very low. In order to resolve the problems, we propose a load sharing scheme to maximize network bandwidth utilization based on multiple SSID. In a time internal, the proposed scheme keeps to show the available bandwidth information of all the possible wireless routers to clients through multiple SSID. A new client can select the most available band with router. This scheme allows to achieve a good load balancing between clients and routers in terms of bandwidth utilization. We implemented the proposed scheme with ASUS WL 500G wireless router and performed experiments. Experimental results show the bandwidth utilization improvement compared to the existing method.

• The KIPS Transactions:PartC
• /
• v.15C no.2
• /
• pp.111-118
• /
• 2008

A wireless router is a device which allows several wireless clients to share an internet line using NAT (Network Address Translation). In a school or a small office environment where many clients use multiple wireless routers, a client may select any one of wireless routers so that most clients can be clustered to a small set of the wireless routers. In such a case, there exists load unbalancing problem between clients and wireless routers. One of its result is that clients using the busiest router get poor service. The other is that the resource utilization of the whole wireless routers becomes very low. In order to resolve the problems, we propose a load sharing scheme to maximize network bandwidth utilization based on SSID(Service Set IDentifier) hiding. The proposed scheme keeps checking the available bandwidth of all the possible wireless routers in a time interval and select the most available one. If a new client appears, the most available router is visible to him or her whereas the others are not visible. This is handled by SSID hiding in the proposed scheme. We implemented the proposed scheme with ASUS WL 500G wireless router and performed experiments. Experimental results show the bandwidth utilization improvement compared to the existing method.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.3B
• /
• pp.65-71
• /
• 2005

The primary function of the Internet routers is to forward incoming packets toward their final destinations. IP address lookup is one of the most important functions in evaluating router performance since IP address lookup should be performed in wire-speed for the hundred-millions of incoming packets per second. With CIDR, the IP prefixes of routing table have arbitrary lengths, and hence address lookup by exact match is no longer valid. As a result, when packets arrive, routers compare the destination IP addresses of input packets with all prefixes in its routing table and determine the most specific entry among matching entries, and this is called the longest prefix matching. In this paper, based on parallel multiple hashing and prefix grouping, we have proposed a hardware architecture which performs an address lookup with a single memory access.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2001.10b
• /
• pp.1355-1358
• /
• 2001

IP Multicast can efficiently provide enormous bandwidth savings by enabling sources to send a single copy of a message to multiple recipients who explicitly want to receive the information. But due to the complexity of IP multicast and its fundamental differences from unicast, there are not very many tools available fer monitoring and debugging multicast networks, and only a few experts understand the tools that do exist. This thesis proposes a Multicast Routing Debugger (MRD) system that monitor the status of a multicast network. This system is aimed to multicast-related faults detection. In thesis, first, we define the set of information that should be monitored. Second, the method is developed to take out such information from multicast routers. Third, MRD system is prototyped to collect, process information from heterogeneous routers on a multicast network and to display the various status of the network comprehensively. The prototype of MRD system is implemented and deployed. We perform experiments with several scenarios. Experimental results show we can detect various problems as information that we define is monitored. The MRD system is simple to use, web-based and intuitive tool that can monitor the status of a specific multicast network.

• Design & Manufacturing
• /
• v.9 no.3
• /
• pp.14-18
• /
• 2015

Although demand for non-metalic materials, acrylic and metal plate material is increased. The complex processing equipment that can machine it at the same time is extremely limited. In case of existing manual multiple routers, it is no substantial demand due to the difficulty in use and low efficiency. In this study, the CNC multiple router was designed. The structural analysis was carried out according to the structure of the bed as a basic step for the development of multiple CNC router system that can guarantee the increase in yield while optimizing the manufacturing process. CNC router added a dummy was carried out about weight analysis and load analysis. Development of a CNC router system will be progressed on the basis of the analysis result.

• Proceedings of the Korean Information Science Society Conference
• /
• 2007.10a
• /
• pp.154-155
• /
• 2007

무선 공유기란 NAT(Network Address Translation) 기능을 사용하여 여러 무선 사용자가 인터넷회선 하나를 공유할 수 있게 해주는 장치이다. 여러 개의 무선 공유기를 여러 사용자가 공유하여 사용하는 학교 또는 소규모 사무실 환경에서 사용자들은 무선 공유기들을 임의대로 선택하여 사용할 수 있어서 특정 무선 공유기에 사용자들이 몰리는 현상이 발생할 수 있다. 이러한 경우 무선공유기와 사용자들 사이에 부하 불균형의 문제가 발생한다. 그로 인하여 생기는 문제점중 하나는 사용자가 몰리는 무선 공유기에 속하는 사용자들의 경우 서비스가 원활하지 않다는 점이다. 또 다른 문제점은 무선 공유기 전체 자원 이용률이 낮다는 점이다. 이 문제들을 해결하는 방법으로 본 논문에서는 Multiple SSID를 이용하여 무선 공유기의 대역폭 이용률을 극대화하는 부하 공유 기법을 제안한다. 제안된 기법에서는 주기적으로 각 무선 공유기들의 사용 가능한 대역폭 정보를 Multiple SSID를 이용하여 사용자에게 보여준다. 새로운 사용자는 최대 사용가능한 대역폭을 가진 무선 공유기를 선택한다. 이 방법은 사용자와 라우터들 사이에서 대역폭 활용관점에서 좋은 부하 분산을 가능하게 해준다. 제안한 방법을 ASUS WL 500G 무선 공유기를 이용하여 구현하였으며 실험을 수행하였다. 실험을 통해 제안된 방법이 기존 방법에 비해 대역폭 이용률이 향상되었음을 확인하였다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.12C
• /
• pp.1642-1651
• /
• 2004

Advance of internet access technology requires more internet bandwidth and high-speed packet processing. IP address lookups in routers are essential elements which should be performed in real time for packets arriving tens-of-million packets per second. In this paper, we proposed a new architecture for efficient IP address lookup. The proposed scheme produces multiple balanced trees stored into a single SRAM. The proposed scheme performs sequential binary searches on multiple trees. Performance evaluation results show that p개posed architecture requires 301.7KByte SRAM to store about 40,000 prefix samples, and an address lookup is achieved by 11.3 memory accesses in average.

• Journal of Communications and Networks
• /
• v.10 no.3
• /
• pp.338-350
• /
• 2008

The differentiated services (DiffServ) is proposed to provide packet level service differentiations in a scalable manner. To provide an end-to-end service differentiation to users having a connection over multiple domains, as well as a flow marker, an intermediate marker is necessary at the edge routers, and it should not be operated at a flow level due to a scalability problem. Due to this operation requirement, the intermediate marker has a fairness problem among the transmission control protocol (TCP) flows since TCP flows have intrinsically unfair throughputs due to the TCP's congestion control algorithm. Moreover, it is very difficult to resolve this problem without individual flow state information such as round trip time (RTT) and sending rate of each flow. In this paper, to resolve this TCP fairness problem of an intermediate marker, we propose a fair scalable marker (FSM) as an intermediate marker which works with a source flow three color marker (sf-TCM) operating as a host source marker. The proposed fair scalable marker improves the fairness among the TCP flows with different RTTs without per-flow management. Through the simulations, we show that the FSM can improve TCP fairness as well as link utilization in multiple domain DiffServ networks.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.1B
• /
• pp.18-28
• /
• 2004

Efficient hardware implementation of address lookup is one of the most important design issues of internet routers. Address lookup significantly impacts router performance since routers need to process tens-to-hundred millions of packets per second in real time. In this paper, we propose a practical IP address lookup structure based on the binary tree of prefixes of different lengths. The proposed structure produces multiple balanced trees, and hence it solve the issues due to the unbalanced binary prefix tree of the existing scheme. The proposed structure is implemented using pipelined binary search combined with a small size TCAM. Performance evaluation results show that the proposed architecture requires a 2000-entry TCAM and total 245 kbyte SRAMs to store about 30,000 prefix samples from MAE-WEST router, and an address lookup is achieved by a single memory access. The proposed scheme scales very well with both of large databases and longer addresses as in IPv6.