• Title/Summary/Keyword: overlay networks

Search Result 123, Processing Time 0.026 seconds

Open IPTV Platform using Overlay Multicast and Content Delivery Network (오버레이 멀티캐스트 및 콘텐츠 전달 네트워크를 적용한 개방형 IPTV 플랫폼)

  • Jung, Seung-Moon;Kang, Im-Chul;Jeon, Jin-Han
    • The Journal of the Korea Contents Association
    • /
    • v.9 no.12
    • /
    • pp.528-536
    • /
    • 2009
  • Recently, the importance of IPTV providing multimedia service over IP based networks managed to provide the required level of quality of service and experience, security, interactivity and reliability has been gradually increasing by the commercialization of its service. However, the original purposes of IPTV service - contents are produced and consumed anytime, anywhere, and over any device at the same time - have not been satisfied by service providers because most services offered by service providers depend on closed IPTV platform. In this paper, we propose an open IPTV service platform that an individual or small company can easily produce contents and offer IPTV service independently from the existing closed IPTV platform.. The proposed IPTV platform exploits overlay multicast scheme to offer reasonable service under the environment where network bandwidth and processor resource are limited. It also uses CDN-like scheme to ensure the quality of transmitted contents. The performance evaluation shows that the proposed IPTV platform has the possibility of being an open IPTV platform considering its results such as the quality of transmitted contents, the transmission rate, the channel zapping time, and so on. It also shows that proposed IPTV platform could be applied to real IPTV service with continuous enhancement of its functions and user interfaces.

Overlay Multicast for File Distribution using Virtual Sources (파일전송의 성능향상을 위한 다중 가상소스 응용계층 멀티캐스트)

  • Lee Soo-Jeon;Lee Dong-Man;Kang Kyung-Ran
    • Journal of KIISE:Information Networking
    • /
    • v.33 no.4
    • /
    • pp.289-298
    • /
    • 2006
  • Algorithms for application-level multicast often use trees to deliver data from the source to the multiple receivers. With the tree structure, the throughput experienced by the descendant nodes will be determined by the performance of the slowest ancestor node. Furthermore, the failure of an ancestor node results in the suspension of the session of all the descendant nodes. This paper focuses on the transmission of data using multiple virtual forwarders, and suggests a scheme to overcome the drawbacks of the plain tree-based application layer multicast schemes. The proposed scheme elects multiple forwarders other than the parent node of the delivery tree. A receiver receives data from the multiple forwarders as well as the parent node and it can increase the amount of receiving data per time unit. The multiple forwarder helps a receiver to reduce the impact of the failure of an ancestor node. The proposed scheme suggests the forwarder selection algorithm to avoid the receipt of duplicate packets. We implemented the proposed scheme using MACEDON which provides a development environment for application layer multicast. We compared the proposed scheme with Bullet by applying the implementation in PlanetLab which is a global overlay network. The evaluation results show that the proposed scheme enhanced the throughput by 20 % and reduced the control overhead over 90 % compared with Bullet.

Naming Scheme and Its Implementation for the Network Management of Content Centric Networking Integrated with SNMP (SNMP를 연동한 콘텐츠 중심 네트워킹 망관리를 위한 이름 구조 및 이의 구현)

  • Kim, Kwangsoo;Roh, Byeong-hee
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.7 no.5
    • /
    • pp.119-126
    • /
    • 2018
  • Content-centric networking (CCN) is a future Internet technology to reorganize the paradigm of end-to-end communication of the current IP-based Internet architecture into a content-based paradigm. In managing such new networks, the network management is one of the most important functions. The standard for typical network management in existing IP networks is Simple Network Management Protocol (SNMP). Though there have been several works to implement network management functions on CCN, they have their own limitations to apply them to pure CCN operational environments. The basic reason of the limitation is that existing methods operate in an IP-overlay structure, or do not support push-type information exchange. In this paper, we propose a new naming structure that can accommodate both pull and push-type SNMP methods for CCN network management with SNMP. Then, methods to support GET and TRAP methods as well as a SET method of SNMP in the pure CCN environment using the proposed naming structure are proposed. We implement the proposed method using CCNx, and construct a CCN network testbed to validate the effectiveness of the proposed method by monitoring appropriate exchange of SNMP messages over the testbed.

