• Title/Summary/Keyword: Peer Network

Search Result 439, Processing Time 0.02 seconds

Efficient Content Sharing using the Selection of Minimum Forwarding Peers in an Ad Hoc Network (최소의 Forwarding Peer 선택을 통한 애드 혹 네트워크에서의 효율적 콘텐츠 분배 방법)

  • Kang, Seung-Seok
    • Journal of the Korea Society for Simulation
    • /
    • v.18 no.4
    • /
    • pp.165-173
    • /
    • 2009
  • Recent portable devices are so versatile that they have multiple communication channels and play several multimedia formats. Especially, many services are under development for users who connect Internet or nearby devices via WWAN (Wireless Wide Area Network) and/or WLAN (Wireless LAN). In case of paying the telecommunication cost proportional to the amount of data downloaded, it is necessary to reduce the cost by constructing a special ad hoc network in which each participating peer downloads a specific portion of the want-to-be-shared content over the payable WWAN channel and exchanges the remaining portion with other peers using the cost-free WLAN channel. If all peers participate in forwarding packets, some transmissions are redundant which results in the unnecessary consumption of bandwidth as well as the delayed content distribution time. In order to reduce the redundant transmission, this paper proposes both the excluding method which discourages some peers not to forward redundant packets, and the minimum cover set method in which only the minimum number of peers are in charge of forwarding packets. These two methods obviate redundant packet forwarding, and result in reduction of content distribution time by up to around 29%.

Novel Pre-pushing & Downloading Model in Mobile Peer-assisted Streaming Network

  • Lin, Fuhong;Zhou, Xianewi;Chen, Changjia
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.7 no.12
    • /
    • pp.3135-3148
    • /
    • 2013
  • The popularization of streaming networks and mobile devices brings a new kind of network called mobile peer-assisted streaming network. In this network, service provider not only offers downloading services, but also pre-pushes resources to users for caching. Users can download their demanded resources while working as servers for uploading the cached data. Also the mobile characteristic makes high package losing probability in this network. So we study how the service provider pre-pushes or the user downloads resources efficiently and effectively while considering the package losing in this paper. We build utility models for service provider and user, and solve the models using Bellman's theory to achieve Nash Equilibrium which shows the service provider's optimal pre-pushing speed and user's optimal downloading speed. The numerical simulation demonstrates the efficiency and effectiveness of our proposed pre-pushing and downloading scheme by comparing to the traditional scheme.

JXTA based P2P communication in MANET Networks (MANET 네트워크에서의 JXTA 기반의 P2P 통신)

  • Jeong Wang-Boo;Suh Hyun-Gon;Kim Ki-Hyung;Sohn Young-Ho
    • Proceedings of the Korea Society for Simulation Conference
    • /
    • 2005.05a
    • /
    • pp.139-143
    • /
    • 2005
  • The P2P is a network environment supporting data exchange which is directly connected peers without limit of existing server-client and intervening central server for resource or offered service with each peer. JXTA is a representative of P2P system. JXTA is a typical distributed computing model that proposed by Sun Microsystems. JXTA that doesn't require centralized services or resources is adaptable in extreme changes of network organization. MANET(Mobile Ad Hoc Network) is a representative wireless network that is composed of mobile nodes without infrastructure. So MANET establishes the path for the communication of each peers and maintains the newest routing information by exchanging routing information. In this paper, we propose a technique of JXTAMAUET which implements JXTA which is the P2P network system from the wireless network which is becoming the foundation of ubiquitous computing. For the performance evaluation of the JXTAMANET, we use simulation.

  • PDF

Design and Analysis of Fabrication Threat Management in Peer-to-Peer Collaborative Location Privacy

  • Jagdale, Balaso;Sugave, Shounak;Kolhe, Kishor
    • International Journal of Computer Science & Network Security
    • /
    • v.21 no.12spc
    • /
    • pp.399-408
    • /
    • 2021
  • Information security reports four types of basic attacks on information. One of the attacks is named as fabrication. Even though mobile devices and applications are showing its maturity in terms of performance, security and ubiquity, location-based applications still faces challenges of quality of service, privacy, integrity, authentication among mobile devices and hence mobile users associated with the devices. There is always a continued fear as how location information of users or IoT appliances is used by third party LB Service providers. Even adversary or malicious attackers get hold of location information in transit or fraudulently hold this information. In this paper, location information fabrication scenarios are presented after knowing basic model of information attacks. Peer-to-Peer broadcast model of location privacy is proposed. This document contains introduction to fabrication, solutions to such threats, management of fabrication mitigation in collaborative or peer to peer location privacy and its cost analysis. There are various infrastructure components in Location Based Services such as Governance Server, Point of interest POI repository, POI service, End users, Intruders etc. Various algorithms are presented and analyzed for fabrication management, integrity, and authentication. Moreover, anti-fabrication mechanism is devised in the presence of trust. Over cost analysis is done for anti-fabrication management due to nature of various cryptographic combinations.

Location-awareness based Hybrid P2P System (위치 인식 기반 계층형 P2P 시스템)

  • Min, Su-Hong;Cho, Dong-Sub
    • Proceedings of the KIEE Conference
    • /
    • 2007.04a
    • /
    • pp.448-450
    • /
    • 2007
  • Peer-to-Peer system has emerged as a popular model aiming at further utilizing Internet information and resources, complementing the available client-server services. However, the mechanism of peers randomly choosing logical neighbors without any knowledge about underlying physical location aware topology can cause serious performance degradation. In this paper, we consider the network distance between peers so that it helps peers select neighbors located at the nearest when they exchange queries for sharing of resources. To reduce the unnecessary signaling traffic and delay of query exchange, we propose a location aware topology based Hybrid P2P system. This system calculates the network distance which combines the direct measurement such as RTT (Round Trip Time) with geographic space of peers using IP address

  • PDF

