#### Filter Results:

- Full text PDF available (43)

#### Publication Year

2003

2017

- This year (15)
- Last 5 years (54)
- Last 10 years (82)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Deke Guo, Jie Wu, Honghui Chen, Xueshan Luo
- Proceedings IEEE INFOCOM 2006. 25TH IEEE…
- 2006

A bloom filter is a simple, space-efficient, randomized data structure for concisely representing a static data set, in order to support approximate membership queries. It has great potential for distributed applications where systems need to share information about what resources they have. The space efficiency is achieved at the cost of a small… (More)

- Deke Guo, Jie Wu, Honghui Chen, Ye Yuan, Xueshan Luo
- IEEE Transactions on Knowledge and Data…
- 2010

A Bloom filter is an effective, space-efficient data structure for concisely representing a set, and supporting approximate membership queries. Traditionally, the Bloom filter and its variants just focus on how to represent a static set and decrease the false positive probability to a sufficiently low level. By investigating mainstream applications based on… (More)

- Deke Guo, Tao Chen, Dan Li, Mo Li, Yunhao Liu, Guihai Chen
- IEEE Trans. Computers
- 2013

A fundamental goal of data center networking is to efficiently interconnect a large number of servers with the low equipment cost. Several server-centric network structures for data centers have been proposed. They, however, are not truly expandable and suffer a low degree of regularity and symmetry. Inspired by the commodity servers in today’s data centers… (More)

- Deke Guo, Tao Chen, Dan Li, Yunhao Liu, Xue Liu, Guihai Chen
- INFOCOM
- 2011

A fundamental challenge in data centers is how to design networking structures for efficiently interconnecting a large number of servers. Several server-centric structures have been proposed, but are not truly expansible and suffer low degree of regularity and symmetry. To address this issue, we propose two novel structures called HCN and BCN, which utilize… (More)

- Deke Guo, Jie Wu, Honghui Chen, Xueshan Luo
- IEEE INFOCOM 2007 - 26th IEEE International…
- 2007

The topological properties of peer-to-peer overlay networks are critical factors that dominate the performance of these systems. Several non-constant and constant degree interconnection networks have been used as topologies of many peer-to-peer networks. One of these has many desirable properties: the Kautz digraph. Unlike interconnection networks,… (More)

- Deke Guo, Yunhao Liu, Xiang-Yang Li
- IEEE INFOCOM 2008 - The 27th Conference on…
- 2008

In order to improve scalability and reduce maintenance overhead for structured peer-to-peer systems, researchers design optimal architectures with constant degree and logarithmical diameter. The expected topologies, however, require the number of peers to be some given values determined by the average degree and the diameter. Hence, existing designs fail to… (More)

- Deke Guo, Hanhua Chen, +5 authors Guangqi Huang
- Inf. Process. Lett.
- 2010

a Key Laboratory of Science and Technology for C4ISR Technology, School of Information System and Management, National University of Defense Technology, Changsha Hunan 410073, China b School of Computer Science and Technology, Huazhong University of Science and Technology, Wuhan Hubei 430074, China c Department of Computer Science and Engineering, Hong Kong… (More)

- Deke Guo, Yunhao Liu, Xiang-Yang Li, Panlong Yang
- IEEE Transactions on Knowledge and Data…
- 2010

Bloom filter is effective, space-efficient data structure for concisely representing a data set and supporting approximate membership queries. Traditionally, researchers often believe that it is possible that a Bloom filter returns a false positive, but it will never return a false negative under well-behaved operations. By investigating the mainstream… (More)

- Junjie Xie, Deke Guo, Zhiyao Hu, Ting Qu, Pin Lv
- Computer Communications
- 2015

In this paper, we study the set reconciliation problem, in which each member of a node pair has a set of objects and seeks to deliver its unique objects to the other member. How could each node compute the set difference, however, is challenging in the set reconciliation problem. To address such an issue, we propose a lightweight but efficient method that… (More)