Legal claims defining the scope of protection, as filed with the USPTO.
1. A network comprising: a plurality of interconnected routers; wherein data is transmitted over said network through said interconnected routers; said data including an address, said address identifying at least a logical location of a destination of said data; wherein said address is divided into a plurality of pieces and at least a subset of said plurality of pieces are encrypted, and wherein said interconnected routers transmit said data along routes within said network based on decrypting different ones of said encrypted pieces at different points along each of said routes, and wherein address is divided at least in part by an aggregation of routers within a routing domain tree, wherein said routing domain tree is representative of the interconnections between said plurality of interconnected routers, said aggregation occurring to a plurality of routers which share a common parent route.
2. The network of claim 1 , wherein a subset of said interconnected routers is enabled to decrypt at least a piece of said address.
3. The network of claim 2 , wherein at least a first piece of said address is separately encrypted from the other pieces.
4. The network of claim 3 , wherein said subset of said interconnected routers is unable to decrypt at least a different piece of said address than said first piece.
5. The network of claim 1 , wherein said address is an IPv6 address.
6. The network of claim 1 , wherein, during a first period, said interconnected routers are enabled to decrypt at least a piece of said address, and further during said first period, said interconnected routers are enabled to decrypt at least said piece of said address, or another piece of said address, during a second period.
7. The network of claim 2 , wherein said subset of said interconnected routers are provided with a key to decrypt said at least a piece of said address.
8. The network of claim 7 , wherein said subset of said interconnected routers comprises routers of the same level, and said key is shared by said routers of the same level.
9. The network of claim 7 , wherein said subset of said interconnected routers comprises routers that share a common link, and said key is shared by said routers that share the common link.
10. The network of claim 7 , wherein said subset of said interconnected routers comprises at least a crossover router.
11. The network of claim 10 , wherein said key is shared by routers of the same level as said crossover router.
12. The network of claim 7 , wherein said subset of interconnected routers are configured in a logical tree.
13. The network of claim 3 , wherein said at least a first piece of said address is capable of being decrypted using a key.
14. The network of claim 1 , wherein said address includes a property such that as a result of a hash function on said address, an expected value is produced, said expected value being representative of a desired path of said data to said destination.
15. The network of claim 14 , wherein said expected value corresponds to a suffix of said address.
16. The network of claim 14 , wherein said expected value is included in said address.
17. The network of claim 14 , wherein said expected value is not explicitly contained in said address, but said address includes a pointer to said expected value, wherein said expected value is included in a table.
18. A network comprising: a plurality of interconnected routers; means for transmitting data over said network, wherein said data includes an address which identifies a destination of said data; dividing means for dividing said address into a plurality of pieces; encrypting means for encrypting at least a subset of said plurality of pieces, wherein said interconnected routers transmit said data along routes within said network based on decrypting different ones of said encrypted pieces at different points along each of said routes; and aggregation means for aggregating routers within a routing domain tree, wherein said routing domain tree is representative of the interconnections between said plurality of interconnected routers.
19. The network of claim 18 , wherein a subset of said interconnected routers comprise decryption means for decrypting at least a first piece of said address.
20. The network of claim 19 , wherein said encryption means further includes separate encryption means for separately encrypting at least said first piece of said address from the other pieces of said address.
21. The network of claim 20 , wherein said subset of said interconnected routers is unable to decrypt a different piece of said address than said first piece.
22. The network of claim 19 , wherein said decryption means includes a key for decrypting said at least a first piece of said address.
23. The network of claim 22 , wherein said subset of said interconnected routers comprises routers of the same level, and said key is shared by said routers of the same level.
24. The network of claim 22 , wherein said subset of said interconnected routers comprises routers that share a common link, and said key is shared by said routers that share a common link.
25. The network of claim 22 , wherein said subset of said interconnected routers comprises a crossover router, and said key is shared by said crossover router and at least an address generator server.
26. The network of claim 25 , wherein said key is additionally shared by routers of the same level as said crossover router.
27. The network of claim 22 , wherein said subset of interconnected routers are configured in a logical tree.
28. The network of claim 18 , wherein said address is an IPv6 address.
29. The network of claim 18 , further comprising first and second decryption means for separately decrypting at least a piece of said address, said first and second decryption means being provided to said interconnected routers during a first period, wherein said first decryption means is operable during said first period, and said second decryption means is operable during a second period.
30. The network of claim 18 , wherein said address include a property such that as a result of a hash function on said address, an expected value is produced, said expected value being representative of a destination of said address on a desired path.
31. The network of claim 30 , wherein said expected value corresponds to a suffix of said address.
32. The network of claim 30 , wherein said expected value is included in said address.
33. The network of claim 30 , wherein said expected value is not explicitly contained in said address, but said address includes a pointer to said expected value, wherein said expected value is included in a table.
34. A method for sharing data over a network, where said network includes a plurality of interconnected routers; said method comprising: transmitting data over said network, said data including an address; identifying in said address at least a logical location of a destination of said data; dividing said address into a plurality of pieces; encrypting at least a subset of said plurality of pieces, and wherein said interconnected routers transmit said data along routes within said network based on decrypting different ones of said encrypted pieces at different points along each of said routes, and wherein said encryption includes encrypting at least a first piece of said address separately from the other pieces; decrypting at least the first piece of said address within a subset of said interconnected routers said subset of interconnected routers being unable to decrypt at least a different piece of said address than said first piece; and dividing said address at least in part by an aggregation of routers within a routing domain tree, wherein said routing domain tree is representative of the interconnections between said plurality of interconnected routers, said aggregation occurring to a plurality of routers which share a common parent router.
35. The method of claim 34 , wherein said address is an IPv6 address.
36. The method of claim 34 , including decrypting at least a piece of said address during a first period, and, during said first period, receiving the ability to decrypt at least a piece of said address for a second period.
37. The method of claim 34 , including providing said subset of said interconnected routers with a key to decrypt said at least a piece of said address.
38. The method of claim 34 , including decrypting, with a key, said first piece of said address.
39. The method of claim 34 , including sharing said key with routers of the same level, wherein said level is comprised of said subset of said interconnected routers.
40. The method of claim 34 , including sharing said key with routers that share a common link, wherein said subset of said interconnected routers comprises routers that share a common link.
41. The method of claim 34 , wherein said subset of said interconnected routers comprises at least a crossover router.
42. The method of claim 41 , including sharing said key with routers of the same level as said crossover router.
43. The method of claim 34 , wherein said subset of interconnected routers comprises routers of the same tree.
44. The method of claim 34 , further including performing a hash function on said address, such that as a result of said hash function on said address an expected value is produced, said expected value representing a destination of said address on a desired path.
45. The method of claim 44 , including corresponding said expected value to a suffix of said address.
46. The method of claim 44 , wherein said expected value is included in said address.
47. The method of claim 44 , including pointing to said expected value from a qualifier contained in said address, wherein said expected value is in a table that is separate from said address.
48. A router comprising: a processor and a data path, wherein: data is transmitted to, through and/or from said router, said data being processed by said processor for transmission along said data path; said data being processed by said processor including processing of an address such that said address identifies at least a logical location of a destination of said data, said router being a router within a group of interconnected routers; wherein said processing includes said address being divided into a plurality of pieces wherein at least a subset of said plurality of pieces are encrypted, and wherein said interconnected routers transmit said data along said data path based on decrypting different ones of said encrypted pieces at different points along said data path, wherein said router is enabled to decrypt at least a piece of said address, and wherein at least a first piece of said address is separately encrypted from the other pieces, and wherein said router is unable to decrypt at least a different piece of said address than said first piece, and wherein said address is divided at least in part by an aggregation of routers within a routing domain tree, wherein said routing domain tree is representative of the interconnections between said group of interconnected routers, said aggregation occurring to a plurality of routers which share a common parent router.
49. The router of claim 48 , wherein said address is an IPv6 address.
50. The router of claim 48 , wherein, during a first period, said router is enabled to decrypt at least a piece of said address, and further during said first period, said router is enabled to decrypt at least said piece of said address, or another piece of said address, during a second period.
51. The router of claim 48 , wherein said router is provided with a key to decrypt said at least a piece of said address.
52. The router of claim 51 , wherein said router is a member of a subset of said interconnected routers comprising routers of the same level, and said key is shared by said routers of the same level.
53. The router of claim 51 , wherein said router is a member of a subset of said interconnected routers comprising routers that share a common link, and said key is shared by said routers that share the common link.
54. The router of claim 51 , wherein said router is a member of a subset of said interconnected routers comprising at least a crossover router.
55. The router of claim 54 , wherein said key is shared by routers of the same level as said crossover router.
56. The router of claim 48 , wherein said at least a first piece of said address is capable of being decrypted using a key.
57. The router of claim 51 , wherein said router is a member of a subset of interconnected routers which are configured in a logical tree.
58. The router of claim 48 , wherein said address includes a property such that as a result of a hash function on said address, an expected value is produced, said expected value being representative of a desired path of said data to said destination.
59. The router of claim 58 , wherein said expected value corresponds to a suffix of said address.
60. The router of claim 58 , wherein said expected value is included in said address.
61. The router of claim 58 , wherein said expected value is not explicitly contained in said address, but said address includes a pointer to said expected value, wherein said expected value is included in a table.
Unknown
March 29, 2011
Browse 5M+ US patents with plain-English claim translations and AI-generated analysis.