Multiplex communications – Pathfinding or routing – Switching a message which includes an address header
Reexamination Certificate
2011-06-14
2011-06-14
Wu, Jianye (Department: 2462)
Multiplex communications
Pathfinding or routing
Switching a message which includes an address header
C370S395420, C709S240000
Reexamination Certificate
active
07961736
ABSTRACT:
A method of converting application data to transport data in a power line communication system includes receiving application data from an application in a device through a service access point. The connection type and connection specification for the application data is then analyzed to determine if a connection exists for the application data. If a connection exists for the application data, mapping the application data is mapped into transport data.
REFERENCES:
patent: 4841456 (1989-06-01), Hogan et al.
patent: 5216675 (1993-06-01), Melliar-Smith et al.
patent: 5507359 (1996-04-01), Wada
patent: 5555266 (1996-09-01), Buchholz et al.
patent: 5570359 (1996-10-01), Nguyen
patent: 5928324 (1999-07-01), Sloan
patent: 6041359 (2000-03-01), Birdwell
patent: 6148349 (2000-11-01), Chow et al.
patent: 6199136 (2001-03-01), Shteyn
patent: 6272145 (2001-08-01), Malkin
patent: 6873624 (2005-03-01), Johansson et al.
patent: 7835365 (2010-11-01), Ayyagari
patent: 2001/0003804 (2001-06-01), Papadopoulos et al.
patent: 2001/0018712 (2001-08-01), Swales et al.
patent: 2001/0048663 (2001-12-01), Kodaira
patent: 2002/0032806 (2002-03-01), Machin et al.
patent: 2002/0181401 (2002-12-01), Hagirahim et al.
patent: 2003/0093563 (2003-05-01), Young et al.
patent: 2003/0103521 (2003-06-01), Raphaeli et al.
patent: 2003/0182291 (2003-09-01), Kurupati et al.
patent: 2004/0062229 (2004-04-01), Ayyagari et al.
patent: 2004/0073939 (2004-04-01), Ayyagari
patent: 2004/0081201 (2004-04-01), Simonnet et al.
patent: 2004/0138834 (2004-07-01), Blackett et al.
patent: 2004/0153545 (2004-08-01), Pandya et al.
patent: 2004/0233907 (2004-11-01), Hundscheidt et al.
patent: 4201361 (1992-08-01), None
Andrew S. Tanenbaum, “Computer Networks”, Third Edition, 1996 (hereinafter Tanenbaum), p. 345, 380, 480, 482-490, 548, and 577.
W. Richard Stevens, “UNIX Netwrok Programming”, 1990, p. 267-268.
Andrew S. Tanenbaum, “Computer Networks”, Third Edition, 1996 (hereinafter Tanenbaum), p. 413, 414.
W. Richard Stevens, “UNIX NetWrok Programming”, 1990, p. 269-275.
W. Richard Stevens, “UNIX Netwrok Programming”, 1990, p. 269-275, 282-283.
W. Richard Stevens, “UNIX Netwrok Programming”, 1990, p. 240, 260, 266-274, 283.
Andrew S. Tanenbaum, “Computer Networks”, Forth edition, Aug. 9, 2002, Section 5.1.3, 6.1.3, 6.1.4, 7.4, 7.4.8.
Andrew S. Tanenbaum, “Computer Networks”, Forth edition, Aug. 9, 2002, Section 6.5..4, 7.4.4, 8.6.2.
Andrew S. Tanenbaum, “Computer Networks”, Forth edition, Aug. 9, 2002, Section 4.3.3.
Tanenbaum, Andrew;Computer Networks; Aug. 31, 2002; Prentice Hall, New Jersey; pp. 481-486 and 492-497.
Notice of Allowance and Fee(s) Due; Determination of Patent Term Adjusment; Notice of Allowability with accompanying Examiner's comments on allowable subject matter, all dated Jul. 7, 2010, in U.S. Appl. No. 10/663,406, filed Sep. 15, 2003, Now U.S. Pat No. 7,835,365 B2.
Marger & Johnson & McCollom, P.C.
Sharp Laboratories of America Inc.
Wu Jianye
LandOfFree
Convergence and classification of data packets in a... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Convergence and classification of data packets in a..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Convergence and classification of data packets in a... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-2736891