• Proceedings of the Korean Information Science Society Conference
• /
• 2002.10e
• /
• pp.610-612
• /
• 2002

현재 인터넷은 IPv4주소 고갈로 인해 종래의 클래스(class)별 주소의 분배와 사용을 지양하고 클래스 없는 CIDR(Classless InterDomain Routing)〔1〕방식을 채택하고 있다. 본 논문에서는 라우터의 개발 및 성능에 영향을 미치는 라우팅 엔트리의 분포와 특성을 다음의 세가지 관점에서 분석하였다. 그리고 분석에 사용된 데이터는 백본용 라우터의 라우팅 테이블이다. 첫째, 현재 인터넷에서 CIDR 방식에 따른 서브넷팅(Subnetting)과 슈퍼넷팅(Supernetting)〔2〕〔3〕정도를 분석하였으며 둘째, 현재 포워딩 테이블(Forwarding Table)내의 불필요한 포워딩 엔트리(Forwarding Entry)들이 차지하는 구성비를 조사하였다. 마지막으로는 멀티홈밍(Multi-homing)이 포워딩 테이블의 크기에 미치는 영향을 분석하였다. 조사에 의하면 MAE-East와 MAE-West〔4〕와 같은 백본(Backbon) 라우터의 경우에 A클래스는 8에서 26비트까지, B클래스는 14비트에서 27비트까지 그리고 C클래스는 17비트에서32비트까지 서브넷팅과 슈퍼넷팅이 되어있다. 또한 불필요한 포워딩 엔트리는 전체 엔트리의약 1%를 차지하고 있으며, 멀티홈밍 엔트리는 약 5%를 차지하는 것으로 확인되었다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2000.10a
• /
• pp.629-631
• /
• 2000

인터넷환경에서 네트워크구축이 보편화된 요즈음, 보안문제가 이슈로 대두되고 있다. 대형 네트워크상에서는 벌써 수년 전부터 방화벽이 보안장비의 중추를 담당하며 사용되고 있으나, 중소규모의 네트워크 환경을 유지관리하기 위한 보호대책은 미비한 편이다. 특히 라우터 전후에서 기능을 하는 방화벽 외에 대형 네트워크 안에서 중소규모의 네트워크를 운영하고자 할 때, 새로운 방화벽 서버를 사용할 수 있다면, 작은 규모의 네트워크에 적합한 패킷필터링이 가능하여, 외부의 침입으로부터 좀 더 안전한 네트워크의 구성이 가능해진다. 본 논문에서는 상대적으로 비용이 저렴하고 setup이 간단한 Linux 방화벽을 통해 외부망에서 접근할 수 없는 사설(private) IP주소를 사용하는 사설망(Private Network)안에 서버를 구성했을 때, Secure Shell에서 지원하는 Port forwarding 기능을 사용하여, 사설망안에 위치한 웹서버, 메일서버등에 접근할 수 있는 방법을 제시하고자 한다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2003.10c
• /
• pp.133-135
• /
• 2003

본 논문에서는 IEEE 802.11 WLAN $^{[1]}$ 에서 QoS를 제공하기 위해 새로운 MAC­layer 구조를 제안한다. 주요 특징으로는 향후 Core Network의 모델로서 제시되고 있는 DiffServ 구조의 특징들을 WLAN에 적용하는 것을 들 수 있으며, 이를 통해 다양한 종류의 멀티미디어 트래픽에 적용될 End­to­end QoS를 보다 효율적 보장하고자 한다. DiffServ에서 제시되고 있는 Expedited. Assured forwarding과 일반적인 Best­effort traffic에 대한 service 차등화 기법을 WLAN에서 적용하기 위해 기존 MAC layer에서의 DCF, PCF 대신 EDWM(Extended DiffServ in WLAN MAC)이라는 새로운 MAC­layer 구조를 제시한다. 이를 통해 시간지연에 민감한 Expedited forwarding과 대역폭의 보장을 필요로 하는 Assured forwarding의 요구 사항(QoS)을 효율적으로 보장할 수 있다. 이에 더하여 기존의 인프라(infrastructure)인 IEEE 802.11b 환경의 DCF와 이를 통하여 service를 제공받는 일반적인 Best­effort traffic을 위한 backward compatibility 보장 방안을 제시한다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.6A
• /
• pp.538-546
• /
• 2010

This paper presents an overview of position-based routing algorithms. We analyze performances of routing algorithms such as Hybrid Opportunistic Forwarding (HOF), Opportunistic multi-hop routing (ExOR), Location based Geocasting and Forwarding (LGF), and Greedy Forwarding in nearest with forward Progress (GFP) routing algorithms to find the best one in terms of packet error rate and throughput efficiency over effects of fading and noise variance in wireless networks. The analyses in closed form expressions are confirmed by the simulation results, which fully agree to analysis results. Additionally, the simulation results indicate significant differences among algorithms when varying the average SNR or the number of relays.

• The KIPS Transactions:PartC
• /
• v.9C no.1
• /
• pp.141-148
• /
• 2002

