Relevant bibliographies by topics / Peer-to-peer architecture (Computer networks) – Quality control

Academic literature on the topic 'Peer-to-peer architecture (Computer networks) – Quality control'

Author: Grafiati
Published: 4 June 2021
Last updated: 10 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Contents

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Peer-to-peer architecture (Computer networks) – Quality control.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Peer-to-peer architecture (Computer networks) – Quality control"

1

Alqahtani, Amal, Heba Kurdi, and Majed Abdulghani. "HadithTrust: Trust Management Approach Inspired by Hadith Science for Peer-to-Peer Platforms." Electronics 10, no. 12 (June 16, 2021): 1442. http://dx.doi.org/10.3390/electronics10121442.

Full text
Abstract:
Peer-to-peer (P2P) platforms are gaining increasing popularity due to their scalability, robustness and self-organization. In P2P systems, peers interact directly with each other to share resources or exchange services without a central authority to manage the interaction. However, these features expose P2P platforms to malicious attacks that reduce the level of trust between peers and in extreme situations, may cause the entire system to shut down. Therefore, it is essential to employ a trust management system that establishes trust relationships among peers. Current P2P trust management systems use binary categorization to classify peers as trustworthy or not trustworthy. However, in the real world, trustworthiness is a vague concept; peers have different levels of trustworthiness that affect their overall trust value. Therefore, in this paper, we developed a novel trust management algorithm for P2P platforms based on Hadith science where Hadiths are systematically classified into multiple levels of trustworthiness, based on the quality of narrator and content. To benchmark our proposed system, HadithTrust, we used two state-of-art trust management systems, EigenTrust and InterTrust, with no-trust algorithm as a baseline scenario. Various experimental results demonstrated the superiority of HadithTrust considering eight performance measures.
APA, Harvard, Vancouver, ISO, and other styles
2

Alaya, Bechir, and Rehanullah Khan. "QoS Enhancement In VoD Systems: Load Management And Replication Policy Optimization Perspectives." Computer Journal 63, no. 10 (July 1, 2020): 1547–63. http://dx.doi.org/10.1093/comjnl/bxaa060.

Full text
Abstract:
Abstract The amount of online video content is exponentially increasing, which spurs its access demands. Providing optimal quality of service (QoS) for this ever-increasing video data is a challenging task due to the number of QoS constraints. The system resources, the distributed system platform and the transport protocol thus all need to collaborate to guarantee an acceptable level of QoS for the optimal video streaming process. In this paper, we present a comprehensive survey on QoS management for the video-on-demand systems. First, we focus on load management and replication algorithms in content delivery networks and peer-to-peer (P2P) networks for their shortcomings. We also address the problem of admission control and resource allocation with the objectives of congestion avoidance and frame-loss reduction. Besides, we introduce and discuss various replication schemes. For both the client–server architecture and P2P networks, we highlight the need for a specific storage management policy to preserve system reliability and content availability. We also focus on content distribution and streaming protocols scaling. We deduce that content availability is linked to the characteristics and the performance of the streaming protocols. Finally, we create a comparison table that presents the different contributions of the discussed approaches as well as their limitations. We believe that such a comprehensive survey provides useful insights and contributes to the related domains.
APA, Harvard, Vancouver, ISO, and other styles
3

Lou, Xiaosong, and Kai Hwang. "Quality of data delivery in peer-to-peer video streaming." ACM Transactions on Multimedia Computing, Communications, and Applications 8, no. 1S (February 2012): 1–23. http://dx.doi.org/10.1145/2089085.2089089.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Gupta, Ankur, and Lalit K. Awasthi. "Toward a Quality-of-Service Framework for Peer-to-Peer Applications." International Journal of Distributed Systems and Technologies 1, no. 3 (July 2010): 1–23. http://dx.doi.org/10.4018/jdst.2010070101.