A Hierarchical Construction of Peer-to-Peer Systems Based on Super-Peer Networks (Super-Peer 네트워크에 기반을 둔 Peer-to-Peer 시스템의 계층적 구성)

  • Chung, Won-Ho
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.16 no.6
    • /
    • pp.65-73
    • /
    • 2016
  • Peer-to-Peer (P2P) systems with super-peer overlay networks show combined advantages of both hybrid and pure P2P systems. Super-peer is a special peer acting as a server to a cluster of generic peers. Organizing a super-peer network is one of important issues for P2P systems with super-peer networks. Conventional P2P systems are based on two-level hierarchies of peers. One is a layer for generic peers and the other is for super-peers. And it is usual that super-peer networks have forms of random graphs. However, for accommodating a large-scale collection of generic peers, the super-peer network has also to be extended. In this paper, we propose a scheme of hierarchically constructing super-peer networks for large-scale P2P systems. At first, a two-level tree, called a simple super-peer network, is proposed, and then a scheme of generalizing and then extending the simple super-peer network to multi-level super-peer network is presented to construct a large-scale super-peer network. We call it an extended super-peer network. The simple super-peer network has several good features, but due to the fixed number of levels, it may have a scalability problem. Thus, it is extended to k-level tree of a super-peer network, called extended super-peer network. It shows good scalability and easy management of generic peers for large scale P2P system.

A Study on Logical Cooperative Entity-Based Multicast Architecture Supporting Heterogeneous Group Mobility in Mobile Ad Hoc Networks (Mobile Ad Hoc 네트워크에서 이질적 그룹 이동성을 지원하는 논리적 협업 개체 기반의 멀티캐스트 구조 연구)

  • Kim, Kap-Dong;Kim, Sang-Ha
    • The KIPS Transactions:PartC
    • /
    • v.14C no.2
    • /
    • pp.171-178
    • /
    • 2007
  • In mobile ad hoc networks, an application scenario requires mostly group mobility behavior in the mix of group moving nodes and individually moving nodes. The nodes of those applications tend to belong to the movement group with similar movement behavior. Group mobility is one of the good methods to improve scalability, and reduces the protocol overhead. In this paper, we propose the multicast architecture which regards nodes that have equal group mobility in the heterogeneous group mobility network as the single entity with the multiple interfaces and composes multicast tree, The logical cooperative entity-based multicast architecture accommodates the scalability, the multicast tree simplification, and the protocol overhead reduction which arc obtained from the hierarchical multicast architecture, while it maintains the nat multicast architecture for the data transmission. It also prevents the concentration of the energy consumption dispersing data forwarding load into the several ingress/egress nodes. Results obtained through simulations show that logical cooperative entity based multicast protocol with multiple interfaces offers the protocol scalability and the efficient data transmission.

An Energy-Efficient Mobile P2P Streaming Structure Using Agent Peers (에이전트 피어를 이용한 에너지 효율적인 모바일 P2P 스트리밍 구조)

  • Kim, Sang-Jin;Kim, Eun-Sam
    • Journal of the Korea Society of Computer and Information
    • /
    • v.16 no.2
    • /
    • pp.121-129
    • /
    • 2011
  • With advances in wireless networks and advent of powerful mobile devices such as smart phones, the demand for mobile IPTV services has been increasing. It is essential to minimize the energy consumption of mobile devices because their battery capacity is limited. In this paper, we therefore propose a new streaming structure in P2P-based mobile IPTV systems to minimize the energy consumption of mobile peers using agent peers. Agent peers can decrease the energy consumption of mobile peers significantly by performing streaming functionality and exchanging control messages for joining and leaving overlay networks in place of corresponding mobile peers. Finally, by simulation experiments using an energy model, we show that our proposed streaming structure can increase the lifetime of mobile peers using agent peers.

MADF: Mobile-Assisted Data Forwarding for Wireless Data Networks

  • Xiaoxin;Gary, Shueng-Han;Biswanath;Bharat
    • Journal of Communications and Networks
    • /
    • v.6 no.3
    • /
    • pp.216-225
    • /
    • 2004
  • In a cellular network, if there are too many data users in a cell, data may suffer long delay, and system's quality-of-service (QoS) will degrade. Some traditional schemes such as dynamic channel-allocation scheme (DCA) will assign more channels to hot (or overloaded) cells through a central control system (CC) and the throughput increase will be upper bounded by the number of new channels assigned to the cell. In mobile-assisted data forwarding (MADF), we add an ad-hoc overlay to the fixed cellular infrastructure and special channels-called forwarding channels- are used to connect mobile units in a hot cell and its surrounding cold cells without going through the hot cell's base station. Thus, mobile units in a hot cell can forward data to other cold cells to achieve load balancing. Most of the forwarding-channel management work in MADF is done by mobile units themselves in order to relieve the load from the CC. The traffic increase in a certain cell will not be upper bounded by the number of forwarding channels. It can be more if the users in hot cell are significantly far away from one another and these users can use the same forwarding channels to forward data to different cold neighboring cells without interference. We find that, in a system using MADF, under a certain delay requirement, the throughput in a certain cell or for the whole net-work can be greatly improved.