In this paper, we study the various performance of Distributed QoS Routing according to how many level of routing table information in router. And we study Flooding and recently proposed 2-level forwarding, and compare with performance of implicit 3-level forwarding. Performance factors are message overhead that is generated on Distributed QoS Routing and Route Setup success Rate, Connection blocking rate, Network Utilization. They can decide the accuracy of routing information in rouser. Our simulation shows that more level of routing table information have, lower message overhead generate but lower performance at other factors because of inaccuracy of routing information.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.17 no.8
• /
• pp.2170-2187
• /
• 2023

The general interference is the imperative trouble for simultaneous wireless information and power transfer (SWIPT) system. Although interference has bad influences on the performance of the system, it carries energy simultaneously. In this paper, the energy-constrained relay of the SWIPT system needs to spend much time on energy collecting (EC) in the information transmission (IT) period. Therefore, we propose the scheme of interference signal energy collecting (ISEC) when the interference is strong, and the SWIPT system does not carry out IT. The relay of the system continues to collect energy and stores it until the interference has minimal impact on IT. Then the system performs IT. We divide the collected interference energy equally into several parts, and each IT block receives one part. The proposed scheme is appealing because it can reduce the time of EC in IT period to make the relay spends more time forwarding the received signal in order to improve the performance of the system throughput. Furthermore, we propose a time-switching (TS) protocol based on EC at the relay. And it allows the relay forwarding signal at an appropriate power. Under the protocol, the time of EC can be flexible according to the forwarding power that we give so that the collected energy can be used more efficiently. We give the expressions of the system throughput according to the proposed scheme and protocol. Moreover, the influence of the interference power on the system throughput is also studied.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.25 no.2
• /
• pp.280-285
• /
• 2021

When VNDN technology is used as a communication technology for infotainment application services of connected vehicles, it is possible to realize data-centric networking technology in which data is the subject of communication.Vehicle security attacks and hacks, performance degradation during long-distance data transmission, and frequent data loss It is possible to innovate the limitations of the current host-oriented Internet-based infotainment application service technology of connected vehicles. The data packet forwarding issue to deliver critical information data that is very sensitive to delay in the VNDN on a push-based basis to RSU (Road Side Unit), etc. is one of the issues to be solved for realizing VNDN-based application services. We comprehensively analyze existing forwarding techniques to support push-based data traffic under the environment, and compare and analyze each technique in terms of performance.

• Proceedings of the Korean Information Science Society Conference
• /
• 2001.04a
• /
• pp.409-411
• /
• 2001

기존의 인터넷 망은 대부분 최선형 서비스를 지원하고 있어 다양한 서비스 품질을 요구하는 사용자의 요구를 만족시키기에는 어려움이 있었으며, 이러한 문제점을 해결하기 위해서 ATM 스위치 기반의 MPLS 망이 구상되었다. ATM 스위치를 기반으로 하는 MPLS 망은 기존 ATM 망에 간단한 L3 라우팅 모듈을 추가하여 인터넷 서비스의 제공이 가능하고, 사용자에게 다양한 서비스 레벨을 지원 할 수 있다는 장점이 있다. 본 논문에서는 MPLS 시스템에서 IP 주소 Lookup을 위한 Forwarding Engine에 대한 큐잉 모델을 설정하고, 인터넷에서 사용되는 프로토콜들에 대한 통계적인 분석을 수행하여, 트래픽 부하에 따른 Forwarding Engine의 성능을 분석하였다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.2
• /
• pp.234-252
• /
• 2013

Due to the uncertain of connections in Delay Tolerant Networks (DTNs), most routing algorithms in DTNs need nodes to forward the message to others based on the opportunistic contact. The contact is related with the beaconing rate. In particular, nodes have more chances to encounter with each other with bigger beaconing rate, but more energy will be used. On the other hand, if the nodes forward the message to every node all the time, the efficiency of the routing algorithm is better, but it needs more energy, too. This paper tries to exploit the optimal beaconing rate and forwarding rate when the total energy is constraint. First, a theoretical framework is proposed, which can be used to evaluate the performance with different forwarding rate and beaconing rate. Then, this paper formulates a joint optimization problem based on the framework. Through Pontryagin's Maximal Principle, this paper obtains the optimal policy and proves that both the optimal forwarding and beaconing rates conform to threshold form. Simulation results show the accuracy of the theoretical framework. Extensive numerical results show that the optimal policy obtained in this paper is the best.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.10
• /
• pp.3851-3866
• /
• 2015

The dynamic nature of opportunistic networks results in long delays, low rates of success for deliveries, etc. As such user experience is limited, and the further development of opportunistic networks is constrained. This paper proposes a prediction-based routing method for opportunistic networks (PB-OppNet). Firstly, using an ARIMA model, PB-OppNet describes the historical contact information between a node pair as a time series to predict the average encounter time interval of the node pair. Secondly, using an optimal stopping rule, PB-OppNet obtains a threshold for encounter time intervals as forwarding utility. Based on this threshold, a node can easily make decisions of stopping observing, or delivering messages when potential forwarding nodes enter its communication range. It can also report different encounter time intervals to the destination node. With the threshold, PB-OppNet can achieve a better compromise of forwarding utility and waiting delay, so that delivery delay is minimized. The simulation experiment result presented here shows that PB-OppNet is better than existing methods in prediction accuracy for links, delivery delays, delivery success rates, etc.