Sciweavers

1815 search results - page 328 / 363
» Path Planning for Network Performance
Sort
View
INFOCOM
2005
IEEE
14 years 1 months ago
FISSIONE: a scalable constant degree and low congestion DHT scheme based on Kautz graphs
Abstract— The distributed hash table (DHT) scheme has become the core component of many large-scale peer-to-peer networks. Degree, diameter, and congestion are important measures...
Dongsheng Li, Xicheng Lu, Jie Wu
PAM
2004
Springer
14 years 1 months ago
Reordering of IP Packets in Internet
We have analyzed the measurements of the end-to-end packet reordering by tracing UDP packets between 12 testboxes of RIPE NCC. We showed that reordering quite often happens in Inte...
Xiaoming Zhou, Piet Van Mieghem
ICNP
2002
IEEE
14 years 19 days ago
Analysis of the MED Oscillation Problem in BGP
The Multi Exit Discriminator (MED) attribute of the Border Gateway Protocol (BGP) is widely used to implement “cold potato routing” between autonomous systems. However, the us...
Timothy Griffin, Gordon T. Wilfong
SIGMOD
2010
ACM
239views Database» more  SIGMOD 2010»
14 years 16 days ago
Computing label-constraint reachability in graph databases
Our world today is generating huge amounts of graph data such as social networks, biological networks, and the semantic web. Many of these real-world graphs are edge-labeled graph...
Ruoming Jin, Hui Hong, Haixun Wang, Ning Ruan, Yan...
GIS
2009
ACM
14 years 9 days ago
Machine learning approach to report prioritization with an application to travel time dissemination
This paper looks at the problem of data prioritization, commonly found in mobile ad-hoc networks. The proposed general solution uses a machine learning approach in order to learn ...
Piotr Szczurek, Bo Xu, Jie Lin, Ouri Wolfson