• Title/Summary/Keyword: Download

Search Result 446, Processing Time 0.025 seconds

Fair Peer Assignment Scheme for Peer-to-Peer File Sharing

  • Hu, Chih-Lin;Chen, Da-You;Chang, Yi-Hsun;Chen, Yu-Wen
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.4 no.5
    • /
    • pp.709-735
    • /
    • 2010
  • The reciprocal virtue of peer-to-peer networking has stimulated an explosion of peer population and service capacity, ensuring rapid content distribution in peer-to-peer networks. Critical issues such as peer churn, free riding, and skewed workload significantly affect performance results such as service agility, fairness, and resource utilization. To resolve these problems systematically, this study proposes a peer assignment scheme that supports fair peer-to-peer file sharing applications. The proposed scheme exploits the peer duality of both server-oriented peer capacity and client-oriented peer contribution. Accordingly, the system server can prioritize download requests and appropriately assign server peers to uploading file objects. Several functional extensions, including peer substitution and elimination, bandwidth adjustment, and distributed modification, help cope with subtle situations of service starvation and download blocking, and hence make the system design robust and amenable. Simulation results show this design is examined under both centralized and distributed peer-to-peer environments. Performance results confirm that the proposed mechanisms are simple but effective in maintaining service agility and fairness, without loss of overall service capacity in peer-to-peer files sharing systems.

An Enhanced Remote Data Checking Scheme for Dynamic Updates

  • Dong, Lin;Park, Jinwoo;Hur, Junbeom;Park, Ho-Hyun
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.8 no.5
    • /
    • pp.1744-1765
    • /
    • 2014
  • A client stores data in the cloud and uses remote data checking (RDC) schemes to check the integrity of the data. The client can detect the corruption of the data using RDC schemes. Recently, robust RDC schemes have integrated forward error-correcting codes (FECs) to ensure the integrity of data while enabling dynamic update operations. Thus, minor data corruption can be recovered by FECs, whereas major data corruption can be detected by spot-checking techniques. However, this requires high communication overhead for dynamic update, because a small update may require the client to download an entire file. The Variable Length Constraint Group (VLCG) scheme overcomes this disadvantage by downloading the RS-encoded parity data for update instead of the entire file. Despite this, it needs to download all the parity data for any minor update. In this paper, we propose an improved RDC scheme in which the communication overhead can be reduced by downloading only a part of the parity data for update while simultaneously ensuring the integrity of the data. Efficiency and security analysis show that the proposed scheme enhances efficiency without any security degradation.

An Effective P2P Search Algorithm based on Distributed Processing of Multiple Peers (다중 피어 분산 처리 기반 효과적 P2P 검색 알고리즘)

  • Kim, Boon-Hee
    • Journal of the Korea Society of Computer and Information
    • /
    • v.11 no.5 s.43
    • /
    • pp.29-37
    • /
    • 2006
  • The distributed system is used that it's features of the fault tolerance and good performances. One of the distributed systems, a peer-to-peer tech, has high availability to share resources. However when peers wanna share resources, it isn't online like the peer using resources of the search time. Therefore we usually use the re-transmission method to download all resources. It's not good at the performance of the peer-to-peer system so we need to good solution. In this study, we wanna use the peer-to-peer system with the partner peer that works same download method simultaneously. We wanna have the effective performance to reduce the search stage additionally.

  • PDF

Management of Interactive Contents for Digital Broadcasting: Proper Use of Personal Video Recorder (디지털 방송의 양방향 콘텐츠 관리: 개인형 비디오 레코더를 중심으로)

  • Oh, Jong-Sir
    • The Journal of the Korea Contents Association
    • /
    • v.7 no.3
    • /
    • pp.87-92
    • /
    • 2007
  • This paper describes the personal video recorder-based approach to realise enhanced services for interactive programmes on digital television. So far it is very difficult that most of interactive programmes included the vast quantities of contents, whatsoever it is data-broadcasting or HD-ready, are broadcasted on digital television via the current set-top box. Furthermore it was not possible to envisage until IPTV has been appeared. Even though IPTV makes possible for streaming the interactive services via high-speed broadband, it is not easy to receive the tremendous contents with interactivity through the current set-top box in a single effort. In this paper it suggests the effective solution to resolve the download dilemma for providing the interactive services on digital television by employing the set-top box fitted with the personal video recorder.