Full text
Abstract:
P2P networks have caught the imagination of the research community and application developers with their sheer scalability and fault-tolerance characteristics. However, only content-sharing applications based on the P2P concept have reached the desired level of maturity. The potential of the P2P concept for designing the next-generation of real-world distributed applications can be realized only if a comprehensive framework quantifying the performance related aspects of all classes of P2P applications is available. Researchers have proposed some QoS (Quality-of-Service) parameters for content-sharing P2P applications based on response time and delay, but these do not cover the gamut of application domains that the P2P concept is applicable to. Hence, this research paper proposes an early QoS framework covering various classes of P2P applications; content distribution, distributed computing and communication and collaboration. Early results from the prototype implementation of the Peer Enterprises framework (a cross-organizational P2P collaborative application) are used as a basis for formulation of the QoS parameters. The individual performance measures which comprise the QoS framework are also discussed in detail along with some thoughts on how these can be complied with. The proposed framework would hopefully lead to quantifiable Service-Level Agreements for a variety of peer-to-peer services and applications.
APA, Harvard, Vancouver, ISO, and other styles
5

Badis, Lyes, Mourad Amad, Djamil Aïssani, and Sofiane Abbar. "P2PCF: A collaborative filtering based recommender system for peer to peer social networks." Journal of High Speed Networks 27, no. 1 (March 29, 2021): 13–31. http://dx.doi.org/10.3233/jhs-210649.

Full text
Abstract:
The recent privacy incidents reported in major media about global social networks raised real public concerns about centralized architectures. P2P social networks constitute an interesting paradigm to give back users control over their data and relations. While basic social network functionalities such as commenting, following, sharing, and publishing content are widely available, more advanced features related to information retrieval and recommendation are still challenging. This is due to the absence of a central server that has a complete view of the network. In this paper, we propose a new recommender system called P2PCF. We use collaborative filtering approach to recommend content in P2P social networks. P2PCF enables privacy preserving and tackles the cold start problem for both users and content. Our proposed approach assumes that the rating matrix is distributed within peers, in such a way that each peer only sees interactions made by her friends on her timeline. Recommendations are then computed locally within each peer before they are sent back to the requester. Our evaluations prove the effectiveness of our proposal compared to a centralized scheme in terms of recall and coverage.
APA, Harvard, Vancouver, ISO, and other styles
6

Sizov, V. A., D. M. Malinichev, and V. V. Mochalov. "Improvement of the Regulatory Framework of Information Security for Terminal Access Devices of the State Information System." Open Education 24, no. 2 (April 22, 2020): 73–79. http://dx.doi.org/10.21686/1818-4243-2020-2-73-79.

