Sciweavers

1990 search results - page 327 / 398
» 2 P2P or Not 2 P2P
Sort
View
DM
2008
72views more  DM 2008»
15 years 6 months ago
(p, 1)-Total labelling of graphs
A (p, 1)-total labelling of a graph G is an assignment of integers to V (G) E(G) such that: (i) any two adjacent vertices of G receive distinct integers, (ii) any two adjacent ed...
Frédéric Havet, Min-Li Yu
AP2PC
2003
Springer
15 years 11 months ago
Fuzzy Cost Modeling for Peer-to-Peer Systems
The objective of query optimizers is to select a good execution plan for a given query. In a distributed system, it is crucial for a query optimizer to have effective remote cost e...
Bo Ling, Wee Siong Ng, Yanfeng Shu, Aoying Zhou
ESORICS
2010
Springer
15 years 7 months ago
Optimistic Fair Exchange with Multiple Arbiters
Fair exchange is one of the most fundamental problems in secure distributed computation. Alice has something that Bob wants, and Bob has something that Alice wants. A fair exchang...
Alptekin Küpçü, Anna Lysyanskaya
INFOCOM
2009
IEEE
16 years 21 days ago
Identifying High Cardinality Internet Hosts
—The Internet host cardinality, defined as the number of distinct peers that an Internet host communicates with, is an important metric for profiling Internet hosts. Some examp...
Jing Cao, Yu Jin, Aiyou Chen, Tian Bu, Zhi-Li Zhan...
P2P
2007
IEEE
101views Communications» more  P2P 2007»
16 years 10 days ago
Grid Resource Scheduling with Gossiping Protocols
Abstract— Grid resource providers can use gossiping to disseminate their available resource state to remote regions of the grid to attract application load. Pairwise gossiping pr...
Deger Cenk Erdil, Michael J. Lewis