Ming et al., 2011 - Google Patents
“Who Are Your Friends?”—A Simple Mechanism that Achieves Perfect Network FormationMing et al., 2011
View PDF- Document ID
- 6192187789867629463
- Author
- Ming F
- Wong F
- Marbach P
- Publication year
- Publication venue
- 2011 Proceedings IEEE INFOCOM
External Links
Snippet
A fundamental challenge in peer-to-peer and online social networks is the design of a simple, distributed algorithm that allows users to discover, and connect to, peers who closely match their interests or preferences. In this paper, we consider an algorithm that is based on …
- 230000015572 biosynthetic process 0 title abstract description 51
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network-specific arrangements or communication protocols supporting networked applications
- H04L67/10—Network-specific arrangements or communication protocols supporting networked applications in which an application is distributed across nodes in the network
- H04L67/104—Network-specific arrangements or communication protocols supporting networked applications in which an application is distributed across nodes in the network for peer-to-peer [P2P] networking; Functionalities or architectural details of P2P networks
- H04L67/1042—Network-specific arrangements or communication protocols supporting networked applications in which an application is distributed across nodes in the network for peer-to-peer [P2P] networking; Functionalities or architectural details of P2P networks involving topology management mechanisms
- H04L67/1044—Group management mechanisms
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network-specific arrangements or communication protocols supporting networked applications
- H04L67/10—Network-specific arrangements or communication protocols supporting networked applications in which an application is distributed across nodes in the network
- H04L67/104—Network-specific arrangements or communication protocols supporting networked applications in which an application is distributed across nodes in the network for peer-to-peer [P2P] networking; Functionalities or architectural details of P2P networks
- H04L67/1061—Network-specific arrangements or communication protocols supporting networked applications in which an application is distributed across nodes in the network for peer-to-peer [P2P] networking; Functionalities or architectural details of P2P networks involving node-based peer discovery mechanisms
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
- G06F17/30286—Information retrieval; Database structures therefor; File system structures therefor in structured data stores
- G06F17/30386—Retrieval requests
- G06F17/30424—Query processing
- G06F17/30533—Other types of queries
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
- G06F17/30861—Retrieval from the Internet, e.g. browsers
- G06F17/30864—Retrieval from the Internet, e.g. browsers by querying, e.g. search engines or meta-search engines, crawling techniques, push systems
- G06F17/30867—Retrieval from the Internet, e.g. browsers by querying, e.g. search engines or meta-search engines, crawling techniques, push systems with filtering and personalisation
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
- G06F17/3061—Information retrieval; Database structures therefor; File system structures therefor of unstructured textual data
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L63/00—Network architectures or network communication protocols for network security
- H04L63/14—Network architectures or network communication protocols for network security for detecting or protecting against malicious traffic
- H04L63/1408—Network architectures or network communication protocols for network security for detecting or protecting against malicious traffic by monitoring network traffic
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance or administration or management of packet switching networks
- H04L41/12—Arrangements for maintenance or administration or management of packet switching networks network topology discovery or management
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network-specific arrangements or communication protocols supporting networked applications
- H04L67/30—Network-specific arrangements or communication protocols supporting networked applications involving profiles
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/02—Topology update or discovery
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L43/00—Arrangements for monitoring or testing packet switching networks
Similar Documents
Publication | Publication Date | Title |
---|---|---|
Tang et al. | Location-aware collaborative filtering for QoS-based service recommendation | |
US9947060B2 (en) | Information matching and match validation | |
Liu et al. | A Generic Trust Framework for Large‐scale Open Systems Using Machine Learning | |
Shen et al. | Social-P2P: An online social network based P2P file sharing system | |
US9659214B1 (en) | Locally optimized feature space encoding of digital data and retrieval using such encoding | |
WO2015124424A1 (en) | Method and system for link prediction in mobile computing | |
Ming et al. | “Who Are Your Friends?”—A Simple Mechanism that Achieves Perfect Network Formation | |
Chiluka et al. | Personalizing eigentrust in the face of communities and centrality attack | |
Li et al. | Identifying influential nodes based on resistance distance | |
US9928313B2 (en) | Seasonal query suggestion system and method | |
Cervellini et al. | Finding trendsetters on yelp dataset | |
Du et al. | Rating network paths for locality-aware overlay construction and routing | |
Liu et al. | Ordinal random fields for recommender systems | |
Xie et al. | Personalized context-aware QoS prediction for web services based on collaborative filtering | |
Wang et al. | Practical characterization of large networks using neighborhood information | |
Frey et al. | Similitude: Decentralised adaptation in large-scale P2P recommenders | |
Fang et al. | Active exploration: simultaneous sampling and labeling for large graphs | |
Magureanu et al. | Epidemic trust-based recommender systems | |
Fan et al. | Overlapping community structure detection in multi-online social networks | |
Prasad et al. | A k-clique based clustering protocol for resource discovery in p2p network | |
Vu et al. | A probabilistic framework for decentralized management of trust and quality | |
Weng et al. | Trust-based collaborative filtering | |
Baralis et al. | Netcluster: A clustering-based framework to analyze internet passive measurements data | |
Manca et al. | Producing friend recommendations in a social bookmarking system by mining users content | |
Hsu et al. | Willingness maximization for ego network data extraction in multiple online social networks |