• Title/Summary/Keyword: IP Routing

Search Result 365, Processing Time 0.021 seconds

A Comparative Study on broadcasting video quality by Routing Protocols in IPTV Network (IPTV망에서 경로 배정 프로토콜에 따른 방송 화질 비교 연구)

  • Kim, Mi-Jin;Park, Seung-Seob
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2008.05a
    • /
    • pp.781-784
    • /
    • 2008
  • 최근 멀티미디어 콘텐츠가 빠르게 확산되고, 초고속 광대역 IP 네트워크 기술이 발전하면서 통신과 방송의 독자적 개별 서비스가 서로 공존하여 통합융합 서비스로 진화발전하고 있다. 대표적 방송/통신융합 서비스인 IPTV는 통합융합서비스의 가장 강력한 응용분야이며, IPTV와 같은 서비스들이 증가함으로 인해 다양한 인터넷 서비스를 구현하기 위해서 인터넷 프로토콜을 통한 고화질의 데이터 처리에 대한 관심이 통신업계의 화두로 등장하고 있다. 본 연구에서는 소규모에서 사용되는 표준 라우팅 프로토콜인, RIP 환경과 대규모 자율 네트워크에서 사용되는 링크 상태 라우팅 프로토콜인, OSPF 환경을 구현하여 IPTV 서비스 중에서 방송 화질의 PSNR값으로 성능을 측정하고 평가하여 효율적인 IPTV 서비스를 위한 네트워크 구축 방안을 제시하고자 한다.

Study on OSPF Routing Cost Functions for Wireless Environments (무선 환경을 고려한 OSPF 라우팅 비용함수 연구)

  • Shin, Dong Wook;Lee, Seung Hwan;Rhee, Seung Hyong;Lee, Hyung-Joo;Hoh, Mi-Jeong;Choi, Jeung-Won;Shin, Sang-Heon;Kim, Tae-Wan;Moon, Ho-Won
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.37C no.9
    • /
    • pp.829-840
    • /
    • 2012
  • Recently, in network communication environments, it is changing very fast from wired to wireless. The open shortest path firtst (OSPF), one of link state routing protocols, mainly used in wired networks, is the routing method to select optimal traffic path as identifying the link state of neighbor routers. The traditional OSPF cost functions performs with first fixed cost permanently, unless the router link is changed. However, in wireless networks, the performance of links show big difference by other environment factors. The bit error rate (BER), a parameter which can quite affect link state in wireless networks, is not considered in the traditional OSPF cost functions. Only a link bandwidth is considered in the traditional OSPF cost functions. In this paper, we verify the various parameters which can affect link performance, whether it is permissible to use as the parameter of proposed cost functions. To propose new cost functions, we use the effective bandwidth. This bandwidth is calculated by proposed formula using the BER of the network link and link bandwidth. As applied by the proposed triggering condition, the calculated effective bandwidth decrease the unstable of network by generating less link state update messages in wireless networks that frequently changes the link state. Simulation results show that the proposed cost functions significantly outperforms the traditional cost functions in wireless networks in terms of the services of VoIP and data transmission.

A Queue Management Algorithm for Improving Fairness in a Private Network (사설 망의 공정성을 향상시키기 위한 큐 관리 알고리즘)

  • Kang, Tae-Hyung;Koo, Ja-Hon;Chung, Kwang-Sue
    • Journal of KIISE:Information Networking
    • /
    • v.29 no.5
    • /
    • pp.524-532
    • /
    • 2002
  • With the recent rapid progress of Internet, the higher speed network is needed to support the exploration of ambient information from text-based to multimedia-based information. Also, demands for additional Layer 3 routing technique, such as Network Address Translator (NAT) and Firewall, are required to solve a limitation of a current Internet address space and to protect the interior network from the exterior network. However, current router-based algorithms do not provide mechanisms to solve the congestion and fairness problems, while supporting the multimedia services and satisfying the user requirements. In this paper, to solve these problems, a new active queue management, called MFRED (Multiple Fairness RED) algorithm, is proposed. This algorithm can efficiently reduce the congestion in a router or gateway based on the Layer 3 routing technique, such as NAT. This algorithm can improve the fairness among TCP-like flows and unresponsive flows. It also works well in fairly protecting congestion-sensitive flows, i.e. fragile TCP, from congestion-insensitive or congestion-causing flows, i.e. robust TCP.