Full text
Abstract:
The aim of the study is to increase the effectiveness of information security management for state information systems (SIS) with terminal access devices by improving regulatory legal acts that should be logically interconnected and not contradict each other, as well as use a single professional thesaurus that allows understanding and describe information security processes.Currently, state information systems with terminal access devices are used to ensure the realization of the legitimate interests of citizens in information interaction with public authorities [1].One of the types of such systems are public systems [2]. They are designed to provide electronic services to citizens, such as paying taxes, obtaining certificates, filing of applications and other information. The processed personal data may belong to special, biometric, publicly available and other categories [3]. Various categories of personal data, concentrated in a large volume about a large number of citizens, can lead to significant damage as a result of their leakage, which means that this creates information risks.There are several basic types of architectures of state information systems: systems based on the “thin clientpeer-to-peer network systems; file server systems; data processing centers; systems with remote user access; the use of different types of operating systems (heterogeneity of the environment); use of applications independent of operating systems; use of dedicated communication channels [4]. Such diversity and heterogeneity of state information systems, on the one hand, and the need for high-quality state regulation in the field of information security in these systems, on the other hand, require the study and development of legal acts that take into account primarily the features of systems that have a typical modern architecture of “thin customer". Materials and research methods. The protection of the state information system is regulated by a large number of legal acts that are constantly being improved with changes and additions to the content. At the substantive level, it includes many stages, such as the formation of SIS requirements, the development of a security system, its implementation, and certification. The protected information is processed in order to enforce the law and ensure the functioning of the authorities. The need to protect confidential information is determined by the legislation of the Russian Federation [5, 6]. Therefore, to assess the quality of the regulatory framework of information security for terminal access devices of the state information system, the analysis of the main regulatory legal acts is carried out and on the basis of it, proposals are developed by analogy to improve existing regulatory documents in the field of information security.Results. The paper has developed proposals for improving the regulatory framework of information security for terminal access devices of the state information system- for uniformity and unification, the terms with corresponding definitions are justified for their establishment in the documents of the Federal Service for Technical and Export Control (FSTEC) or Rosstandart;- rules for the formation of requirements for terminals, which should be equivalent requirements for computer equipment in the “Concept for the protection of computer equipment and automated systems from unauthorized access to information ".Conclusion. General recommendations on information protection in state information systems using the “thin client" architecture are proposed, specific threats that are absent in the FSTEC threat bank are justified, and directions for further information security for the class of state information systems under consideration are identified. Due to the large number of stakeholders involved in the coordination and development of unified solutions, a more specific consideration of the problems and issues raised is possible only with the participation of representatives of authorized federal executive bodies and business representatives for discussion.
APA, Harvard, Vancouver, ISO, and other styles
7

Yu, Zhen, William Sears, and Yong Guan. "PeerCredential: a reputation-based trust framework for Peer-to-Peer applications." International Journal of Information and Computer Security 1, no. 3 (2007): 256. http://dx.doi.org/10.1504/ijics.2007.013955.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

BEYAH, RAHEEM, RAGHUPATHY SIVAKUMAR, and JOHN COPELAND. "GALO: A DEPLOYABLE FRAMEWORK FOR PROVIDING BETTER THAN BEST-EFFORT QUALITY OF SERVICE." Journal of Interconnection Networks 07, no. 03 (September 2006): 319–51. http://dx.doi.org/10.1142/s0219265906001727.

Full text
Abstract:
In this paper we propose a deployable approach to improving QoS by using a generic, extendable, overlay architecture; the Generalized Application Layer Overlay (GALO). The goals of this work are to 1) create an overlay architecture which allows us to sample specific path quality metrics among different paths; 2) utilize the proposed overlay architecture in order to implement our proposed QoS-based routing schemes, Application Layer Switching (ALSW) and Application Layer Striping (ALST). Perhaps the most significant contribution of this research is that we are able to achieve better than best-effort QoS without modifying intermediate nodes (i.e., routers), thus encouraging immediate deployment. Additionally, this research is performed on an actual wide area network (WAN) testbed, comprised of universities across the nation. Also, we assemble this architecture as a peer-to-peer framework, encouraging collaborating individuals with average workstations to improve the QoS of their traffic.
APA, Harvard, Vancouver, ISO, and other styles
9

Huang, Junjie, Liang Tan, Sun Mao, and Keping Yu. "Blockchain Network Propagation Mechanism Based on P4P Architecture." Security and Communication Networks 2021 (August 4, 2021): 1–12. http://dx.doi.org/10.1155/2021/8363131.