An Effective Method to Reduce IPTV Channel Zapping Times using Pushed Number Key Information and Interval Time of the Events (IPTV에서 채널 번호 키 입력 이벤트가 발생 시 해당 숫자 정보와 이벤트간의 시간차를 활용하여 채널 변경 시간을 단축하는 방법)

  • Ryu, Joon-Hyuk;Youn, Hee-Yong
    • Journal of KIISE:Information Networking
    • /
    • v.37 no.6
    • /
    • pp.444-452
    • /
    • 2010
  • To avoid a channel zapping delay, the device needs to predict a next channel and must download it. Previous researches suggest algorithms based on assumption by utilizing many data. How to select and download future channels is a main issue in IPTV system. Most proposal based on assumption do not guarantees complete performance of channel zapping. In this paper, we suggest an effective method to avoid a channel zapping time with a constant performance by using a number remote controller key information.

Search Algorithm for Advanced Transmission Rate based on Probabilistic Proportion Search of Distributed Objects (분산 객체의 확률적 비례 검색 기반 전송률 향상 검색 알고리즘)

  • Kim, Boon-Hee
    • Journal of the Korea Society of Computer and Information
    • /
    • v.11 no.3
    • /
    • pp.49-56
    • /
    • 2006
  • A special feature of P2P distributed system isn't always the guarantee of online status for peers. In other words we want to download the file from the peer when we use the P2P system but it sometimes caused this system to fail the download. Many studies to resolve this problem depend on re-transmission method. It caused to lower performance so we have to resolve this problem. In this study, we analysis the average usage time of P2P application user and raise the resource transmission guarantee to apply the selection criteria of resource supplier. Moreover the combinations of distributed object replication techniques, the role to enhance the data transmission opportunity of high popularity resource. will cause this search algorithm to advance.

  • PDF

A Study on Characteristic Analysis and Countermeasure of Malicious Web Site (악성코드 유포 사이트 특성 분석 및 대응방안 연구)

  • Kim, Hong-seok;Kim, In-seok
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.29 no.1
    • /
    • pp.93-103
    • /
    • 2019
  • Recently, malicious code distribution of ransomware through a web site based on a drive-by-download attack has resulted in service disruptions to the web site and damage to PC files for end users. Therefore, analyzing the characteristics of the target web site industry, distribution time, application type, and type of malicious code that is being exploited can predict and respond to the attacker's attack activities by analyzing the status and trend of malicious code sites. In this paper, we will examine the distribution of malicious codes to 3.43 million websites in Korea to draw out the characteristics of each detected landing site, exploit site, and distribution site, and discuss countermeasures.

Design and Implementation of a Peer-to-Peer Data Sharing Scheme for Closed User Group with Security and Flexibility (보안성과 유연성을 갖춘 Peer-to-Peer 데이터 공유 기법의 설계 및 구현)

  • Lee Goo-Yeon;Lee Yong;Kim Hwa-Jong;Jeong Choong-Kyo;Lee Dong-Eun
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.15 no.4
    • /
    • pp.61-70
    • /
    • 2005
  • We propose and implement a flexible secure peer-to-peer(P2P) file sharing scheme which can be used for data sharing among closed user group (CUG) members. When a member wants to share data, notification messages are sent to the members with whom the member wants to share data. Each notification message includes one-time password encrypted with the receiver's public key. A member who received the notification message can download the data by using the one-time password. The proposed scheme provides selective sharing, download confirmation and efficient storage management. In terms of security, the proposed scheme supports authentication, entity privacy, replay attack protection and disguise prevention. We also implement the proposed system and find that the system is very useful among P2P service of closed user groups.