Peer to Peer Anonymous Protocol Based Random Walk (랜덤 워크 기반의 P2P 익명 프로토콜)

  • Cho, Jun-Ha;Rhee, Hyun-Sook;Park, Hyun-A;Lee, Dong-Hoon
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.17 no.6
    • /
    • pp.65-76
    • /
    • 2007
  • The P2P file sharing system sends the results to users by searching the files in the shared folders. In the process of it, the problem is that the transferred information includes the pathname and file information and it can be revealed who searches which files. In related to this problem, anonymous file sharing P2P protocol has been an active research area where a number of works have been produced. However, the previous studies still have a few of weakness. Therefore, We propose two anonymous P2P file sharing protocols based on the decentralized and unstructured Random Walk. The first scheme uses the dynamic onion routing where the requester can receive the wanted file without knowing other peers' IDs. The second scheme uses the IP multicast method which lowers the computational overhead. Both of them are more suited for the dynamic P2P system.

A Study on Countermeasure for CCN Interest Flooding Attack (콘텐츠 중심 네트워킹 환경에서의 Interest Packet Flooding 대응 연구)

  • Kim, DaeYoub
    • Journal of Korea Multimedia Society
    • /
    • v.16 no.8
    • /
    • pp.954-961
    • /
    • 2013
  • To enhance the efficiency of network, content-centric networking (CCN), one of future Internet architectures, allows network nodes to temporally cache transmitted contents and then to directly respond to request messages which are relevant to previously cached contents. Also, since CCN uses a hierarchical content-name, not a host identity like source/destination IP address, for request/response packet routing and CCN request message does not include requester's information for privacy protection, contents-providers/ network nodes can not identify practical requesters sending request messages. So to send back relevant contents, network nodes in CCN records both a request message and its incoming interfaces on Pending Interest Table (PIT). Then the devices refer PIT to return back a response message. If PIT is exhausted, the device can not normally handle request/response messages anymore. Hence, it is needed to detect/react attack to exhaust PIT. Hence, in this paper, we propose improved detection/reaction schemes against attacks to exhaust PIT. In practice, for fine-grained control, this proposal is applied to each incoming interface. Also, we propose the message framework to control attack traffic and evaluate the performance of our proposal.

QoS-Aware Approach for Maximizing Rerouting Traffic in IP Networks

  • Cui, Wenyan;Meng, Xiangru;Yang, Huanhuan;Kang, Qiaoyan;Zhao, Zhiyuan
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.9
    • /
    • pp.4287-4306
    • /
    • 2016
  • Network resilience provides an effective way to overcome the problem of network failure and is crucial to Internet protocol (IP) network management. As one of the main challenges in network resilience, recovering from link failure is important to maintain the constancy of packets being transmitted. However, existing failure recovery approaches do not handle the traffic engineering problem (e.g., tuning the routing-protocol parameters to optimize the rerouting traffic flow), which may cause serious congestions. Moreover, as the lack of QoS (quality of service) restrictions may lead to invalid rerouting traffic, the QoS requirements (e.g., bandwidth and delay) should also be taken into account when recovering the failed links. In this paper, we first develop a probabilistically correlated failure model that can accurately reflect the correlation between link failures, with which we can choose reliable backup paths (BPs). Then we construct a mathematical model for the failure recovery problem, which takes maximum rerouting traffic as the optimizing objective and the QoS requirements as the constraints. Moreover, we propose a heuristic algorithm for link failure recovery, which adopts the improved k shortest path algorithm to splice the single BP and supplies more protection resources for the links with higher priority. We also prove the correctness of the proposed algorithm. Moreover, the time and space complexity are also analyzed. Simulation results under NS2 show that the proposed algorithm improves the link failure recovery rate and increases the QoS satisfaction rate significantly.

