Multiplex communications – Pathfinding or routing – Store and forward
Reexamination Certificate
2003-03-13
2008-09-02
Yao, Kwang B. (Department: 2616)
Multiplex communications
Pathfinding or routing
Store and forward
C370S412000
Reexamination Certificate
active
07420983
ABSTRACT:
Methods and apparatus for the dynamic assignment of re-assembly queues to multiple connections in a communications system are described. In a preferred embodiment of the invention an ATM to MPLS mediation application is implemented. In the mediation process ATM cells are assigned to re-assembly queues where they are converted to MPLS packets for transmission over a MPLS tunnel. Typically there are many more connections than re-assembly queues which necessitates a dynamic assignment of the re-assembly queues to ensure efficient operation of the system. Re-assembly queues are serviced based on either a cell count or a timing factor.
REFERENCES:
patent: 6240066 (2001-05-01), Nagarajan et al.
patent: 6678813 (2004-01-01), Le
patent: 6717912 (2004-04-01), Lemyre et al.
patent: 6721796 (2004-04-01), Wong
patent: 6961835 (2005-11-01), Lightstone et al.
patent: 7003597 (2006-02-01), Georgiou et al.
patent: 7307998 (2007-12-01), Wang et al.
patent: 7346063 (2008-03-01), Herbst
patent: 2002/0136228 (2002-09-01), Miyamoto
patent: 2003/0223416 (2003-12-01), Rojas et al.
patent: 2004/0078532 (2004-04-01), Tremaine
patent: 2005/0008020 (2005-01-01), Ashwood-Smith et al.
patent: 2005/0235129 (2005-10-01), Sokol
Alcatel Lucent
Wong Warner
Yao Kwang B.
LandOfFree
Dynamic assignment of re-assembly queues does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Dynamic assignment of re-assembly queues, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Dynamic assignment of re-assembly queues will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3991773