Mapping USN Route by Integrating Multiple Spatial Parameters into Radio Propagation Model (다중 공간변수와 전파예측 모델을 통합한 USN 중계 경로망도 제작)

  • Kim, Jin-Taek;Um, Jung-Sup
    • Journal of Korea Spatial Information System Society
    • /
    • v.10 no.1
    • /
    • pp.51-63
    • /
    • 2008
  • Previous studies for routing In USN (Ubiquitous Sensor Networks) appear to be unreliable due to the dependence on non-spatial data and the lack of map overlay analysis. Multiple spatial parameters and radio propagation modeling techniques were integrated to derive RSSI (Received Signal Strength Indicator) value between route nodes and produce a highly reliable path map. It was possible to identify area-wide patterns of USN route subject to many different Influences (e.g. the specific effects of radio blocking factors such as the visible area, road area, cell duplicated area, and building density), which cannot be acquired by traditional non-spatial modeling. The quantitative evidence concerning the USN route for individual cell as well as entire study area would be utilized as major tools to visualize paths in real-time and to select alternative path when failure or audition of route node occurs.

  • PDF

Weight Determination of Landslide Factors Using Artificial Neural Networks (인공신경 망을 이용한 산사태 발생요인의 가중치 결정)

  • 류주형;이사로;원중선
    • Economic and Environmental Geology
    • /
    • v.35 no.1
    • /
    • pp.67-74
    • /
    • 2002
  • The purpose of this study is to determine the weights of the factors for landslide susceptibility analysis using artificial neural network. Landslide locations were identified from interpretation of aerial photographs, field survey data, and topography. The landslide-related factors such as topographic slope, topographic curvature, soil drainage, soil effective thickness, soil texture, wood age and wood diameter were extracted from the spatial database in study area, Yongin. Using these factors, the weights of neural networks were calculated by backpropagation training algorithm and were used to determine the weight of landslide factors. Therefore, by interpreting the weights after training, the weight of each landslide factor can be ranked based on its contribution to the classification. The highest weight is topographic slope that is 5.33 and topographic curvature and soil texture are 1 and 1.17, respectively. Weight determination using backprogpagation algorithms can be used for overlay analysis of GIS so the factor that have low weight can be excluded in future analysis to save computation time.

A Content-Centric Routing on the Overlay Networks (오버레이 네트워크 상에서의 컨텐츠 중심의 라우팅)

  • Lee, Mun-Young;Ko, Dong-Il Diko;Cho, Ki-Deok;Kwon, Tae-Kyoung;Choi, Yang-Hee
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2008.06a
    • /
    • pp.213-218
    • /
    • 2008
  • 패킷 네트워크 이론과 TCP/IP를 기반으로 탄생한 인터넷은 월드 와이드 웹 (WWW)의 등장으로 인하여 엄청난 성장을 이룩하였으며, 가장 중요한 통신 인프라 역할을 수행하고 있다. 그러나 현재 인터넷의 사용 패턴은 일대일 통신이 아닌 대용량 컨텐츠 검색과 획득에 집중되고 있는 실정이다. 종단간 패러다임을 기반으로 하고 있는 현재 인터넷은 이러한 인터넷 사용패턴을 효율적으로 지원할 수 없다는 단점이 있다. 따라서 본 논문에서는 현재 인터넷의 사용패턴을 잘 지원할 수 있는 새로운 네트워크인 컨텐츠 중심 네트워크에서의 라우 팅 기법인 Content-Centric Routing (CCR)을 제안한다. CCR은 Reverse Path Forwarding (RFP)과 Store & Forward 방식을 채용함으로써, 컨텐츠 중심 라우팅 기법 중 가장 대표적인 기법인 Combined Broadcast and Content Based (CBCB) 라우팅 방식보다 대역폭 사용의 효율성 및 노드 실패/토폴로지 변화에 강한 대처 능력을 보인다.

  • PDF