Computer-readable data structure for efficient routing and...

Electrical computers and digital processing systems: multicomput – Computer-to-computer data modifying – Compressing/decompressing

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C709S236000

Reexamination Certificate

active

07143192

ABSTRACT:
A data structure in a computer-readable form is provided that includes a string construct and a data construct. The string construct is formed by translations of a string of values. The tag construct is concatenated to the string construct and includes at least one tag value. The tag construct represents at least two translations that were performed on the string of values to produce the string construct.

REFERENCES:
patent: 4593155 (1986-06-01), Hawkins
patent: 4916637 (1990-04-01), Allen et al.
patent: 5014345 (1991-05-01), Comroe et al.
patent: 5043721 (1991-08-01), May
patent: 5367667 (1994-11-01), Wahlquist et al.
patent: 5400331 (1995-03-01), Lucak et al.
patent: 5473691 (1995-12-01), Menezes et al.
patent: 5559800 (1996-09-01), Mousseau et al.
patent: 5603025 (1997-02-01), Tabb et al.
patent: 5619615 (1997-04-01), Pitchaikani et al.
patent: 5619694 (1997-04-01), Shimazu
patent: 5623656 (1997-04-01), Lyons
patent: 5640590 (1997-06-01), Luther
patent: 5675780 (1997-10-01), Plant-Mason et al.
patent: 5675831 (1997-10-01), Caputo
patent: 5680585 (1997-10-01), Bruell
patent: 5701451 (1997-12-01), Rogers et al.
patent: 5705995 (1998-01-01), Laflin et al.
patent: 5740549 (1998-04-01), Reilly et al.
patent: 5754242 (1998-05-01), Ohkami
patent: 5757913 (1998-05-01), Bellare et al.
patent: 5796952 (1998-08-01), Davis et al.
patent: 5799151 (1998-08-01), Hoffer
patent: 5809247 (1998-09-01), Richardson et al.
patent: 5861883 (1999-01-01), Cuomo et al.
patent: 5875306 (1999-02-01), Bereiter
patent: 5884097 (1999-03-01), Li et al.
patent: 5903262 (1999-05-01), Ichihashi et al.
patent: 5905856 (1999-05-01), Ottensooser
patent: 5920696 (1999-07-01), Brandt et al.
patent: 5923738 (1999-07-01), Cardillo, IV et al.
patent: 5933501 (1999-08-01), Leppek
patent: 5933826 (1999-08-01), Ferguson
patent: 5935060 (1999-08-01), Iliff
patent: 5937041 (1999-08-01), Cardillo, IV et al.
patent: 5943496 (1999-08-01), Li et al.
patent: 5946326 (1999-08-01), Rinne
patent: 5953423 (1999-09-01), Rosen
patent: 5953524 (1999-09-01), Meng et al.
patent: 5963944 (1999-10-01), Adams
patent: 5974085 (1999-10-01), Smith
patent: 5974238 (1999-10-01), Chase, Jr.
patent: 5999941 (1999-12-01), Andersen
patent: 6005490 (1999-12-01), Higashihara
patent: 6009456 (1999-12-01), Frew et al.
patent: 6041183 (2000-03-01), Hayafune et al.
patent: 6061698 (2000-05-01), Chadha et al.
patent: 6067574 (2000-05-01), Tzeng
patent: 6078743 (2000-06-01), Apte et al.
patent: 6085224 (2000-07-01), Wagner
patent: 6112242 (2000-08-01), Jois et al.
patent: 6128735 (2000-10-01), Goldstein et al.
patent: 6151610 (2000-11-01), Senn et al.
patent: 6233338 (2001-05-01), Leppek
patent: 6311058 (2001-10-01), Wecker et al.
patent: 6636970 (2003-10-01), Akiyama et al.
patent: 0 434 231 (1991-06-01), None
patent: 0 653 736 (1995-05-01), None
patent: 0 704 827 (1996-04-01), None
patent: 803 825 (1997-10-01), None
patent: WO 90/13213 (1990-11-01), None
patent: WO 97/17682 (1997-05-01), None
patent: WO 97/35402 (1997-09-01), None
Paul F. Syverson et al., “Anonymous Connections and Onion Routing,” 1997 IEEE Symposium on Security and Privacy, 11 pages (May 1997).
U.S. Appl. No. 09/107,899, filed Jun. 30, 1998, Tuniman et al., Pending.
Castedo Ellerman, “Channel Definition Format (CDF),” Channel Definition Format Submission 970309, 11 pages, (Mar. 1997).
Fabio Vitali et al., “Extending HTML in a Principled Way WithDisplets, ” Computer Networks and ISDN Systems, vol. 29, pp. 1115-1128 (1997).
Downloaded from http://www.techweb.com/se/directlink.cgi/IWK19970609S004, 5 pages (Jun. 1997). Information Week “Push Your Web Pages—Netscape's Netcaster and Microsoft's CDF make it easier than ever to join the push revolution”, Issue 634.
Michail Salampasis et al., “HyperTree: A Structural Approach to Web Authoring,” Software—Practice And Experience, col. 27 (12), pp. 1411-1426 (Dec. 1997).
Y. Rekhter et al., RFC 2105: Cisco Systems' Tag Switching Architecture Overview, Network Working group, 10 pages (Feb. 1997).
Xipeng Xiao et al., “A Comprehensive Comparison of IP Switching and Tag Switching”, Proc. of 1997 International Conference on Parallel and Distributed System, 7 pages (Dec. 1997).
U.S. Appl. No. 09/107,941, filed Jun. 30, 1998, Wecker et al., Pending.

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Computer-readable data structure for efficient routing and... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Computer-readable data structure for efficient routing and..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Computer-readable data structure for efficient routing and... will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-3652760

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.