On Implementing and Deploying Label Distribution Protocol in MultiProtocal Label Switching Systems (MPLS시스템에서 LDP 기능 구현 및 활용 방안)

  • 김미희;이종협;이유경
    • Journal of KIISE:Information Networking
    • /
    • v.30 no.2
    • /
    • pp.270-281
    • /
    • 2003
  • ETF made the RFCs of MPLS technologies for providing the QoS of ATM or Frame Relay and the flexibility&scalability of IP on the Internet services. IETF has been expanding MPLS technologies as a common control component for supporting the various switching technologies called GMPLS. Also, IETF has standardized the signaling protocols based on such technologies, such as LDP, CR-LDP and RSVP-TE. ETRI developed the MPLS system based on ATM switch in order to provide more reliable services, differentiated services and value-added services like the VPN and traffic engineering service on the Korea Public Sector network. We are planning on deploying model services and commercial services on that network. This paper explains the basic functions of LDP, design and development of LDP on our system, and compares with LDP development and operation on other MPLS systems made by Cisco, Juniper, Nortel and Riverstone. In conclusion, this paper deduces the future services and applications by LDP through these explanation and comparison.

Comparison of the Average Latency Time of Overlay Multicast for Internet Broadcasting Service (인터넷방송 서비스를 위한 오버레이 멀티캐스트 기법의 평균 대기시간 비교)

  • Cho, Hye-Ran;Song, Bok-Sob;Kim, Jeong-Ho
    • The Journal of the Korea Contents Association
    • /
    • v.8 no.7
    • /
    • pp.58-65
    • /
    • 2008
  • The overlay multicast that has been recently presented as an alternative for the IP multicast has been getting much attention by the advancement of network techniques to enforce routing in application-levels. In this paper, we verified the efficiency of Internet broadcasting through comparing latency time of TBCP with mOBCP that have distributed Tree-first based spanning-tree structures in overlay multicast techniques. We also propose effective tree structures that minimize latency time and provide competent service by choosing optimum parent nodes early in the base of these two methods over the same time slot in multi-user connection. The results of our comparison showed that average latency time in mOBCP techniques declined by 36% from those of TBCP technique.

Low Power Level-Up/Down Shifter with Single Supply for the SoC with Multiple Supply (다중전원 SoC용 저전력 단일전원 Level-Up/Down Shifter)

  • Woo, Young-Mi;Kim, Doo-Hwan;Cho, Kyoung-Rok
    • The Journal of the Korea Contents Association
    • /
    • v.8 no.3
    • /
    • pp.25-31
    • /
    • 2008
  • We propose a low power level-up/down shifter with single supply that can be used at SoC with multiple supply. The proposed circuit interfaces IPs which are operated on the different supply voltages. The circuit is designed with a single supply that decreases the low power consumption and the complexity of supply routing and layout. The proposed circuit operated at 500MHz for level-up and at 1GHz for level-down. The level-up/down shifter improves noise immunity of the system at I/O circuit. The circuit is evaluated for 1.8V, 2.5V, 3.3V supply with 0.18um CMOS technology, respectively.

Wireless DDoS Attack Detection and Prevention Mechanism using Packet Marking and Traffic Classification on Integrated Access Device (IAD 기반 패킷 마킹과 유무선 트래픽 분류를 통한 무선 DDoS 공격 탐지 및 차단 기법)

  • Jo, Je-Gyeong;Lee, Hyung-Woo;Park, Yeoung-Joon
    • The Journal of the Korea Contents Association
    • /
    • v.8 no.6
    • /
    • pp.54-65
    • /
    • 2008
  • When DDoS attack is achieved, malicious host discovering is more difficult on wireless network than existing wired network environment. Specially, because wireless network is weak on wireless user authentication attack and packet spoofing attack, advanced technology should be studied in reply. Integrated Access Device (IAD) that support VoIP communication facility etc with wireless routing function recently is developed and is distributed widely. IAD is alternating facility that is offered in existent AP. Therefore, advanced traffic classification function and real time attack detection function should be offered in IAD on wireless network environment. System that is presented in this research collects client information of wireless network that connect to IAD using AirSensor. And proposed mechanism also offers function that collects the wireless client's attack packet to monitoring its legality. Also the proposed mechanism classifies and detect the attack packet with W-TMS system that was received to IAD. As a result, it was possible for us to use IAD on wireless network service stably.