Authentication Mechanism Implementation for Information Sharing in Peer-to-Peer Environment (Peer-to-Peer 환경에서의 정보 공유를 위한 인증 메커니즘 구현)

  • Lee, Jeong-Ki;Bae, Il-Ho;Lee, Cheol-Seung;Moon, Jung-Hwan;Park, Chan-Mo;Lee, Joon
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.6 no.7
    • /
    • pp.1120-1125
    • /
    • 2002
  • According as progress by information society, computer network use and enlargement of scale are accelerated more. Also, with good physician increase of information that is exchanged through computer network, security of network is embossed to controversial point that is new. Because P2P as that remove or weakens center server function is open network that can participate between each user, problem about authentication between each users is risen. If certain user in network i3 in open environment, this user must authenticate request about service to user who is admitted between each user to limit connection. This treatise proposed method to keep security in P2P environment to solve this and designed certification mechanism that quote Kerberos certification mechanism to mechanism that can share information safety in P2P environment.

An Efficient Resource Discovery Mechanism based on Distributed Location Information in Pure P2P Environments (순수 P2P 환경에서 분산된 위치 정보를 이용한 자원 검색 기법)

  • Kim In-suk;Kang Yong-hyeog;Eom Young Ik
    • Journal of KIISE:Information Networking
    • /
    • v.31 no.6
    • /
    • pp.573-581
    • /
    • 2004
  • Recently, the rapid growth of Internet technology and the deployment of high speed networks make many kinds of multimedia services possible. Preexisting multimedia services are designed based on the client/server model which has the problems such as the network failure and the low speed communication due to the high load on the central server. In order to solve these problems, peer-to-peer networks are introduced and expanded through Internet environments. In this paper, we propose a pure peer-to-peer network based resource discovery mechanism for multimedia services. In the proposed scheme, each host maintains the location information of resources which are recently requested by other hosts as well as that oi the replicas of local resources. The proposed scheme has the faster response time and incurs the smaller traffic than the preexisting discovery schemes in pure peer-to-peer network environments. Also, by decentralizing the location information and differentiating the reply path, our proposed scheme can solve the search result loss problem that occurs when the network is unsettled.

Mobile Agent Based Discovery Mechanism for Pure P2P Environments (순수 P2P 환경을 위한 이동 에이전트 기반 자원 검색 기법)

  • Kim, In-Suk;Kim, Moon-Jeong;Kim, Moon-Hyun;Kim, Ung-Mo;Eom, Young-Ik
    • The KIPS Transactions:PartD
    • /
    • v.10D no.2
    • /
    • pp.327-336
    • /
    • 2003
  • Recently the rapid growth of Internet and the construction of high speed networks make many kinds of multimedia services possible. But most of current multimedia services are designed being by client/server model, which incurs high load of central server. In order to solve this problem, we propose a peer-to-peer network-based discovery mechanism for multimedia services. In the proposed scheme, mobile agents that have autonomy and mobility are used to search the location of resources. Use of mobile agents can solve the loss problem of the search result that occurs when the network is unsettled in pure peer-to-peer network. It also supports interoperability in heterogeneous system environments. In the proposed scheme, each host maintains the location information of resources which are locally requested or recently requested by other hosts. So, the proposed scheme has faster response time than the pre-existing mechanisms in pure peer-to-peer network environments.

An Intelligent Performance based Hybrid P2P System for Distributed Resource Sharing (차별화된 성능 기반을 이용한 Hybrid P2P 시스템)

  • Min, Su-Hong;Cho, Dong-Sub
    • The Transactions of the Korean Institute of Electrical Engineers D
    • /
    • v.55 no.2
    • /
    • pp.62-64
    • /
    • 2006
  • The emerging peer-to-peer (P2P) model has recently gained a significant attention due to its high potential of sharing various resources among networked users. Super-peer based unstructured P2P systems have been found very effective by dividing the peers into two layers, super-peer and ordinary-peer Super-peers deal with all queries instead of ordinary-peers. The existing P2P systems assume all super-peers have equal responsibility and capabilities even if all super-peers have relative advantages and disadvantages. In this paper, we suggest the ISP2P (Intelligent Super-peer based P2P) which allows to select the best super peer to ordinary-peers. We classify super peers according as the capacity of an ordinary-peer a super-peer. We show that these considerations could improve the performance of the response time and Provide higher quality results to all peers in the network.

Design and implementation of the MAC protocol for underwater vehicle network (수중 이동체 통신망을 위한 접속제어 프로토콜의 설계 및 구현)

  • 신동우;임용곤;김영길
    • Journal of Ocean Engineering and Technology
    • /
    • v.11 no.4
    • /
    • pp.180-188
    • /
    • 1997
  • This paper proposes a new efficient MAC(Media Access Control) protocol to establish the ultrasonic communication network for underwater vehicles, which ensures a certain level of maximum throughput regardless of the propagation delay of ultrasonic and allows fast data transmission through the multiple ultrasonic communication channel. A MAC protocol for underwater communication network that allows 'peer-to-peer' communication between a surface ship and multiple underwater systems is designed, and the proposed control protocol is implemented for its verification.

  • PDF