Using semantics to learn about routing data for improved network management in the Future Internet
暂无分享,去创建一个
[1] D. Watts. Networks, Dynamics, and the Small‐World Phenomenon1 , 1999, American Journal of Sociology.
[2] Evgeniy Gabrilovich,et al. Computing Semantic Relatedness Using Wikipedia-based Explicit Semantic Analysis , 2007, IJCAI.
[3] Duncan J. Watts,et al. Collective dynamics of ‘small-world’ networks , 1998, Nature.
[4] Edward Fredkin,et al. Trie memory , 1960, Commun. ACM.
[5] Deep Medhi,et al. Network routing - algorithms, protocols, and architectures , 2007 .
[6] David W. Conrath,et al. Semantic Similarity Based on Corpus Statistics and Lexical Taxonomy , 1997, ROCLING/IJCLCLP.
[7] Wolfgang Nejdl,et al. Super-peer-based routing and clustering strategies for RDF-based peer-to-peer networks , 2003, WWW '03.
[8] Bert Wijnen,et al. An Architecture for Describing Simple Network Management Protocol (SNMP) Management Frameworks , 2002, RFC.
[9] Wolfgang Nejdl,et al. Routing and clustering in schema-based super peer networks , 2002 .
[10] Hector Garcia-Molina,et al. Comparing Hybrid Peer-to-Peer Systems , 2001, VLDB.
[11] Edsger W. Dijkstra,et al. A note on two problems in connexion with graphs , 1959, Numerische Mathematik.
[12] John Moy,et al. OSPF Version 2 , 1998, RFC.