Full text
Abstract:
Blockchain is a mainstream technology in which many untrustworthy nodes work together to maintain a distributed ledger with advantages such as decentralization, traceability, and tamper-proof. The network layer communication mechanism in its architecture is the core of the networking method, message propagation, and data verification among blockchain nodes, which is the basis to ensure blockchain’s performance and key features. When blocks are propagated in peer-to-peer (P2P) networks with gossip protocol, the high propagation delay of the protocol itself reduces the propagation speed of the blocks, which is prone to the chain forking phenomenon and causes double payment attacks. To accelerate the propagation speed and reduce the fork probability, this paper proposes a blockchain network propagation mechanism based on proactive network provider participation for P2P (P4P) architecture. This mechanism first obtains the information of network topology and link status in a region based on the internet service provider (ISP), then it calculates the shortest path and link overhead of peer nodes using P4P technology, prioritizes the nodes with good local bandwidth conditions for transmission, realizes the optimization of node connections, improves the quality of service (QoS) and quality of experience (QoE) of blockchain networks, and enables blockchain nodes to exchange blocks and transactions through the secure propagation path. Simulation experiments show that the proposed propagation mechanism outperforms the original propagation mechanism of the blockchain network in terms of system overhead, rate of data success transmission, routing hops, and propagation delay.
APA, Harvard, Vancouver, ISO, and other styles
10

Wang, Longze, Yu Xie, Delong Zhang, Jinxin Liu, Siyu Jiang, Yan Zhang, and Meicheng Li. "Credible Peer-to-Peer Trading with Double-Layer Energy Blockchain Network in Distributed Electricity Markets." Electronics 10, no. 15 (July 28, 2021): 1815. http://dx.doi.org/10.3390/electronics10151815.

Full text
Abstract:
Blockchain-based peer-to-peer (P2P) energy trading is one of the most viable solutions to incentivize prosumers in distributed electricity markets. However, P2P energy trading through an open-end blockchain network is not conducive to mutual credit and the privacy protection of stakeholders. Therefore, improving the credibility of P2P energy trading is an urgent problem for distributed electricity markets. In this paper, a novel double-layer energy blockchain network is proposed that stores private trading data separately from publicly available information. This blockchain network is based on optimized cross-chain interoperability technology and fully considers the special attributes of energy trading. Firstly, an optimized ring mapping encryption algorithm is designed to resist malicious nodes. Secondly, a consensus verification subgroup is built according to contract performance, consensus participation and trading enthusiasm. This subgroup verifies the consensus information through the credit-threshold digital signature. Thirdly, an energy trading model is embedded in the blockchain network, featuring dynamic bidding and credit incentives. Finally, the Erenhot distributed electricity market in China is utilized for example analysis, which demonstrates the proposed method could improve the credibility of P2P trading and realize effective supervision.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Peer-to-peer architecture (Computer networks) – Quality control"

1

Rakotoarivelo, Thierry Electrical Engineering &amp Telecommunications Faculty of Engineering UNSW. "Distributed discovery and management of alternate internet paths with enhanced quality of service." Awarded by:University of New South Wales. School of Electrical Engineering and Telecommunications, 2006. http://handle.unsw.edu.au/1959.4/27316.

Full text
Abstract:
The convergence of recent technology advances opens the way to new ubiquitous environments, where network-enabled devices collectively form invisible pervasive computing and networking environments around the users. These users increasingly require extensive applications and capabilities from these devices. Recent approaches propose that cooperating service providers, at the edge of the network, offer these required capabilities (i.e services), instead of having them directly provided by the devices. Thus, the network evolves from a plain communication medium into an endless source of services. Such a service, namely an overlay application, is composed of multiple distributed application elements, which cooperate via a dynamic communication mesh, namely an overlay association. The Quality of Service (QoS) perceived by the users of an overlay application greatly depends on the QoS on the communication paths of the corresponding overlay association. This thesis asserts and shows that it is possible to provide QoS to an overlay application by using alternate Internet paths resulting from the compositions of independent consecutive paths. Moreover, this thesis also demonstrates that it is possible to discover, select and compose these independent paths in a distributed manner within an community comprising a limited large number of autonomous cooperating peers, such as the fore-mentioned service providers. Thus, the main contributions of this thesis are i) a comprehensive description and QoS characteristic analysis of these composite alternate paths, and ii) an original architecture, termed SPAD (Super-Peer based Alternate path Discovery), which allows the discovery and selection of these alternate paths in a distributed manner. SPAD is a fully distributed system with no single point of failure, which can be easily and incrementally deployed on the current Internet. It empowers the end-users at the edge of the network, allowing them to directly discover and utilize alternate paths.
APA, Harvard, Vancouver, ISO, and other styles
2