Design and Analysis of Online Advertising Expenditure Model based on Coupon Download (쿠폰 다운로드를 기준으로 하는 온라인 광고비 모델의 설계 및 분석)

  • Jun, Jung-Ho;Lee, Kyoung-Jun
    • Journal of Intelligence and Information Systems
    • /
    • v.16 no.4
    • /
    • pp.1-19
    • /
    • 2010
  • In offline environment, unlike traditional advertising model through TV, newspaper, and radio, online advertising model draws instantaneous responses from potential consumers and it is convenient to assess. This kind of characteristics of Internet advertising model has driven the growth of advertising model among various Internet business models. There are, conventionally classified, CPM (Cost Per Mile), CPC (Cost Per Click), and CPS (Cost Per Sales) models as Internet advertising expenditure model. These can be examined in manners regarding risks that stakeholders should stand and degree of responsibility. CPM model that is based on number of advertisement exposure is mechanically exposed to users but not actually recognized by users resulting in risk of wasted expenditure by advertisers without any advertising effect. While on aspect of media, CPS model that is based on conversion action is the most risky model because of the conversion action such as product purchase is determined by capability of advertisers not that of media. In this regard, while there are issue of CPM and CPS models disadvantageously affecting only one side of Internet advertising business model value network, CPC model has been evaluated as reasonable both to advertisers and media, and occupied the largest segment of Internet advertising market. However, CPC model also can cause fraudulent behavior such as click fraud because of the competition or dishonest amount of advertising expenditure. On the user aspect, unintentionally accessed advertisements can lead to more inappropriate expenditure from advertisers. In this paper, we suggest "CPCD"(Cost Per Coupon Download) model. This goes beyond simple clicking of advertisements and advertising expenditure is exerted when users download a coupon from advertisers, which is a concept in between CPC and CPS models. To achieve the purpose, we describe the scenario of advertiser perspective, processes, participants and their benefits of CPCD model. Especially, we suggest the new value in online coupon; "possibility of storage" and "complement for delivery to the target group". We also analyze the working condition for advertiser by a comparison of CPC and CPCD models through advertising expenditure simulation. The result of simulation implies that the CPCD model suits more properly to advertisers with medium-low price products rather than that of high priced goods. This denotes that since most of advertisers in CPC model are dealing with medium-low priced products, the result is very interesting. At last, we contemplate applicability of CPCD model in ubiquitous environment.

The proposal of download based IPTV system using user-specific channel management (사용자 맞춤형 채널 관리를 이용한 다운로드 기반의 IPTV 시스템 제안)

  • Kim, Dae-Jin;Choi, Hong-Sub
    • Journal of Digital Contents Society
    • /
    • v.10 no.1
    • /
    • pp.61-71
    • /
    • 2009
  • While the broadband network and multimedia technology are being developed, the commercial market on digital contents as well as IPTV has been widely spreading. Especially IPTV is providing various useful services since it makes using multimedia contents easier and more convenient by combining the strong points of both TV and PC system. Until now, IPTV system has been focused on VoD service as a general usages. However, various IPTV services are recently demanded since they can have special features for some specific places and occasions. So in this paper, we propose a design of the download based IPTV system using user-specific channel management. At first, program contents previously scheduled by users are downloaded and are played at settop-box according to the prescribed time table. This system has some advantages of giving users easy access to any wanted media contents in anytime that is IPTV's characteristics. And we can increase stability of services by using time slot distributed download for contents. Because this service can be constructed and maintained at relatively low cost, we confirm that this service model is more suitable to some companies with small infrastructure and special purposes. Accordingly, in this paper, we look into necessary elements and define some protocols for system in order to help other developer build this system.

  • PDF