IP Library › Granted Patent US 12,267,241
Granted Patent B2
US 12,267,241 · App. 17/307,365 · Granted Apr 1, 2025

Offline, intelligent load balancing of SCTP traffic

Inventors: Jude Pragash Vedam (Bangalore, IN); Suresh Paruchuri (Bangalore, IN); Deepak Hegde (Bangalore, IN)
Assignee: Extreme Networks, Inc.
H04L47/125H04L43/062H04L43/12
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 12,267,241
App. No.
17/307,365
Granted
Apr 1, 2025
Kind
B2
Abstract

Techniques for enabling offline, intelligent load balancing of Stream Control Transmission Protocol (SCTP) traffic are provided. According to one embodiment, a load balancer can receive one or more SCTP packets that have been replicated from a network being monitored. The load balancer can further recover an SCTP message from the one or more SCTP packets and can map the SCTP message to an egress port based on one or more parameters decoded from the SCTP message and one or more rules. The load balancer can then transmit the SCTP message out of the egress port towards an analytic probe or tool for analysis.

Claims (67)

1. A method comprising:

receiving a Stream Control Transmission Protocol (SCTP) packet that has been replicated from a network being monitored, wherein the SCTP packet comprises a plurality of data chunks including a first data chunk and another data chunk, wherein the first data chunk includes a first transmission sequence number, wherein the first data chunk carries a payload for an SCTP message, wherein the SCTP message is mapped to a first egress port, and wherein the another data chunk carries another payload for another SCTP message, wherein the another SCTP message is mapped to a second egress port;

determining an SCTP association for the SCTP packet, wherein the SCTP association comprises a first endpoint and a second endpoint of an SCTP connection and wherein the first transmission sequence number identifies an ordering of the first data chunk relative to other data chunks within the SCTP association;

selecting a packet queue and a data chunk queue based on the SCTP association;

placing the SCTP packet into the packet queue;

placing the first data chunk into the data chunk queue based on the first transmission sequence number;

detecting a defined message boundary in the first data chunk of the plurality of data chunks, wherein the defined message boundary indicates a boundary of the SCTP message;

triggering a message decoder module based on detecting the defined message boundary;

determining, by the message decoder module, a mapping of the SCTP message to the first egress port and a second mapping of the another SCTP message to the second egress port; and

transmitting, based on the mapping, a first copy of the SCTP packet via the first egress port and, based on the second mapping, a second copy of the SCTP packet via the second egress port.

2. The method of claim 1 , wherein the message decoder module is triggered based on the boundary of the SCTP message indicating that the first data chunk is a last chunk of the SCTP message.

3. The method of claim 1 , further comprising:

selecting a packet reorder queue based on the SCTP association;

determining that the SCTP packet is received out of order based on the first transmission sequence number in an SCTP header of the SCTP packet; and

placing the SCTP packet in the packet reorder queue based on the determining.

4. The method of claim 3 , wherein the SCTP association is determined based on information in the SCTP header of the SCTP packet.

5. The method of claim 1 , wherein the first data chunk further includes a stream identifier and a stream sequence number, wherein the stream identifier identifies a stream to which the first data chunk belongs and wherein the stream sequence number identifies a message within the stream to which the first data chunk belongs.

6. The method of claim 1 , wherein the SCTP packet further includes a control chunk, the method further comprising:

passing the control chunk to a control chunk processor;

receiving, from the control chunk processor, a signal for processing the SCTP packet, wherein the signal is generated based on a type of the control chunk; and

processing the plurality of data chunks of the SCTP packet based on the signal.

7. The method of claim 1 , wherein the plurality of data chunks comprises a second data chunk, wherein the second data chunk includes a second transmission sequence number and wherein the second data chunk carries a second payload for the SCTP message.

8. The method of claim 7 , wherein the another data chunk includes a third transmission sequence number.

9. The method of claim 8 , wherein the SCTP message is associated with a first stream and the another SCTP message is associated with a second stream.

10. The method of claim 9 , further comprising:

placing the first data chunk and the second data chunk into a first stream queue, wherein the first stream queue is associated with the first stream; and

placing the another data chunk into a second stream queue, wherein the second stream queue is associated with the second stream.

11. The method of claim 1 wherein the transmitting comprises:

retrieving, from the packet queue, the first copy of the SCTP packet that contains the SCTP message.

12. The method of claim 1 , wherein another SCTP packet has been replicated from the network being monitored, the method further comprising:

receiving the another SCTP packet, wherein the SCTP packet and the another SCTP packet originate from different SCTP associations in the network being monitored.

13. The method of claim 1 , wherein mapping the SCTP message comprises:

extracting session information from the SCTP message; and

detecting, based on the session information, a load-balancing rule that maps the SCTP message to the first egress port.

14. The method of claim 1 , wherein the defined message boundary comprises at least one of a begin bit and an end bit, wherein the begin bit indicates that the first data chunk is a first chunk of the SCTP message and the end bit indicates that the first data chunk is a last chunk of the SCTP message.

15. A non-transitory computer readable storage medium having stored thereon program code that when executed by a load balancer processor cause the load balancer processor to perform operations comprising:

receiving a Stream Control Transmission Protocol (SCTP) packet that has been replicated from a network being monitored, wherein the SCTP packet comprises a plurality of data chunks including a first data chunk and another data chunk, wherein the first data chunk includes a first transmission sequence number and wherein the first data chunk carries a payload for an SCTP message, wherein the SCTP message is mapped to a first egress port, and wherein the another data chunk carries another payload for a second SCTP message, wherein the second SCTP message is mapped to a second egress port;