Leung, Ka-ho Andrew. "Localized topology control in wireless peer-to peer file sharing networks." Click to view the E-thesis via HKUTO, 2005. http://sunzi.lib.hku.hk/hkuto/record/B32048208.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Leung, Ka-ho Andrew, and 梁嘉浩. "Localized topology control in wireless peer-to peer file sharing networks." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2005. http://hub.hku.hk/bib/B32048208.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Li, Yui-tung. "RMesh : a low-delay robust mesh for dynamic peer-to-peer streaming network /." View abstract or full-text, 2009. http://library.ust.hk/cgi/db/thesis.pl?CSED%202009%20LIY.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Xie, Wanxia. "Supporting Distributed Transaction Processing Over Mobile and Heterogeneous Platforms." Diss., Georgia Institute of Technology, 2005. http://hdl.handle.net/1853/14073.

Full text
Abstract:
Recent advances in pervasive computing and peer-to-peer computing have opened up vast opportunities for developing collaborative applications. To benefit from these emerging technologies, there is a need for investigating techniques and tools that will allow development and deployment of these applications on mobile and heterogeneous platforms. To meet these challenging tasks, we need to address the typical characteristics of mobile peer-to-peer systems such as frequent disconnections, frequent network partitions, and peer heterogeneity. This research focuses on developing the necessary models, techniques and algorithms that will enable us to build and deploy collaborative applications in the Internet enabled, mobile peer-to-peer environments. This dissertation proposes a multi-state transaction model and develops a quality aware transaction processing framework to incorporate quality of service with transaction processing. It proposes adaptive ACID properties and develops a quality specification language to associate a quality level with transactions. In addition, this research develops a probabilistic concurrency control mechanism and a group based transaction commit protocol for mobile peer-to-peer systems that greatly reduces blockings in transactions and improves the transaction commit ratio. To the best of our knowledge, this is the first attempt to systematically support disconnection-tolerant and partition-tolerant transaction processing. This dissertation also develops a scalable directory service called PeerDS to support the above framework. It addresses the scalability and dynamism of the directory service from two aspects: peer-to-peer and push-pull hybrid interfaces. It also addresses peer heterogeneity and develops a new technique for load balancing in the peer-to-peer system. This technique comprises an improved routing algorithm for virtualized P2P overlay networks and a generalized Top-K server selection algorithm for load balancing, which could be optimized based on multiple factors such as proximity and cost. The proposed push-pull hybrid interfaces greatly reduce the overhead of directory servers caused by frequent queries from directory clients. In order to further improve the scalability of the push interface, this dissertation also studies and evaluates different filter indexing schemes through which the interests of each update could be calculated very efficiently. This dissertation was developed in conjunction with the middleware called System on Mobile Devices (SyD).
APA, Harvard, Vancouver, ISO, and other styles
6

"Large deviation analysis of wireless P2P systems." 2012. http://library.cuhk.edu.hk/record=b5549136.

