Search Results - SPANNING trees

Relation: [1] S B Akers D Harel and B Krishnamurthy "The Star Graph: An Attractive Alternative to the Hypercube " Proceedings of the International Conference on Parallel Processing pp 393--400 1987 [2] F Bao Y Igarashi and S Ohring "Reliable Broadcasting in Product Networks " Discrete Applied Mathematics vol 83 pp 3--20 1998 [3] Q Y Chang M J Ma and J M Xu "Fault-tolerant Pancyclicity of Locally Twisted Cubes " Journal of University of Science and Technology of China vol 36 no 6 pp 607--610 and 673 2006 [4] Y S Chen T Y Juang and Y Y Shen "Congestion-Free Embedding of 2(n-k) Spanning Trees in an Arrangement Graph " Journal of System Architecture vol 47 pp 73--86 2001 [5] J Cheriyan and S Maheshwari "Finding Nonseparating Induced Cycles and Independent Spanning Trees in 3-Connected Graphs " Journal of Algorithm vol 9 pp 507--537 1988 [6] S A Choudum and V Sunitha "Augmented Cubes " Networks vol 40 no 2 pp 71--84 2002 [7] I Chung "Application of the Special Latin Squares to the Parallel Routing Algorithm on Hypercube " Journal of Korean Information Science Society vol 19 no 5 1992 [8] T H Cormen C E Leiserson R L Rivest and C Stein Introduction to Algorithms 2nd ed Cambridge MA: MIT Press 2002 [9] P Cull and S M Larson "The Mobius Cubes " IEEE Transactions on Computers vol 44 no 5 pp 647--659 1995 [10] S Curran O Lee and X Yu "Finding Four Independent Trees " SIAM Journal on Computing vol 35 pp 1023--1058 2006 [11] K Day and A Tripathi "Arrangement Graphs: A Class of Generalized Star Graphs " Information Processing Letters vol 42 no 5 pp 235--241 1992 [12] J Denes and A D Keedwell "Latin Squares and their Applications " Academic Press 1974 [13] E Efe "The Crossed Cube Architecture for Parallel Computation " IEEE Transactions on Parallel and Distributed Systems vol 3 no 5 pp 513--524 1992 [14] P Fragopoulou "Edge-Disjoint Spanning Trees on the Star Network with Applications to Fault Tolerance " IEEE Transactions on Computers vol 45 no 2 pp 174--185 1996 [15] P Fragopoulou and S G Akl "Optimal Communication Algorithms on Star Graphs Using Spanning Tree Constructions " Jounal of Parallel and Distributed Computing vol 24 no 1 pp 55--71 1995 [16] P Fraigniaud and C T Ho "Arc-Disjoint Spanning Trees on the Cube-Connected-Cycles Network " Proceedings of the International Conference on Parallel Processing vol 1 pp 225--229 1991 [17] J S Fu "Fault-Tolerant Cycle Embedding in the Hypercube " Parallel Computing vol 29 no 6 pp 821--832 2003 [18] Z Ge and S L Hakimi "Disjoint Rooted Spanning Trees with Small Depths in deBruijn and Kautz Graphs " SIAM Journal on Computing vol 26 pp 79--92 1997 [19] F Harary J P Hayes and H J Wu "A Survey of the Theory of Hypercube Graphs " Computational Mathematics and Applications vol 15 pp 277--289 1988 [20] T Hasunuma and H Nagamochi "Independent Spanning Trees with Small Depths in Iterated Line Digraphs " Discrete Aplied Mathematics vol 110 pp 189--211 2001 [21] P A J Hilbers M R J Koopman and J L A van de Snepscheut "The Twisted Cube " Proceeding of the Conference on Parallel Architectures and Languages Europe Volume I: Parallel Architectures pp 152--159 1987 [22] D W Hillis The Connection Machine Camgridge: MIT Press 1982 [23] A Huck "Independent Trees in Planar Graphs " Graphs and Combinatorics vol 15 pp 29--77 1999 [24] A Itai and M Rodeh "The Multi-Tree Approach to Reliability in Distributed Networks " Information and Computation vol 79 pp 43--59 1988 [25] Y Iwasaki Y KAjiwara K Obokata and Y Igarashi "Independent Spanning Trees of Chordal Rings " Information Processing Letters vol 69 pp 155--160 1999 [26] S L Johnsson "Communication E±cient Basic Linear Algebra Computations on Hypercube Architectures " Journal of Parallel and Distributed Computing vol 4 pp 133--172 1987 [27] S L Johnsson and C T Ho "Optimal Broadcasting and Personalized Communication in Hypercubes " IEEE Transactions on Computing vol 38 no 9 pp 1249--1268 1989 [28] A Labourel "Edge-Disjoint Spanning Trees in Triangulated Graphs on Surfaces and Application to Node Labeling " Preprint Submitted to Elsevier Science 2006 [29] S Latifi S Zheng and N Bagherzadeh "Optimal Ring Embedding in Hypercubes with Faulty Links " In Digest 22nd Symposium Fault-Tolerant Computing pp 178--184 1992 [30] C T Lin "Embedding k(n-k) Edge-Disjoint Spanning Trees in Arrangement Graphs " Journal of Parallel and Distributed Computing vol 63 pp 1277--1287 2003 [31] K Miura D Takahashi S Nakano and T Nishizeki "A Linear-Time Algorithm to Find Four Independent Spanning Trees in Four-Connected Planar Graphs " International Journal of Foundations of Computer Science vol 10 pp 195--210 1999 [32] V E M nad D Sarkar "Optimal Broadcasting on the Star Graph " IEEE Transactions Parallel and Distributed Systems vol 3 no 4 pp 389--396 1992 [33] S Nagai and S Nakano "A Linear-Time Algorithm to Find Independent Spanning Trees in Maximal Planar Graphs " Proceedings of 26th Workshop on Graph-Theoretic Concepts in Computer Science pp 290--301 2000 [34] K Obokata Y Iwasaki F Bao and Y Igarashi "Independent Spanning Trees of Product Graphs and their Construction " IEICE Transactions Fundamentals of Electronics Communications and Computer Sciences vol 79 pp 1894--1903 1996 [35] B Parhami Introduction to Parallel Processing: Algorithms and Architectures New Park: Plenum Press 1999 [36] M O Rabin "Efficient Dispersal of Information for Security Load Balancing and Fault Tolerance " Journal of the ACM vol 36 pp 335--348 1989 [37] P Ramanathan and K G Shin "Reliable Broadcast in Hypercube Multicomputers " IEEE Transaction on Computing vol 37 no 12 pp 1654--1657 1988 [38] Y Saad and M H Schultz "Topological Properties of Hypercube " IEEE Transactions on Computers vol 37 pp 867--872 1988 [39] J P Sheu C T Wu and T S Chen "An Optimal Broadcasting Algorithm without Message Redundancy in Star Graphs " IEEE Transactions Parallel and Distributed Systems vol 6 no 6 pp 653--658 1995 [40] N Singhvi and K Ghose "The Mcube: A Symmetrical Cube Based Network with Twisted Links " Proceeding of the 9th International Symposium of Parallel Processing pp 11--16 1995 [41] C Stunkel R Sivaram and D Panda "Implementing Multidestination Worms in Switch-Based Parallel Systems: Architectural Alternatives and their Impact " 24th ACM Annual International Symposium on Compter Architecture 1997 [42] T Y Sung M Y Lin and T Y Ho "Multiple-Edge-Fault Tolerance with Respect to Hypercubes " IEEE Transactions on Parallel and Distributed Systems vol 8 pp 187--192 1997 [43] S M Tang Y L Wang and Y H Leu "Optimal Independent Spanning Trees on Hypercubes " Journal of Information Science and Engineering vol 20 pp 143--155 2004 [44] S M Tang J S Yang J M Chang and Y L Wang "Parallel Construction of Independent Spanning Trees on Multidimensional Tori " Proceeding of the 24th Workshop on Combinatorial Mathematics and Computation Theory pp 85--93 2007 [45] Y C Tseng S H Chang and J P Sheu "Fault-Tolerant Ring Embedding in Star Graphs " IEEE Transactions Parallel and Distributed Systems vol 8 no 12 pp 1185--1195 1997 [46] Y C Tseng T Y Juang and C J Cnang "Congestion-Free Dilation-2 Embedding of Complete Binary Tree in Star Graphs " Networks vol 33 no 3 pp 221--231 1999 [47] Y C Tseng and J P Sheu "Toward Optimal Broadcast in a Star Graph Using Multiple Spanning Trees " IEEE Transactions on Computers vol 46 no 5 pp 593--599 1997 [48] D B West Introduction to Graph Theory 2nd ed Upper Saddle River NJ: Prentice Hall 2001 [49] C D Wu Optimal Fault-Tolerant Hamiltonicity of Star Graphs with Conditional Edge Faults Taiwan: National Cheng Kung University 2007 [50] C Y Wu Edge-Fault-Tolerant Hamiltonicity of Locally Twisted Cubes under Conditional Edge Faults Taiwan: National Cheng Kung University 2007 [51] J S Yang J M Chang S M Tang and Y L Wang "Reducing the Height of Independent Spanning Trees in Chordal Rings " IEEE Transactions on Parallel and Distributed Systems vol 18 no 5 2007 [52] J S Yang J M Chang Y L Wang and S M Tang "On the Independent Spanning Trees of Recursive Circulant Graphs G(cdm d) with d >= 3 " Proceeding of the 25th Workshop on Combinatorial Mathematics and Computation Theory 2008 [53] J S Yang S M Tang J M Chang and Y L Wang "Parallel Construction of Optimal Independent Spanning Trees on Hypercubes " Parallel Computing vol 33 pp 73--79 2007 [54] X Yang D Evans and G Megson "The Locally Twisted Cubes " International Journal of Computer Mathematics vol 82 no 4 pp 401--413 2005 [55] P Y Yu Node-Pancyclicity of Twisted Cubes Taiwan: National Cheng Kung University 2006; http://ir.lib.ncku.edu.tw/handle/987654321/21133; http://ir.lib.ncku.edu.tw/bitstream/987654321/21133/1/

