Dynamically assigning packet flows

Details Dynamically assigning packet flows Dynamically assigning packet flows

2011-05-17

2011-05-17

Park, Jung (Department: 2465)

Multiplex communications

Data flow congestion prevention or control

Control of data admission to the network

C370S230100, C370S235000, C370S392000

Reexamination Certificate

active

07944828

ABSTRACT:
In general, in one aspect, the disclosure describes a method includes accessing data of an egress packet belonging to a flow, storing data associating the flow with at least one queue based on a source of the data of the egress packet. The method also includes accessing an ingress packet belonging to the flow, performing a lookup of the at least one queue associated with the flow, and enqueueing data of the ingress packet to the at least one queue associated with the flow.

REFERENCES:
patent: 6389468 (2002-05-01), Muller et al.
patent: 6453360 (2002-09-01), Muller et al.
patent: 6483804 (2002-11-01), Muller et al.
patent: 6484209 (2002-11-01), Momirov
patent: 6650640 (2003-11-01), Muller et al.
patent: 6683873 (2004-01-01), Kwok et al.
patent: 6973040 (2005-12-01), Ricciulli
patent: 7043494 (2006-05-01), Joshi et al.
patent: 7162740 (2007-01-01), Eastlake, III
patent: 7219228 (2007-05-01), Lin
patent: 2002/0144004 (2002-10-01), Gaur et al.
patent: 2003/0043810 (2003-03-01), Boduch et al.
patent: 2003/0226032 (2003-12-01), Robert
patent: 2004/0030757 (2004-02-01), Pandya
patent: 1367799 (2003-12-01), None
“Scalable Networking: Eliminating the Receive Processing Bottleneck—Introducing RSS”, WinHEC 2004 Version, Apr. 14, 2004, 17 Pages.
International Preliminary Report on Patentability (Chapter I of the Patent Cooperation Treaty), for PCT Application No. PCT/US2005/044771 , mailed on Jun. 28, 2007, 8 pages.
Johnathan Lemon; “Resisting SYN Flood DoS Attacks with a SNY Cache”; USENIX Association; Berkley, CA; 2002; pp. 89-97; ISBN: 1-880446-02-2, 2000.
Technology at Harvard Law; “RSS 2.0 Specification”; pp. 10; Jul. 15, 2003; last accessed Feb. 5, 2008: http://cyber.law.harvard.edu/rss/rss.html.
Janice M. Girouard, “patch for common networking error messages”, Jun. 16, 2003, http://oss.sgi.com/archives
etdev/2003-06/msg00474.html.
“Re: [review please] tcp syn cache clean up code for sc->sc—so”; Aug. 21, 1999; pp. 1; last accessed Feb. 5, 2008: http://mail-index.netbsd.org/tech-net/1999/08/21/0001.html.
Kenneth D. Merry; “Zero Copy Sockets and NFS Code for FreeBSD”; Jun. 16, 2000; pp. 7; last accessed Feb. 5, 2008: http://www.mail-archive.com/freebsd-current@freebsd.org/msg17038.html.
Steenbergen: Understanding Modern Denial of Service 2001, 10 pages.
Reutsche: The Architecture of a Gb/s Multimedia Protocol Adapter, Computer Communication Review ACM SIGCOMM, vol. 23, No. 3, Jul. 1993, pp. 59-68.
Intel IXP2400 Network Processor hardware Reference Manual, Nov. 2003, 408 pages.
DAEMON9: Project Neptune, Phrack Magazine, vol. 7, Issue 48, file 13 of Jul. 18, 1996, 23 pages.
Lemon: Resisting SYN Flood Dos Atacks with a SYN Cache, FreeBSD Project, 9 pages, 2000.
FreeBSD/Linux Kernel Cross Reference sys
etinet/tcp—syncache.c, 2001 Networks Associates Technology, Inc., 24 pages.
FreeBSD/Linux Kernel Cross Reference sys
etinet/tcp—syncache.c, 2001 Networks Associates Technology, Inc., 25 pages.
FreeBSD/Linux Kernel Cross Reference sys/sys/queue.h, 1991, 1993, The Regents of the University of California, 10 pages.
Addressing TCP/IP Processing Challenges Using the IA and IXP Processors, Communications Processing, Intel Technology Journal, vol. 7, Issue 4, Nov. 14, 2003, pp. 39-50.
Sapuntzakis et al.: The Case for RDMA; Cisco Systems, Dec. 2000, 13 pages.
Technology at Havard Law; RSS 2.0 Specification; http://blogs.law.harvard.edu/tech/rss; 10 pages, 2003.
Miller & Girouard: Patch for Common Networking Error Messages; linux.kernel; Jun. 17, 2003; blog.
Thorpe: tcp syn cache cleanup code for sc->sc—so; Aug. 21, 1999; 1 page.
Merry Zero Copy Sockets and NFS Code for Free BSD; sol.lists.freebsd.net; 7 pages; blog 2000.
International Search Report and Written Opinion for PCT Application No. PCT/US2005/044771, Mailed on May 8, 2006 , 21 Pages.

Affiliated with

Also associated with

Rating

Dynamically assigning packet flows does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Dynamically assigning packet flows, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Dynamically assigning packet flows will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-2645676