Full text
Abstract:
Abstract In this thesis, we consider the performance evaluation of peer-to-peer (P2P)streaming over wireless networks. Traditionally, P2P streaming has been implemented and analyzed extensively in wire line networks. As more and more devices are connected to the internet through wireless, however, it is critical to understand how wireless channel variability affects the performance of P2P systems. Weformulate the P2P streaming system as a queuing network, and analyze its performance based onthe large deviation principle. We are interested in characterizing the buffer underow probability, where users run of out content and cannot receive smooth video playback. As explicit analysis is very dicult with a nite number of users, we focus on characterizing the performance bounds when the number of users goes to innity, assuming that playback rate and buffer size both grow linearly with the number of users N. We show that the upper bound of buffer underow probability decays exponentially in N. We also compare the decay rate of bound in different channel models, and show that the Markov modulated channel leads to a faster decay rate than the I.I.D. model with the same expected channel capacities.
Leung, Kam Wong.
Thesis (M.Phil.)--Chinese University of Hong Kong, 2012.
Includes bibliographical references (leaves 50-52).
Abstract --- p.i
Acknowledgement --- p.iv
Chapter 1 --- Introduction --- p.1
Chapter 1.1 --- Background --- p.2
Chapter 1.1.1 --- Video Streaming --- p.2
Chapter 1.1.2 --- Large Deviations Theory --- p.4
Chapter 1.2 --- Related Works --- p.6
Chapter 2 --- System Model and Assumptions --- p.9
Chapter 2.1 --- System Model --- p.9
Chapter 2.2 --- Assumptions --- p.11
Chapter 2.3 --- Queuing Model --- p.12
Chapter 3 --- Performance of Large Network --- p.16
Chapter 3.1 --- Large Deviation Principle --- p.16
Chapter 3.2 --- Time I.I.D. Channel Model --- p.23
Chapter 3.3 --- Markov Modulated Channel --- p.29
Chapter 3.4 --- Performance Comparison of Channel Model: Time I.I.D. Model vs Markov Modulated Model --- p.31
Chapter 4 --- Simulation Result and Analysis. --- p.35
Chapter 4.1 --- Simulation Settings --- p.35
Chapter 4.2 --- The Performance Bounds of Different Playback Rates --- p.36
Chapter 4.3 --- The Performance Bounds for Different Channel Transition Matrix --- p.37
Chapter 5 --- Conclusion --- p.40
Chapter A --- Appendix --- p.42
Chapter A.1 --- Convexity of decay rate function for time I.I.D Model --- p.42
Chapter A.2 --- Condition for the Chernoff Bound hold --- p.44
Chapter A.3 --- Convergence of the Decay Rate Function --- p.44
Chapter A.4 --- Moment Generating Function of Markov Modulated Sources --- p.46
Chapter A.5 --- Limiting Probability Distribution of Capacity of Markov Channel --- p.47
Chapter A.6 --- Computation: Capacity p.d.f of Two States Markov Modulated Channel --- p.48
Bibliography --- p.50
APA, Harvard, Vancouver, ISO, and other styles

Books on the topic "Peer-to-peer architecture (Computer networks) – Quality control"

1

International Workshop on Networked Group Communication (5th 2003 Munich, Germany). Group communications and charges: Technology and business models : 5th COST 264 International Workshop on Networked Group Communications, NGC 2003 and 3rd International Workshop on Internet Charging and QoS Technologies, ICQT 2003, Munich, Germany, September 16-19, 2003 : proceedings. Berlin: Springer, 2003.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

International Workshop on Networked Group Communication (5th 2003 Munich, Germany). Group communications and charges: Technology and business models : 5th COST 264 International Workshop on Networked Group Communications, NGC 2003 and 3rd International Workshop on Internet Charging and QoS Technologies, ICQT 2003, Munich, Germany, September 16-19, 2003 : proceedings. Berlin: Springer, 2003.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

1965-, Stiller Burkhard, and International Workshop on Internet Charging and QoS Technologies (3rd : 2003 : Munich, Germany), eds. Group communications and charges: Technology and business models : 5th COST 264 International Workshop on Networked Group Communications, NGC 2003 and 3rd International Workshop on Internet Charging and QoS Technologies, ICQT 2003, Munich, Germany, September 16-19, 2003 : proceedings. Berlin: Springer, 2003.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

United States. Congress. House. Committee on Government Reform. Stumbling onto smut: The alarming ease of access to pornography on peer-to-peer networks : hearing before the Committee on Government Reform, House of Representatives, One Hundred Eighth Congress, March 13, 2003. Washington: U.S. G.P.O., 2003.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

