Multiplex communications – Pathfinding or routing – Store and forward
Reexamination Certificate
2008-05-13
2008-05-13
Nguyen, Chau (Department: 2616)
Multiplex communications
Pathfinding or routing
Store and forward
C370S505000
Reexamination Certificate
active
10211098
ABSTRACT:
A reassembly and/or a segmentation function is spread across (i.e. partially performed in) each of two (or more) network processors, with use of buffers in a storage device to temporarily buffer data that is received in one or more ingress data units. In using the buffers, no attempt is made to completely fill each buffer. Instead, filling of data into a current buffer is stopped (and the remainder of current buffer is filled with padding) if there is no more data available, or if sufficient data has been accumulated to form an egress data unit. If there is any more data available, the remaining data is stored in a next buffer that remains partially filled (remainder filled with padding). Such partially filled buffers serve as temporary storage until additional data is received.
REFERENCES:
patent: RE31182 (1983-03-01), Crager et al.
patent: 5383182 (1995-01-01), Therasse et al.
patent: 5590122 (1996-12-01), Sandorfi et al.
patent: 5781549 (1998-07-01), Dai
patent: 5809024 (1998-09-01), Ferguson et al.
patent: 5870394 (1999-02-01), Oprea
patent: 5901147 (1999-05-01), Joffe
patent: 6128278 (2000-10-01), Joffe et al.
patent: 6148000 (2000-11-01), Feldman et al.
patent: 6266687 (2001-05-01), Harriman et al.
patent: 6246684 (2001-06-01), Chapman et al.
patent: 6249528 (2001-06-01), Kothary
patent: 6259699 (2001-07-01), Opalka et al.
patent: 6307860 (2001-10-01), Joffe et al.
patent: 6314101 (2001-11-01), Rezaiifar et al.
patent: 6317433 (2001-11-01), Galand et al.
patent: 6330584 (2001-12-01), Joffe et al.
patent: 6388994 (2002-05-01), Murase
patent: 6404752 (2002-06-01), Allen et al.
patent: 6463067 (2002-10-01), Hebb et al.
patent: 6556568 (2003-04-01), Sasaki
patent: 6654343 (2003-11-01), Brandis et al.
patent: 6687246 (2004-02-01), Wolrich et al.
patent: 6714985 (2004-03-01), Malagrino et al.
patent: 6937606 (2005-08-01), Basso et al.
patent: 6954430 (2005-10-01), Haglund
patent: 7058057 (2006-06-01), Dooley et al.
patent: 7072342 (2006-07-01), Elnathan
patent: 7092409 (2006-08-01), Chun et al.
patent: 2003/0074388 (2003-04-01), Pham et al.
Entire Prosecution History of U.S. Appl. No. 10/211,080 filed by Ari Birger et al, on Aug. 1, 2002, including an Office Action dated Sep. 11, 2006.
“Reconsidering Fragmentation and Reassembly” by Girish P. Chandranmenon and George Varghese, believed to be published at Seventeenth ACM Symposium on Principles of Distributed Computing (PODC '98), at a conference held in Peurto Vallarta, Jun. 28-Jul. 2, 1998.
Shan, N. “Understanding Network Processors”, Version 1.0, University of California, Berkeley, Sep.,2001, http://courses.ece.uiuc.edu/ece511/papers
p.pdf, pp. 93.
The ATM Forum Technical Committee, “ATM Trunking using AAL2 for Narrowband Services”, AF-VTOA-0113.000, Feb., 1999, pp. 58.
Hur Benjamin
Reast Dayne A.
Wang Sangyu
Applied Micro Circuits Corporation
Nguyen Chau
Silicon Valley Patent & Group LLP
Smith Marcus R
Suryadevara Omkar
LandOfFree
Reassembly of data fragments in fixed size buffers does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Reassembly of data fragments in fixed size buffers, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Reassembly of data fragments in fixed size buffers will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3943370