determining an SCTP association for the SCTP packet, wherein the SCTP association comprises a first endpoint and a second endpoint of an SCTP connection and wherein the first transmission sequence number identifies an ordering of the first data chunk relative to other data chunks within the SCTP association;

selecting a packet queue and a data chunk queue based on the SCTP association;

placing the SCTP packet into the packet queue;

placing the first data chunk into the data chunk queue based on the first transmission sequence number;

detecting a defined message boundary in the first data chunk of the plurality of data chunks, wherein the defined message boundary indicates a boundary of the SCTP message;

triggering a message decoder module based on detecting the defined message boundary;

determining, by the message decoder module, a mapping of the SCTP message to the first egress port and a second mapping of the another SCTP message to the second egress port; and

transmitting, based on the mapping, a first copy of the SCTP packet via the first egress port and, based on the second mapping, a second copy of the SCTP packet via the second egress port.

16. The non-transitory computer readable storage medium of claim 15 , wherein the SCTP packet further includes a control chunk, the operations further comprising:

passing the control chunk to a control chunk processor;

receiving, from the control chunk processor, a signal for processing the SCTP packet, wherein the signal is generated based on a type of the control chunk; and

processing the plurality of data chunks of the SCTP packet based on the signal.

17. The non-transitory computer readable storage medium of claim 15 , wherein the plurality of data chunks comprises a second data chunk, wherein the second data chunk includes a second transmission sequence number and wherein the second data chunk carries a second payload for the SCTP message.

18. A load balancing system comprising:

a processor; and

a non-transitory computer readable medium having stored thereon program code that, when executed by the processor, causes the processor to:

receive a Stream Control Transmission Protocol (SCTP) packet that has been replicated from a network being monitored, wherein the SCTP packet comprises a plurality of data chunks including a first data chunk and another data chunk, wherein the first data chunk includes a first transmission sequence number and wherein the first data chunk carries a payload for an SCTP message, wherein the SCTP message is mapped to a first egress port, and wherein the another data chunk carries another payload for a second SCTP message, wherein the second SCTP message is mapped to a second egress port;

determine an SCTP association for the SCTP packet, wherein the SCTP association comprises a first endpoint and a second endpoint of an SCTP connection and wherein the first transmission sequence number identifies an ordering of the first data chunk relative to other data chunks within the SCTP association;

select a packet queue and a data chunk queue based on the SCTP association;

place the SCTP packet into the packet queue;

place the first data chunk into the data chunk queue based on the first transmission sequence number;

detect a defined message boundary in the first data chunk of the plurality of data chunks, wherein the defined message boundary indicates a boundary of the SCTP message;

trigger a message decoder module based on detecting the defined message boundary;

determine, by the message decoder module, a mapping of the SCTP message to the first egress port and a second mapping of the another SCTP message to the second egress port; and

transmit, based on the mapping, a first copy of the SCTP packet via the first egress port and, based on the second mapping, a second copy of the SCTP packet via the second egress port.

19. The load balancing system of claim 18 , wherein the SCTP packet further includes a control chunk, the processor further configured to:

pass the control chunk to a control chunk processor;

receive, from the control chunk processor, a signal for processing the SCTP packet, wherein the signal is generated based on a type of the control chunk; and

process the plurality of data chunks of the SCTP packet based on the signal.

20. The load balancing system of claim 18 , wherein the plurality of data chunks comprises a second data chunk, wherein the second data chunk includes a second transmission sequence number and wherein the second data chunk carries a second payload for the SCTP message.