(Editor), Burkhard Stiller, Georg Carle (Editor), Martin Karsten (Editor), and Peter Reichl (Editor), eds. Group Communications and Charges; Technology and Business Models: 5th COST264 International Workshop on Networked Group Communications, NGC 2003, and 3rd ... (Lecture Notes in Computer Science). Springer, 2003.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

US GOVERNMENT. Stumbling Onto Smut: The Alarming Ease of Access to Pornography on Peer-To-Peer Networks: Hearing Before the Committee on Government Reform. Government Printing Office, 2003.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
7

Network Economics For Next Generation Networks 6th International Workshop On Internet Charging And Qos Technologies Icqt 2009 Aachen Germany May 1115 2009 Proceedings. Springer, 2009.

Find full text
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Peer-to-peer architecture (Computer networks) – Quality control"

1

Ibrohimovna, Malohat, and Sonia Heemstra de Groot. "Fednets." In Digital Rights Management, 534–58. IGI Global, 2013. http://dx.doi.org/10.4018/978-1-4666-2136-7.ch025.

Full text
Abstract:
A personal network (PN) is a network of a user’s personal devices and services, cooperating with each other independently of their geographical location to provide ubiquitous services to the user. PNs can be the producers and consumers of the services, content and resources. They can also export the subsets of their personal resources and services to other PNs. In such cases, PNs may form a group-oriented secure network called a Federation of Personal Networks (Fednet). A Fednet is a temporal, ad-hoc opportunity or purpose driven network of PNs, in which PNs collaborate with each other to share resources and services in a peer-to-peer manner. A Fednet is a pervasive and ubiquitous computing technology that enables the users to enjoy cooperation and promises exciting opportunities for different applications in various fields, such as education, healthcare, entertainment, business and emergency.In this chapter, the authors discuss PN technology expanding on the concept of Fednet. They provide example scenarios for Fednets, showing their potential impact to the quality of life of their users. Furthermore, they present the architecture and lifecycle of a Fednet. They explain the interactions of the main architectural components during its lifecycle and present a framework for the secure access control and management for a Fednet. The framework provides a controlled collaboration of PNs, where each PN controls the access to its resources and services. Finally, the authors provide a brief overview of some of the existing resource sharing group-oriented networks related to Fednets.
APA, Harvard, Vancouver, ISO, and other styles
2

Ibrohimovna, Malohat, and Sonia Heemstra de Groot. "Fednets." In Handbook of Research on P2P and Grid Systems for Service-Oriented Computing, 956–80. IGI Global, 2010. http://dx.doi.org/10.4018/978-1-61520-686-5.ch041.

Full text
Abstract:
A personal network (PN) is a network of a user’s personal devices and services, cooperating with each other independently of their geographical location to provide ubiquitous services to the user. PNs can be the producers and consumers of the services, content and resources. They can also export the subsets of their personal resources and services to other PNs. In such cases, PNs may form a group-oriented secure network called a Federation of Personal Networks (Fednet). A Fednet is a temporal, ad-hoc opportunity or purpose driven network of PNs, in which PNs collaborate with each other to share resources and services in a peer-to-peer manner. A Fednet is a pervasive and ubiquitous computing technology that enables the users to enjoy cooperation and promises exciting opportunities for different applications in various fields, such as education, healthcare, entertainment, business and emergency.In this chapter, the authors discuss PN technology expanding on the concept of Fednet. They provide example scenarios for Fednets, showing their potential impact to the quality of life of their users. Furthermore, they present the architecture and lifecycle of a Fednet. They explain the interactions of the main architectural components during its lifecycle and present a framework for the secure access control and management for a Fednet. The framework provides a controlled collaboration of PNs, where each PN controls the access to its resources and services. Finally, the authors provide a brief overview of some of the existing resource sharing group-oriented networks related to Fednets.
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Peer-to-peer architecture (Computer networks) – Quality control' for particular source types:
Journal articles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography