A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is application/pdf.
Filters
Clustering IP Addresses Using Longest Prefix Matching and Nearest Neighbor Algorithms
[chapter]
2004
Lecture Notes in Computer Science
Preserved Fulltext
In particular, the algorithm employs the longest prefix match as a similarity metric and uses an adaptation of the nearest neighbor algorithm for search to yield meaningful clusters. ...
This paper summarizes a new algorithm for clustering IP addresses. Unlike popular clustering algorithms such as k-means and DBSCAN, this algorithm is designed specifically for IP addresses. ...
Our Algorithm We have developed a new algorithm for clustering large IP address datasets that uses the longest prefix match as the similarity metric and an adaptation of the nearest neighbor heuristic ...
doi:10.1007/978-3-540-28633-2_116
fatcat:ax3ehvq33bcafgthndwvfrpmey
An Internet Protocol Address Clustering Algorithm
2008
USENIX Symposium on Operating Systems Design and Implementation
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Given (IP, property) labeled training data, we develop an IP-specific clustering algorithm that provides accurate predictions for unknown addresses in O(b) run time. ...
Against a live Internet latency data set, the algorithm outperforms IP-naïve learning methods and is fast in practice. ...
Acknowledgments We thank Steven Bauer, Bruce Davie, David Clark, Tommi Jaakkola and our reviewers for valuable insights. ...
dblp:conf/osdi/BeverlyS08
fatcat:hcovj23mmrge5nr7t3aqak3rry
A survey and comparison on overlay-underlay mapping techniques in peer-to-peer overlay networks
2018
International Journal of Communication Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
We have made a state-of-the-art review and comparison for addressing the overlay-underlay mismatch in terms of their operation, merits, limitations and future directions. ...
Some other optimizations propose use of P2P middleware to extract, process and refine underlay information and provide it to P2P overlay applications. ...
fields: Neighbor IP Address and Neighbor Distance is added in Gnutella 0.6 P2P protocol. ...
doi:10.1002/dac.3872
fatcat:m4zatuu7pncihcw3ckyosk4r3m
P2P traffic optimization
2011
Science China Information Sciences
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
P2P content providers rely on reverseengineering techniques to infer the underlying network topology and state, and build overlay topologies that match the underlying ones accordingly. ...
Technological details, comparison between these technologies and their applicabilities are presented, followed by a discussion of the issues that remain to be addressed and the direction of future content ...
By merging multiple BGP views, it is possible to obtain more fine-grained IP prefix set, and identify whether two IP addresses are within the same network by the longest prefix matching. ...
doi:10.1007/s11432-011-4464-8
fatcat:xptk7napgzbtbffexhlyae2m2a
Alleviating the topology mismatch problem in distributed overlay networks: A survey
2016
Journal of Systems and Software
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
One major weakness, identified early on, is the topology mismatch problem between the overlay network and the underlying IP topology. ...
They are often implemented via an overlay network abstraction atop the Internet's best-effort IP infrastructure. ...
LAPTOP's routing scheme is similar to the longest-prefix IP matching scheme. ...
doi:10.1016/j.jss.2015.11.038
fatcat:ghyhlwk2e5hl3akiydfnwyctlu
Towards an accurate AS-level traceroute tool
2003
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications - SIGCOMM '03
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Address registries are often incomplete and out-of-date. BGP routing tables provide a better IP-to-AS mapping, though this approach has significant limitations as well. ...
We also discuss how the improved IP-to-AS mapping allows us to home in on cases where the BGP and traceroute AS paths differ for legitimate reasons. ...
The work in [11] checked the source code for several IP stacks and tested the behavior of a Cisco 7500 router; only the Linux IP stack used the address of the outgoing interface in the TIME EXCEEDED ...
doi:10.1145/863993.863996
fatcat:com2ydfqufbf5hdmjsosehlkze
Towards an accurate AS-level traceroute tool
2003
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications - SIGCOMM '03
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Address registries are often incomplete and out-of-date. BGP routing tables provide a better IP-to-AS mapping, though this approach has significant limitations as well. ...
We also discuss how the improved IP-to-AS mapping allows us to home in on cases where the BGP and traceroute AS paths differ for legitimate reasons. ...
The work in [11] checked the source code for several IP stacks and tested the behavior of a Cisco 7500 router; only the Linux IP stack used the address of the outgoing interface in the TIME EXCEEDED ...
doi:10.1145/863955.863996
dblp:conf/sigcomm/MaoRWK03
fatcat:letvdanxubdfxo3hjkvv6crw7i
Efficiently Evaluating Order Preserving Similarity Queries over Historical Market-Basket Data
2006
22nd International Conference on Data Engineering (ICDE'06)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Given the non-metric nature of our measure, we develop some upper bounds and an algorithm that makes use of those bounds to prune histories that are guaranteed not to be in the answer set. ...
For instance, when the minimum length of a match is provided, our algorithm achieves up to an order of magnitude speed-up over alternative methods. ...
Acknowledgments This work is supported by Natural Sciences and Engineering Research Council of Canada. ...
doi:10.1109/icde.2006.59
dblp:conf/icde/SherkatR06
fatcat:2bt22fjsd5bn3citkb4t5asg2e
Into Summarization Techniques for IoT Data Discovery Routing
[article]
2021
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
Note that this fulltext copy is not of the "primary" version of this work. The version it corresponds to is:
2021 pre-print arXiv:2107.09558v1 fatcat:3wkmhqrydng3pgvbh4dxrweehe
Novel summarization algorithms, including alphabetical based, hash based, and meaning based summarization and their corresponding coding schemes are proposed. ...
Experimental results show that our summarization solution can reduce the routing table size by 20 to 30 folds with 2-5% increase in latency when compared with similar peer-to-peer discovery routing algorithms ...
Then, we cluster the root set into 2 E clusters of vector sets using the Kmean algorithm and each cluster becomes a child of the root. ...
arXiv:2107.09558v2
fatcat:2esq74urhfeotpf222eytb3moe
Tapestry: A Resilient Global-Scale Overlay for Service Deployment
2004
IEEE Journal on Selected Areas in Communications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2007; you can also visit the original URL.
The file type is application/pdf.
Tapestry supports a generic Decentralized Object Location and Routing (DOLR) API using a self-repairing, soft-state based routing layer. ...
This article presents the Tapestry architecture, algorithms, and implementation. It explores the behavior of a Tapestry deployment on PlanetLab, a global testbed of approximately 100 machines. ...
ACKNOWLEDGMENTS We would like to thank Kris Hildrum, Timothy Roscoe, the reviewers, and the OceanStore group for their insightful comments. ...
doi:10.1109/jsac.2003.818784
fatcat:jcyhx7mh3bg5refzoi4epym45u
Auto-Configuration in Wireless Sensor Networks: A Review
2019
Sensors
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Therefore, various auto-configuration approaches have been proposed to address the above challenges. ...
Therefore, configuration and updating are critical issues. In this paper, we discuss the issues of configuring and updating a wireless sensor network (WSN). ...
Then, based on the distance from the cluster head to a sink, the node will choose the nearest cluster and request an IP address. After that, the cluster head will respond via an ACK packet. ...
doi:10.3390/s19194281
fatcat:rh6z35xovzgi5isq72hv7u52va
Bayeux
2001
Proceedings of the 11th international workshop on Network and operating systems support for digital audio and video - NOSSDAV '01
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Bayeux leverages the architecture of Tapestry, a fault-tolerant, wide-area overlay routing and location network. ...
In this paper, we propose Bayeux, an efficient application-level multicast system that scales to arbitrarily large receiver groups while tolerating failures in routers and network links. ...
This approach is similar to longest prefix routing in the CIDR IP address allocation architecture [5] . ...
doi:10.1145/378344.378347
dblp:conf/nossdav/ZhuangZJKK01
fatcat:f5usfdnbdjgb7j4iosrvnsqaqy
Enhancement of Video Streaming in Distributed Hybrid Architecture
2016
Advances in Multimedia
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
The rapid growth of video on demand user brings congestion at the proxy server and on the overall network. ...
Optimized storage finding path search reduces the unnecessary query forward and hence increases the size of content delivery to the desired location. ...
Conflict of Interests The authors Soumen Kanrar and Niranjan Kumar Mandal declare that there is no conflict of interests regarding the publication of the paper. ...
doi:10.1155/2016/5429187
fatcat:ahko7kmxivcnnnr3swk232iswi
IoT Data Discovery: Routing Table and Summarization Techniques
[article]
2022
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
Other Versions
Novel summarization algorithms, including alphabetical, hash, and meaning-based summarization and their corresponding coding schemes, are proposed. ...
in keyword-based routing algorithms in unstructured networks. ...
Then, we cluster the root set into 2 + clusters of vector sets using the K-mean algorithm and each cluster becomes a child of the root. ...
arXiv:2203.10791v2
fatcat:7cdk77pwmjaqror7xqszbo3goa
ClouDiA
2012
Proceedings of the VLDB Endowment
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2013; you can also visit the original URL.
The file type is application/pdf.
By sharing resources and operating at scale, public clouds promise higher utilization and lower costs than private clusters. ...
In this paper, we propose ClouDiA, a general deployment advisor that selects application node deployments minimizing either (i) the largest latency between application nodes, or (ii) the longest critical ...
We thank the anonymous PVLDB reviewers for their insightful comments which helped us to improve this paper. ...
doi:10.14778/2535568.2448945
fatcat:yylwe55mdvhljlzt5farplmjoe
« Previous
Showing results 1 — 15 out of 318 results