Assignments (1)
AMENDED SECURITY AGREEMENT Recorded Aug 18, 2023
From: EXTREME NETWORKS, INC.; AEROHIVE NETWORKS, INC.
To: BANK OF MONTREAL
Reel/Frame 064782/0971 →
Priority Claims (1)
IN 201641010295 · Mar 24, 2016 · national
Continuity (2)
Continuation 15336333 · Oct 27, 2016
Related Publication 20210328928A1 · Oct 21, 2021
References Cited (400)
US 5031094A · Toegel et al. · 1991 [cited by applicant]
US 5359593A · Derby et al. · 1994 [cited by applicant]
US 5948061A · Merriman et al. · 1999 [cited by applicant]
US 5951634A · Sitbon et al. · 1999 [cited by applicant]
US 6006269A · Phaal · 1999 [cited by applicant]
US 6006333A · Nielsen · 1999 [cited by applicant]
US 6078956A · Bryant et al. · 2000 [cited by applicant]
US 6092178A · Jindal et al. · 2000 [cited by applicant]
US 6112239A · Kenner et al. · 2000 [cited by applicant]
US 6115752A · Chauhan · 2000 [cited by applicant]
US 6128279A · O'Neil et al. · 2000 [cited by applicant]
US 6128642A · Doraswamy et al. · 2000 [cited by applicant]
US 6148410A · Baskey et al. · 2000 [cited by applicant]
US 6167445A · Gai et al. · 2000 [cited by applicant]
US 6167446A · Lister et al. · 2000 [cited by applicant]
US 6182139B1 · Brendel · 2001 [cited by applicant]
US 6195691B1 · Brown · 2001 [cited by applicant]
US 6205477B1 · Johnson et al. · 2001 [cited by applicant]
US 6233604B1 · Van Horne et al. · 2001 [cited by applicant]
US 6260070B1 · Shab · 2001 [cited by applicant]
US 6286039B1 · Van Horne et al. · 2001 [cited by applicant]
US 6286047B1 · Ramanathan et al. · 2001 [cited by applicant]
US 6304913B1 · Rune · 2001 [cited by applicant]
US 6324580B1 · Jindal et al. · 2001 [cited by applicant]
US 6327622B1 · Jindal et al. · 2001 [cited by applicant]
US 6336137B1 · Lee et al. · 2002 [cited by applicant]
US 6381627B1 · Kwan et al. · 2002 [cited by applicant]
US 6389462B1 · Cohen et al. · 2002 [cited by applicant]
US 6427170B1 · Sitaraman et al. · 2002 [cited by applicant]
US 6434118B1 · Kirschenbaum · 2002 [cited by applicant]
US 6438652B1 · Jordan et al. · 2002 [cited by applicant]
US 6446121B1 · Shah et al. · 2002 [cited by applicant]
US 6449657B2 · Stanbach, Jr. et al. · 2002 [cited by applicant]
US 6470389B1 · Chung et al. · 2002 [cited by applicant]
US 6473802B2 · Masters · 2002 [cited by applicant]
US 6480508B1 · Mwikalo et al. · 2002 [cited by applicant]
US 6490624B1 · Sampson et al. · 2002 [cited by applicant]
US 6549944B1 · Weinberg et al. · 2003 [cited by applicant]
US 6567377B1 · Vepa et al. · 2003 [cited by applicant]
US 6578066B1 · Logan et al. · 2003 [cited by applicant]
US 6606643B1 · Emens et al. · 2003 [cited by applicant]
US 6665702B1 · Zisapel et al. · 2003 [cited by applicant]
US 6671275B1 · Wong et al. · 2003 [cited by applicant]
US 6681232B1 · Sitanizadeh et al. · 2004 [cited by applicant]
US 6681323B1 · Fontsnesi et al. · 2004 [cited by applicant]
US 6691165B1 · Bruck et al. · 2004 [cited by applicant]
US 6697368B2 · Chang et al. · 2004 [cited by applicant]
US 6735218B2 · Chang et al. · 2004 [cited by applicant]
US 6745241B1 · French et al. · 2004 [cited by applicant]
US 6751616B1 · Chan · 2004 [cited by applicant]
US 6754706B1 · Swildens et al. · 2004 [cited by applicant]
US 6772211B2 · Lu et al. · 2004 [cited by applicant]
US 6779017B1 · Lamberton et al. · 2004 [cited by applicant]
US 6789125B1 · Aviani et al. · 2004 [cited by applicant]
US 6821891B2 · Chen et al. · 2004 [cited by applicant]
US 6826198B2 · Turina et al. · 2004 [cited by applicant]
US 6831891B2 · Mansharamani et al. · 2004 [cited by applicant]
US 6839700B2 · Doyle et al. · 2005 [cited by applicant]
US 6850984B1 · Kalkunte et al. · 2005 [cited by applicant]
US 6874152B2 · Vermeire et al. · 2005 [cited by applicant]
US 6879995B1 · Chinta et al. · 2005 [cited by applicant]
US 6898633B1 · Lyndersay et al. · 2005 [cited by applicant]
US 6901072B1 · Wong · 2005 [cited by applicant]
US 6901081B1 · Ludwig · 2005 [cited by applicant]
US 6920498B1 · Gourlay et al. · 2005 [cited by applicant]
US 6928485B1 · Krishnamurthy et al. · 2005 [cited by applicant]
US 6944678B2 · Lu et al. · 2005 [cited by applicant]
US 6963914B1 · Breitbart et al. · 2005 [cited by applicant]
US 6963917B1 · Callis et al. · 2005 [cited by applicant]
US 6985956B2 · Luke et al. · 2006 [cited by applicant]
US 6987763B2 · Rochberger et al. · 2006 [cited by applicant]
US 6996615B1 · McGuire · 2006 [cited by applicant]
US 6996616B1 · Leighton et al. · 2006 [cited by applicant]
US 7000007B1 · Valenti · 2006 [cited by applicant]
US 7009086B2 · Brown et al. · 2006 [cited by applicant]
US 7009968B2 · Ambe et al. · 2006 [cited by applicant]
US 7020698B2 · Andrews et al. · 2006 [cited by applicant]
US 7020714B2 · Kalyanaraman et al. · 2006 [cited by applicant]
US 7028083B2 · Levine et al. · 2006 [cited by applicant]
US 7031304B1 · Arberg et al. · 2006 [cited by applicant]
US 7032010B1 · Swildens et al. · 2006 [cited by applicant]
US 7036039B2 · Holland · 2006 [cited by applicant]
US 7058706B1 · Iyer et al. · 2006 [cited by applicant]
US 7058717B2 · Chao et al. · 2006 [cited by applicant]
US 7062642B1 · Langrind et al. · 2006 [cited by applicant]
US 7086061B1 · Joshi et al. · 2006 [cited by applicant]
US 7089293B2 · Grosner et al. · 2006 [cited by applicant]
US 7095738B1 · Desanti · 2006 [cited by applicant]
US 7117530B1 · Lin · 2006 [cited by applicant]
US 7126910B1 · Sridhar · 2006 [cited by applicant]
US 7127713B2 · Davis et al. · 2006 [cited by applicant]
US 7136932B1 · Schneider · 2006 [cited by applicant]
US 7139242B2 · Bays · 2006 [cited by applicant]
US 7177933B2 · Foth · 2007 [cited by applicant]
US 7177943B1 · Temoshenko et al. · 2007 [cited by applicant]
US 7185052B2 · Day · 2007 [cited by applicant]
US 7187687B1 · Davis et al. · 2007 [cited by applicant]
US 7188189B2 · Karol et al. · 2007 [cited by applicant]
US 7197547B1 · Miller et al. · 2007 [cited by applicant]
US 7206806B2 · Pineau · 2007 [cited by applicant]
US 7215637B1 · Ferguson et al. · 2007 [cited by applicant]
US 7225272B2 · Kelley et al. · 2007 [cited by applicant]
US 7240015B1 · Karmouch et al. · 2007 [cited by applicant]
US 7240100B1 · Wein et al. · 2007 [cited by applicant]
US 7254626B1 · Kommula et al. · 2007 [cited by applicant]
US 7257642B1 · Bridger et al. · 2007 [cited by applicant]
US 7260645B2 · Bays · 2007 [cited by applicant]
US 7266117B1 · Davis · 2007 [cited by applicant]
US 7266120B2 · Cheng et al. · 2007 [cited by applicant]
US 7277954B1 · Stewart et al. · 2007 [cited by applicant]
US 7292573B2 · LaVigne et al. · 2007 [cited by applicant]
US 7296088B1 · Padmanabhan et al. · 2007 [cited by applicant]
US 7321926B1 · Zhang et al. · 2008 [cited by applicant]
US 7424018B2 · Gallatin et al. · 2008 [cited by applicant]
US 7436832B2 · Gallatin et al. · 2008 [cited by applicant]
US 7440467B2 · Gallatin et al. · 2008 [cited by applicant]
US 7441045B2 · Skene et al. · 2008 [cited by applicant]
US 7450527B2 · Ashwood Smith · 2008 [cited by applicant]
US 7454500B1 · Hsu et al. · 2008 [cited by applicant]
US 7483374B2 · Nilakantan et al. · 2009 [cited by applicant]
US 7492713B1 · Turner et al. · 2009 [cited by applicant]
US 7506065B2 · LaVigne et al. · 2009 [cited by applicant]
US 7539134B1 · Bowes · 2009 [cited by applicant]
US 7555562B2 · See et al. · 2009 [cited by applicant]
US 7558195B1 · Kuo et al. · 2009 [cited by applicant]
US 7574508B1 · Kommula · 2009 [cited by applicant]
US 7581009B1 · Hsu et al. · 2009 [cited by applicant]
US 7584301B1 · Joshi · 2009 [cited by applicant]
US 7587487B1 · Gunturu · 2009 [cited by applicant]
US 7606203B1 · Shabtay et al. · 2009 [cited by applicant]
US 7647427B1 · Devarapalli · 2010 [cited by applicant]
US 7657629B1 · Kommula · 2010 [cited by applicant]
US 7690040B2 · Frattura et al. · 2010 [cited by applicant]
US 7706363B1 · Daniel et al. · 2010 [cited by applicant]
US 7716370B1 · Devarapalli · 2010 [cited by applicant]
US 7720066B2 · Weyman et al. · 2010 [cited by applicant]
US 7720076B2 · Dobbins et al. · 2010 [cited by applicant]
US 7746789B2 · Katoh et al. · 2010 [cited by applicant]
US 7747737B1 · Apte et al. · 2010 [cited by applicant]
US 7756965B2 · Joshi · 2010 [cited by applicant]
US 7774833B1 · Szeto et al. · 2010 [cited by applicant]
US 7787454B1 · Won et al. · 2010 [cited by applicant]
US 7792047B2 · Gallatin et al. · 2010 [cited by applicant]
US 7835348B2 · Kasralikar · 2010 [cited by applicant]
US 7835358B2 · Gallatin et al. · 2010 [cited by applicant]
US 7840678B2 · Joshi · 2010 [cited by applicant]
US 7848326B1 · Leong et al. · 2010 [cited by applicant]
US 7889748B1 · Leong et al. · 2011 [cited by applicant]
US 7899899B2 · Joshi · 2011 [cited by applicant]
US 7940766B2 · Olakangil et al. · 2011 [cited by applicant]
US 7953089B1 · Ramakrishnan et al. · 2011 [cited by applicant]
US 8018943B1 · Pleshek et al. · 2011 [cited by applicant]
US 8208494B2 · Leong · 2012 [cited by applicant]
US 8238344B1 · Chen et al. · 2012 [cited by applicant]
US 8239960B2 · Frattura et al. · 2012 [cited by applicant]
US 8248928B1 · Wang et al. · 2012 [cited by applicant]
US 8270845B2 · Cheung et al. · 2012 [cited by applicant]
US 8315256B2 · Leong et al. · 2012 [cited by applicant]
US 8386846B2 · Cheung · 2013 [cited by applicant]
US 8391286B2 · Gallatin et al. · 2013 [cited by applicant]
US 8504721B2 · Hsu et al. · 2013 [cited by applicant]
US 8514718B2 · Zjist · 2013 [cited by applicant]
US 8537697B2 · Leong et al. · 2013 [cited by applicant]
US 8570862B1 · Leong et al. · 2013 [cited by applicant]
US 8615008B2 · Natarajan et al. · 2013 [cited by applicant]
US 8654651B2 · Leong et al. · 2014 [cited by applicant]
US 8824466B2 · Won et al. · 2014 [cited by applicant]
US 8830819B2 · Leong et al. · 2014 [cited by applicant]
US 8873557B2 · Nguyen · 2014 [cited by applicant]
US 8891527B2 · Wang · 2014 [cited by applicant]
US 8897138B2 · Yu et al. · 2014 [cited by applicant]
US 8953458B2 · Leong et al. · 2015 [cited by applicant]
US 9155075B2 · Song et al. · 2015 [cited by applicant]
US 9264446B2 · Goldfarb et al. · 2016 [cited by applicant]
US 9270566B2 · Wang et al. · 2016 [cited by applicant]
US 9270592B1 · Sites · 2016 [cited by applicant]
US 9294367B2 · Natarajan et al. · 2016 [cited by applicant]
US 9356866B1 · Sivaramakrishnan et al. · 2016 [cited by applicant]
US 9380002B2 · Johansson et al. · 2016 [cited by applicant]
US 9479415B2 · Natarajan et al. · 2016 [cited by applicant]
US 9565138B2 · Chen et al. · 2017 [cited by applicant]
US 9648542B2 · Hsu et al. · 2017 [cited by applicant]
US 20010049741A1 · Skene et al. · 2001 [cited by applicant]
US 20010052016A1 · Skene et al. · 2001 [cited by applicant]
US 20020009081A1 · Sampath et al. · 2002 [cited by applicant]
US 20020018796A1 · Wironen · 2002 [cited by applicant]
US 20020023089A1 · Woo · 2002 [cited by applicant]
US 20020026551A1 · Kamimaki et al. · 2002 [cited by applicant]
US 20020038360A1 · Andrews et al. · 2002 [cited by applicant]
US 20020055939A1 · Nardone et al. · 2002 [cited by applicant]
US 20020059170A1 · Vange · 2002 [cited by applicant]
US 20020059464A1 · Hata et al. · 2002 [cited by applicant]
US 20020062372A1 · Hong et al. · 2002 [cited by applicant]
US 20020078233A1 · Biliris et al. · 2002 [cited by applicant]
US 20020091840A1 · Pulier et al. · 2002 [cited by applicant]
US 20020112036A1 · Bohannan et al. · 2002 [cited by applicant]
US 20020120743A1 · Shabtay et al. · 2002 [cited by applicant]
US 20020124096A1 · Loguinov et al. · 2002 [cited by applicant]
US 20020133601A1 · Kennamer et al. · 2002 [cited by applicant]
US 20020150048A1 · Ha et al. · 2002 [cited by applicant]
US 20020154600A1 · Ido et al. · 2002 [cited by applicant]
US 20020188862A1 · Trethewey et al. · 2002 [cited by applicant]
US 20020194324A1 · Guba · 2002 [cited by applicant]
US 20020194335A1 · Maynard · 2002 [cited by applicant]
US 20030023744A1 · Sadot et al. · 2003 [cited by applicant]
US 20030031185A1 · Kikuchi et al. · 2003 [cited by applicant]
US 20030035430A1 · Islam et al. · 2003 [cited by applicant]
US 20030065711A1 · Acharya et al. · 2003 [cited by applicant]
US 20030065763A1 · Swildens et al. · 2003 [cited by applicant]
US 20030105797A1 · Dolev et al. · 2003 [cited by applicant]
US 20030115283A1 · Barbir et al. · 2003 [cited by applicant]
US 20030135509A1 · Davis et al. · 2003 [cited by applicant]
US 20030202511A1 · Sreejith et al. · 2003 [cited by applicant]
US 20030210686A1 · Terrell et al. · 2003 [cited by applicant]
US 20030210694A1 · Jayaraman et al. · 2003 [cited by applicant]
US 20030229697A1 · Borella · 2003 [cited by applicant]
US 20040019680A1 · Chao et al. · 2004 [cited by applicant]
US 20040024872A1 · Kelley et al. · 2004 [cited by applicant]
US 20040032868A1 · Oda et al. · 2004 [cited by applicant]
US 20040064577A1 · Dahlin et al. · 2004 [cited by applicant]
US 20040194102A1 · Neerdaels · 2004 [cited by applicant]
US 20040243718A1 · Fujiyoshi · 2004 [cited by applicant]
US 20040249939A1 · Amini et al. · 2004 [cited by applicant]
US 20040249971A1 · Klinker · 2004 [cited by applicant]
US 20050021883A1 · Sbishizuka et al. · 2005 [cited by applicant]
US 20050033858A1 · Swildens et al. · 2005 [cited by applicant]
US 20050060418A1 · Sorokopud · 2005 [cited by applicant]
US 20050060427A1 · Phillips et al. · 2005 [cited by applicant]
US 20050086295A1 · Cunningham et al. · 2005 [cited by applicant]
US 20050149531A1 · Srivastava · 2005 [cited by applicant]
US 20050169180A1 · Ludwig · 2005 [cited by applicant]
US 20050190695A1 · Phaal · 2005 [cited by applicant]
US 20050207417A1 · Ogawa et al. · 2005 [cited by applicant]
US 20050278565A1 · Frattura et al. · 2005 [cited by applicant]
US 20050286416A1 · Shimonishi et al. · 2005 [cited by applicant]
US 20060036743A1 · Deng et al. · 2006 [cited by applicant]
US 20060039374A1 · Belz et al. · 2006 [cited by applicant]
US 20060045082A1 · Fertell et al. · 2006 [cited by applicant]
US 20060143300A1 · See et al. · 2006 [cited by applicant]
US 20070044141A1 · Lor et al. · 2007 [cited by applicant]
US 20070053296A1 · Yazaki et al. · 2007 [cited by applicant]
US 20070171918A1 · Ota et al. · 2007 [cited by applicant]
US 20070195761A1 · Tatar et al. · 2007 [cited by applicant]
US 20070233891A1 · Luby et al. · 2007 [cited by applicant]
US 20080002591A1 · Ueno · 2008 [cited by applicant]
US 20080028077A1 · Kamata et al. · 2008 [cited by applicant]
US 20080031141A1 · Lean et al. · 2008 [cited by applicant]
US 20080089336A1 · Mercier et al. · 2008 [cited by applicant]
US 20080137660A1 · Olakangil et al. · 2008 [cited by applicant]
US 20080159141A1 · Soukup et al. · 2008 [cited by applicant]
US 20080181119A1 · Beyers · 2008 [cited by applicant]
US 20080195731A1 · Harmel et al. · 2008 [cited by applicant]
US 20080225710A1 · Raja et al. · 2008 [cited by applicant]
US 20080304423A1 · Chuang et al. · 2008 [cited by applicant]
US 20090109933A1 · Murasawa et al. · 2009 [cited by applicant]
US 20090135835A1 · Gallatin et al. · 2009 [cited by applicant]
US 20090240644A1 · Boettcher et al. · 2009 [cited by applicant]
US 20090245244A1 · Coene · 2009 [cited by examiner]
US 20090262745A1 · Leong et al. · 2009 [cited by applicant]
US 20100011126A1 · Hsu et al. · 2010 [cited by applicant]
US 20100135323A1 · Leong · 2010 [cited by applicant]
US 20100209047A1 · Cheung et al. · 2010 [cited by applicant]
US 20100228974A1 · Watts et al. · 2010 [cited by applicant]
US 20100293296A1 · Hsu et al. · 2010 [cited by applicant]
US 20100325178A1 · Won et al. · 2010 [cited by applicant]
US 20110044349A1 · Gallatin et al. · 2011 [cited by applicant]
US 20110058566A1 · Leong et al. · 2011 [cited by applicant]
US 20110211443A1 · Leong et al. · 2011 [cited by applicant]
US 20110216771A1 · Gallatin et al. · 2011 [cited by applicant]
US 20110283016A1 · Uchida · 2011 [cited by applicant]
US 20120023340A1 · Cheung · 2012 [cited by applicant]
US 20120033556A1 · Kruglick · 2012 [cited by examiner]
US 20120069737A1 · Vikberg et al. · 2012 [cited by applicant]
US 20120103518A1 · Kakimoto et al. · 2012 [cited by applicant]
US 20120157088A1 · Gerber et al. · 2012 [cited by applicant]
US 20120201137A1 · Le Faucheur et al. · 2012 [cited by applicant]
US 20120243533A1 · Leong · 2012 [cited by applicant]
US 20120257635A1 · Gallatin et al. · 2012 [cited by applicant]
US 20120275311A1 · Ivershen · 2012 [cited by examiner]
US 20130010613A1 · Cafarelli et al. · 2013 [cited by applicant]
US 20130028072A1 · Addanki · 2013 [cited by applicant]
US 20130034107A1 · Leong et al. · 2013 [cited by applicant]
US 20130156029A1 · Gallatin et al. · 2013 [cited by applicant]
US 20130173784A1 · Wang et al. · 2013 [cited by applicant]
US 20130201984A1 · Wang · 2013 [cited by applicant]
US 20130259037A1 · Natarajan et al. · 2013 [cited by applicant]
US 20130272135A1 · Leong · 2013 [cited by applicant]
US 20130281098A1 · Fujii · 2013 [cited by examiner]
US 20130339540A1 · Sheer · 2013 [cited by applicant]
US 20140003333A1 · Ivershen et al. · 2014 [cited by applicant]
US 20140016500A1 · Leong et al. · 2014 [cited by applicant]
US 20140022916A1 · Natarajan et al. · 2014 [cited by applicant]
US 20140029451A1 · Nguyen · 2014 [cited by applicant]
US 20140040478A1 · Hsu et al. · 2014 [cited by applicant]
US 20140101297A1 · Neisinger et al. · 2014 [cited by applicant]
US 20140161120A1 · Lkaheimo · 2014 [cited by applicant]
US 20140204747A1 · Yu et al. · 2014 [cited by applicant]
US 20140219100A1 · Pandey et al. · 2014 [cited by applicant]
US 20140233399A1 · Mann et al. · 2014 [cited by applicant]
US 20140321278A1 · Cafarelli et al. · 2014 [cited by applicant]
US 20150009828A1 · Murakami · 2015 [cited by applicant]
US 20150009830A1 · Bisht et al. · 2015 [cited by applicant]
US 20150016306A1 · Masini et al. · 2015 [cited by applicant]
US 20150033169A1 · Lection et al. · 2015 [cited by applicant]
US 20150071171A1 · Akiyoshi · 2015 [cited by applicant]
US 20150103824A1 · Tanabe · 2015 [cited by applicant]
US 20150142935A1 · Srinivas et al. · 2015 [cited by applicant]
US 20150170920A1 · Purayath et al. · 2015 [cited by applicant]
US 20150180802A1 · Chen et al. · 2015 [cited by applicant]
US 20150195192A1 · Vasseur et al. · 2015 [cited by applicant]
US 20150207905A1 · Merchant et al. · 2015 [cited by applicant]
US 20150215841A1 · Hsu et al. · 2015 [cited by applicant]
US 20150256436A1 · Stoyanov et al. · 2015 [cited by applicant]
US 20150263889A1 · Newton · 2015 [cited by applicant]
US 20150281125A1 · Koponen et al. · 2015 [cited by applicant]
US 20150319070A1 · Nachum · 2015 [cited by applicant]
US 20150372840A1 · Benny et al. · 2015 [cited by applicant]
US 20160119234A1 · Valencia Lopez et al. · 2016 [cited by applicant]
US 20160149811A1 · Roch et al. · 2016 [cited by applicant]
US 20160164768A1 · Natarajan et al. · 2016 [cited by applicant]
US 20160182329A1 · Armolavicius et al. · 2016 [cited by applicant]
US 20160182369A1 · Vasudevan · 2016 [cited by examiner]
US 20160182378A1 · Basavaraja et al. · 2016 [cited by applicant]
US 20160204996A1 · Lindgren et al. · 2016 [cited by applicant]
US 20160248655A1 · Francisco et al. · 2016 [cited by applicant]
US 20160255021A1 · Renfrew · 2016 [cited by applicant]
US 20160285735A1 · Chen et al. · 2016 [cited by applicant]
US 20160285762A1 · Chen et al. · 2016 [cited by applicant]
US 20160285763A1 · Laxman et al. · 2016 [cited by applicant]
US 20160308766A1 · Register et al. · 2016 [cited by applicant]
US 20160373303A1 · Vedam et al. · 2016 [cited by applicant]
US 20160373304A1 · Sharma et al. · 2016 [cited by applicant]
US 20160373351A1 · Sharma et al. · 2016 [cited by applicant]
US 20160373352A1 · Sharma et al. · 2016 [cited by applicant]
US 20160380861A1 · Ali · 2016 [cited by examiner]
US 20170026405A1 · Vengalil · 2017 [cited by examiner]
US 20170187649A1 · Chen et al. · 2017 [cited by applicant]
US 20170237632A1 · Hegde et al. · 2017 [cited by applicant]
US 20170237633A1 · Hegde et al. · 2017 [cited by applicant]
US 20170237838A1 · Vandevoorde et al. · 2017 [cited by applicant]
US 20170331665A1 · Porfiri · 2017 [cited by examiner]
US 20180367651A1 · Li · 2018 [cited by examiner]
CN 101677292B · 2010 [cited by applicant]
EP 2654340A1 · 2013 [cited by applicant]
EP 3206344A2 · 2017 [cited by applicant]
EP 3206345A2 · 2017 [cited by applicant]
IE 20070438A1 · 2008 [cited by applicant]
IN 201641016960 · 2016 [cited by applicant]
IN 201641035761 · 2016 [cited by applicant]
WO WO2010135474A1 · 2010 [cited by applicant]
WO WO2015116538A1 · 2015 [cited by applicant]
WO WO2015138513A1 · 2015 [cited by applicant]
Armando L. Caro Jr. etc., SCTP: A Proposed Standard for Robust Internet Data Transport, 2003, IEEE Computer Society, 0018-9162/03 (Year: 2003). [cited by examiner]
R. Stewart, Ed, RFC4960, Stream Control Transmission Protocol (Year: 2007). [cited by examiner]
Indian Provisional Patent Application entitled: “System and Method for Offiine Load Balancing of SCTP Protocol Traffic”; Appln. No. 201641010295 filed Mar. 24, 2016; 13 pages. [cited by applicant]
7433 GTP Session Controller, www.ixia.com, downloaded circa Apr. 12, 2015, pp. 1-3. [cited by applicant]
Stateful GTP Correlation, https://www.gigamon.com/PDF/appnote/AN-GTP-Correlation-Stateful-Subscriber-Aware-Filtering-4025.pdf, date 2013, pp. 1-9. [cited by applicant]
Giga VUE-2404 // Data Sheet, www.gigamon.com, date Feb. 2014, pp. 1-6. [cited by applicant]
NGenius Performance Manager, www.netscout.com, date Mar. 2014, pp. 1-8. [cited by applicant]
Giga VUE-VM // Data Sheet, www.gigamon.com, date Oct. 2014, pp. 1-3. [cited by applicant]
Unified Visibility Fabric an Innovative Approach, https://www.gigamon.com/unified-visibility-fabric, downloaded circa Mar. 30, 2015, pp. 1-4. [cited by applicant]
adaptiv.io and Apsalar Form Strategic Partnership to Provide Omni-channel Mobile Data Intelligence, http://www.businesswire.com/news/home/20150113005721/en/adaptiv.io-Apsalar-Form-Strategic-Partnership-Provide-Omni-chan… [cited by applicant]
Real-time Data Analytics with IBM InfoSphere Streams and Brocade MLXe Series Devices, www.brocade.com, date 2011, pp. 1-2. [cited by applicant]
Syniverse Proactive Roaming Data Analysis—VisProactive, http://m.syniverse.com/files/service_solutions/pdf/solutionsheet_visproactive_314.pdf., date 2014, pp. 1-3. [cited by applicant]
Network Analytics: Product Overview, www.sandvine.com, date Apr. 28, 2014, pp. 1-2. [cited by applicant]
Krishnan et al.: “Mechanisms for Optimizing LAG/ECMP Component Link Utilization in Networks”, Oct. 7, 2014, 27 pages, https://tools.ietf.org/html/drafl-ietf-opsawg-large-flow-load-balancing-15. [cited by applicant]
U.S. Appl. No. 12/272,618, NonFinal Office Action mailed on Jan. 12, 2015, 5 pages. [cited by applicant]
U.S. Appl. No. 12/272,618, Notice of Allowance mailed on Aug. 26, 2015, 11 pages. [cited by applicant]
U.S. Appl. No. 12/272,618, Final Office Action mailed on Feb. 28, 2012, 12 pages. [cited by applicant]
U.S. Appl. No. 13/925,670, Non Final Office Action mailed on Nov. 16, 2015, 48 pages. [cited by applicant]
U.S. Appl. No. 14/230,590, Notice of Allowance mailed on Sep. 23, 2015, 8 pages. [cited by applicant]
U.S. Appl. No. 15/043,421, Notice of Allowance mailed on Jun. 27, 2016, 21 pages. [cited by applicant]
U.S. Appl. No. 14/603,304, Non Final Office Action mailed on Aug. 1, 2016, 86 pages. [cited by applicant]
U.S. Appl. No. 14/320,138, Notice of Allowance mailed on Sep. 23, 2016, 17 pages. [cited by applicant]
U.S. Appl. No. 14/603,304, Notice of Allowance mailed on Jan. 11, 2017, 13 pages. [cited by applicant]
U.S. Appl. No. 14/848,677, Non Final Office Action mailed on Feb. 10, 2017, 83 pages. [cited by applicant]
IBM User Guide, Version 2.1AIX, Solaris and Windows NT, Third Edition (Mar. 1999) 102 pages. [cited by applicant]
White Paper, Foundry Networks, “Server Load Balancing in Today's Web-Enabled Enterprises” Apr. 2002 10 pages. [cited by applicant]
Intemational Search Report & Written Opinion for PCT Application PCT/US2015/012915 mailed Apr. 10, 2015, 15 pages. [cited by applicant]
Gigamon: Vistapointe Technology Solution Brief; Visualize-Optimize-Monetize-3100-02; Feb. 2014; 2 pages. [cited by applicant]
Gigamon: Netflow Generation Feature Brief; 3099-04; Oct. 2014; 2 pages. [cited by applicant]
Gigamon: Unified Visibility Fabric Solution Brief; 3018-03; Jan. 2015; 4 pages. [cited by applicant]
Gigamon: Active Visibility for Multi-Tiered Security Solutions Overview; 3127-02; Oct. 2014; 5 pages. [cited by applicant]
Gigamon: Enabling Network Monitoring at 40Gbps and 100Gbps with Flow Mapping Technology White Paper; 2012; 4 pages. [cited by applicant]
Gigamon: Enterprise System Reference Architecture for the Visibility Fabric White Paper; 5005-03; Oct. 2014; 13 pages. [cited by applicant]
Gigamon: Gigamon Intelligent Flow Mapping White Paper; 3039-02; Aug. 2013; 7 pages. [cited by applicant]
Gigamon: Maintaining 3G and 4G LTE Quality of Service White Paper; 2012; 4 pages. [cited by applicant]
Gigamon: Monitoring, Managing, and Securing SDN Deployments White Paper; 3106-01; May 2014; 7 pages. [cited by applicant]
Gigamon: Service Provider System Reference Architecture for the Visibility Fabric White Paper; 5004-01; Mar. 2014; 11 pages. [cited by applicant]
Gigamon: Unified Visibility Fabric—A New Approach to Visibility White Paper; 3072-04; Jan. 2015; 6 pages. [cited by applicant]
Gigamon: The Visibility Fabric Architecture—A New Approach to Traffic Visibility White Paper; 2012-2013; 8 pages. [cited by applicant]
Ixia: Creating a Visibility Architecture—a New Perspective on Network Visibilty White Paper; 915-6581-01 Rev. A, Feb. 2014; 14 pages. [cited by applicant]
Gigamon: Unified Visibility Fabric; https:/lwww.gigamon.com/unfied-visibility-fabric; Apr. 7, 2015; 5 pages. [cited by applicant]
Gigamon: Application Note Stateful GTP Correlation; 4025-02; Dec. 2013; 9 pages. [cited by applicant]
Brocade and IBM Real-Time Network Analysis Solution; 2011 Brocade Communications Systems, Inc.; 2 pages. [cited by applicant]
Ixia Anue GTP Session Controller; Solution Brief; 915-6606-01 Rev. A, Sep. 2013; 2 pages. [cited by applicant]
Netscout; Comprehensive Core-to-Access IP Session Analysis for GPRS and UMTS Networks; Technical Brief; Jul. 16, 2010; 6 pages. [cited by applicant]
Netscout: nGenius Subscriber Intelligence; Data Sheet; SPDS_001-12; 2012; 6 pages. [cited by applicant]
Gigamon: Visibility Fabric Architecture Solution Brief; 2012-2013; 2 pages. [cited by applicant]
Gigamon: Visibility Fabric; More than Tap and Aggregation.bmp; 2014; 1 page. [cited by applicant]