Availability: http://ir.lib.ncku.edu.tw/handle/987654321/21133
http://ir.lib.ncku.edu.tw/bitstream/987654321/21133/1/

16

Dissertation/ Thesis

使用二元完美碼之有效率的路由查詢演算法 ; Efficient Routing Lookup Algorithms Using Binary Perfect Codes

Authors: 李紹楷, Li, Shuao-Kai

Contributors: 資訊工程學系碩博士班, 張燕光, Chang, Yeim-Kuan

Subject Terms: dynamic routing table, precomputation, BGP update, binomial spanning tree, Hamming code, binary perfect codes, Golay code, IP address lookup, 戈萊碼, BGP更新, 事先計算, 動態路由表, 路由位址查詢, 漢明碼, 二元完美碼, 二項展開樹

File Description: 145 bytes; application/octet-stream

Relation: [1] BGP Routing Table Analysis Reports http://bgp potaroo net/ [2] D Meyer "University of Oregon Route Views Archive Project" at http://archive routeviews org/ [3] A Brodnik S Carlsson M Degermark S Pink "Small Forwarding Tables for Fast Routing Lookups " ACM SIGCOMM pp 3-14 Sept 1997 [4] Y K Chang "Fast Binary and Multiway Prefix Searches for Packet Forwarding " Submitted for publication [5] S Deering and R Hinden RFC 2460 Internet Protocol Version 6 (IPv6) Specification [6] A Durand and C Huitema RFC 3194 The H-Density Ratio for Address Assignment Efficiency An Update on the H ratio [7] V Fuller T Li J Yu and K Varadhan "Classless inter-domain routing (CIDR): an address assignment and aggregation strategy " RFC 1519 Sept 1993 [8] E Horowitz S Sahni and D Mehta Fundamentals of Data Structure in C++ New York: W H Freeman 1995 [9] N F Huang S M Zhao J Y Pan and C A Su "A Fast IP Routing Lookup Scheme for Gigabit Switching Routers " in Proc INFOCOM pp 1429-1436 Mar 1999 [10] IPv6 Forum http://www ipv6forum com [11] K Kim S Sahni "An O(logn) Dynamic Router-Table Design " IEEE Transactions on Computers pp 351-363 Mar 2004 [12] B Lampson V Srinivasan and G Varghese "IP Lookups Using Multiway and Multicolumn Search " IEEE/ACM Transactions on Networking Vol 3 No 3 pp 324-334 Jun 1999 [13] H Lu S Sahni "Enhanced Interval Tree for Dynamic IP Router-Tables " IEEE Transactions on Computers pp 1615-1628 Dec 2004 [14] X Meng Z Xu B Zhang G Huston S Lu L Zhang "IPv4 Address Allocation and the BGP Routing Table Evolution " ACM SIGCOMM pp 71-80 Jan 2005 [15] D Meyer "University of Oregon Route Views Archive Project" at http://archive routeviews org/ [16] S Nilsson and G Karlsson "IP-Address Lookup Using LC-trie " IEEE Journal on selected Areas in Communications 17(6):1083-1092 June 1999 [17] K Sklower "A Tree-based Packet Routing Table for Berkeley Unix " Proc Winter Usenix Conf pp 93-99 1991 [18] M A Ruiz-Sanchez Ernst W Biersack and Walid Dabbous "Survey and Taxonomy of IP Address Lookup Algorithms " IEEE Network Magazine 15(2):8--23 March/April 2001 [19] M Waldvogel G Varghese J Turner and B Plattner "Scalable High-Speed IP Routing Lookups " ACM SIGCOMM pp 25-36 Sept 1997 [20] P C Wang C T Chan and Y C Chen "An Efficient IP Routing Lookup by Using Routing Interval " Journal of Communication and Networks pp 374-382 Mar 2001 [21] M Wang S Deering T Hain L Dunn "Non-random Generator for IPv6 Tables " in Proc 12th Annual IEEE Symposium of High Performance Interconnects pp 35-40 Aug 2004 [22] P Warkhede S Suri G Varghese "Multiway Range Trees: Scalable IP Lookup with Fast Updates " The International Journal of Computer and Telecommunications Networking pp 289-303 Feb 2004 [23] Yeim-Kuan Chang "Simple and fast IP lookups using binomial spanning trees ” Computer Communications 1-11 February 2005 [24] S Lin and D J Costello Error Control Coding Fundamentals and Applications Englewood Cliffs N J : Prentice Hall 1983 [25] S L Johnsson and C -T Ho “Optimum Broadcasting and Personalized Communication in Hypercubes” IEEE Transactions on Computers Vol 38 No 9 Sept 1989 [26] http://www-03 ibm com/chips/products/asics/products/ememory html 2003 [27] http://netflow internet2 edu “Internet2 NetFlow Statistics ” 2004; http://ir.lib.ncku.edu.tw/handle/987654321/20888; http://ir.lib.ncku.edu.tw/bitstream/987654321/20888/1/

Availability: http://ir.lib.ncku.edu.tw/handle/987654321/20888
http://ir.lib.ncku.edu.tw/bitstream/987654321/20888/1/

Narrow Search