IP Library › Granted Patent US 12,328,253
Granted Patent B2
US 12,328,253 · App. 18/179,145 · Granted Jun 10, 2025

Scalable network slice based queuing using segment routing flexible algorithm

Inventors: Clarence Filsfils (Brussels, BE); Zafar Ali (Hicksville, NY); Pablo Camarillo Garvia (Madrid, ES); Francois Clad (Strasbourg, FR)
Assignee: Cisco Technology, Inc.
H04L45/302H04L41/12H04L43/0888H04L47/10H04L47/24H04L47/6295H04L47/70H04W76/11
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,328,253
App. No.
18/179,145
Granted
Jun 10, 2025
Kind
B2
Abstract

The present technology is directed to a system and method for implementing network resource partitioning and Quality of Service (QoS) separation through network slicing. Embodiments of the present invention describe scalable network slicing method based on defining Segment Routing Flexible Algorithm to represent a network slice and assigning a distinct QoS policy queue to each of the Flexible Algorithms configured on a network node. Therefore, scalable network slice based queuing is implemented wherein a single packet processing queue is assigned to each Flex-Algorithm based network slice. QoS policy queue may be implemented in a hierarchical fashion by differentiation between flow packets in a single QoS policy queue based on value of experimental bits in the header.

Claims (37)

1. A computer-implemented method comprising:

associating one or more forwarding paths determined from one or more routing algorithms with respective network slices, each of the respective network slices having a specified Quality of Service requirement of respective applications;

assigning flow packets, associated with the one or more forwarding paths of with the respective network slices, to one or more of a plurality of queues based on the one or more routing algorithms, wherein each of the plurality of queues having one of the specified Quality of Service requirement;

pointing one or more forwarding entries, including at least one or more prefixes of the one or more routing algorithms, towards an associated one of the of the plurality of queues;

queuing the flow packets to the associated one of the plurality of queues based on the forwarding entries; and

differentiating packets within a same corresponding one of the plurality of queues into one or more sub-queues within the same corresponding one of the plurality of queues.

2. The computer-implemented method of claim 1 , wherein the one or more routing algorithms include at least one Flexible Algorithm.

3. The computer-implemented method of claim 1 , wherein the pointing of the one or more forwarding entries is implemented as Quality of Service propagation.

4. The computer-implemented method of claim 1 , wherein a depth of the plurality of queues is monitored by one or more controller entities.

5. The computer-implemented method of claim 4 , wherein the one or more controller entities are configured to provide notifications regarding the network slice based on the depth of the plurality of queues.

6. The computer-implemented method of claim 5 , wherein the one or more controller entities include one or more path computation elements.

7. The computer-implemented method of claim 1 , wherein the plurality of queues are provisioned on one or more network nodes configured for the one or more routing algorithms.

8. The computer-implemented method of claim 7 , wherein each of the one or more routing algorithms correspond to a different network slice with specific performance characteristics.

9. The computer-implemented method of claim 1 , wherein the plurality of queues include one or more bit-based sub queues and are implemented hierarchically to enable differentiation of the flow packets associated with each of the plurality of queues based on experimental bit values.

10. The computer-implemented method of claim 1 , wherein the plurality of queues corresponding to the one or more routing algorithms are provisioned on one or more edge routers.

11. A non-transitory computer-readable storage medium comprising instructions stored therein which, when executed by one or more processors, cause the one or more processors to perform operations comprising:

associating one or more forwarding paths determined from one or more routing algorithms with respective network slices, each of the respective network slices having a specified Quality of Service requirement of respective applications;

assigning flow packets, associated with the one or more forwarding paths of the respective network slices, to one or more of a plurality of queues based on the one or more routing algorithms, wherein each of the plurality of queues having one of the specified Quality of Service requirement;

pointing one or more forwarding entries, including at least one or more prefixes of the one or more routing algorithms, towards an associated one of the plurality of queues;

queuing the flow packets to the associated one of the plurality of queues based on the forwarding entries; and

differentiating packets within a same corresponding one of the plurality of queues into one or more sub-queues within the same corresponding one of the plurality of queues.

12. The non-transitory computer-readable storage medium of claim 11 , wherein each of the plurality of queues include one or more bit-based sub queues and are implemented hierarchically to enable differentiation of the flow packets associated with each of the plurality of queues based on experimental bit values.

13. The non-transitory computer-readable storage medium of claim 11 , wherein the one or more routing algorithms include Flexible Algorithms.

14. The non-transitory computer-readable storage medium of claim 11 , wherein pointing the one or more forwarding entries is implemented as Quality of Service propagation.

15. The non-transitory computer-readable storage medium of claim 11 , wherein a depth of the one or more queues is monitored by one or more controller entities.

16. The non-transitory computer-readable storage medium of claim 15 , wherein the one or more controller entities are configured to provide notifications regarding the network slice, based on the depth of the plurality of queue.

17. The non-transitory computer-readable storage medium of claim 11 , wherein the plurality of queues are provisioned on one or more network nodes configured for the one or more routing algorithms.

18. The non-transitory computer-readable storage medium of claim 17 , wherein each of the one or more routing algorithms correspond to a different network slice with specific performance characteristics.

19. A system comprising:

one or more processors; and

a memory storing instructions which when executed by the one or more processors, cause the system to perform operations comprising:

associating one or more forwarding paths determined from one or more routing algorithms with respective network slices, each of the respective network slices having a specified Quality of Service requirement of respective applications;

assigning flow packets, associated with the one or more forwarding paths of the respective network slices, to one or more of a plurality of queues based on the one or more routing algorithms, wherein each of the plurality of queues having one of the specified Quality of Service requirement;

pointing one or more forwarding entries, including at least one or more prefixes of the one or more routing algorithms, towards an associated one of the plurality of queues;

queuing the flow packets to the associated one of the plurality of queues based on the forwarding entries; and

differentiating packets within a same corresponding one of the plurality of queues into one or more sub-queues within the same corresponding one of the plurality of queues.

20. The system of claim 19 , wherein pointing the one or more forwarding entries is implemented as Quality of Service propagation.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Mar 6, 2023
From: FILSFILS, CLARENCE; ALI, ZAFAR; GARVIA, PABLO CAMARILLO; CLAD, FRANCOIS
To: CISCO TECHNOLOGY, INC.
Reel/Frame 062895/0908 →
Continuity (3)
Continuation 16825168 · Mar 20, 2020
Continuation 16178418 · Nov 1, 2018
Related Publication 20230283568A1 · Sep 7, 2023
References Cited (266)
US 4236068A · Walton · 1980 [cited by applicant]
US 5642303A · Small et al. · 1997 [cited by applicant]
US 5751223A · Turner · 1998 [cited by applicant]
US 6812824B1 · Goldinger et al. · 2004 [cited by applicant]
US 7006472B1 · Innnnonen · 2006 [cited by applicant]
US 7177295B1 · Sholander · 2007 [cited by examiner]
US D552603S · Tierney · 2007 [cited by applicant]
US 7573862B2 · Chambers et al. · 2009 [cited by applicant]
US 7606154B1 · Lee · 2009 [cited by examiner]
US D637569S · Desai et al. · 2011 [cited by applicant]
US 7975262B2 · Cozmei · 2011 [cited by applicant]
US 8010079B2 · Mia et al. · 2011 [cited by applicant]
US 8102814B2 · Rahman et al. · 2012 [cited by applicant]
US 8260320B2 · Herz · 2012 [cited by applicant]
US 8284748B2 · Borghei · 2012 [cited by applicant]
US 8300594B1 · Bernier et al. · 2012 [cited by applicant]
US 8325626B2 · Toth et al. · 2012 [cited by applicant]
US 8396485B2 · Grainger et al. · 2013 [cited by applicant]
US 8446899B2 · Lei et al. · 2013 [cited by applicant]
US 8457145B2 · Zimmerman et al. · 2013 [cited by applicant]
US 8458184B2 · Dorogusker et al. · 2013 [cited by applicant]
US D691636S · Bunton · 2013 [cited by applicant]
US 8549638B2 · Aziz · 2013 [cited by applicant]
US 8553634B2 · Chun et al. · 2013 [cited by applicant]
US 8644301B2 · Tamhankar et al. · 2014 [cited by applicant]
US 8650279B2 · Mehta et al. · 2014 [cited by applicant]
US 8669902B2 · Pandey et al. · 2014 [cited by applicant]
US 8676182B2 · Bell et al. · 2014 [cited by applicant]
US 8682279B2 · Rudolf et al. · 2014 [cited by applicant]
US 8693367B2 · Chowdhury et al. · 2014 [cited by applicant]
US 8718644B2 · Thomas et al. · 2014 [cited by applicant]
US 8761174B2 · Jing et al. · 2014 [cited by applicant]
US 8768389B2 · Nenner et al. · 2014 [cited by applicant]
US 8849283B2 · Rudolf et al. · 2014 [cited by applicant]
US 8909698B2 · Parmar et al. · 2014 [cited by applicant]
US 8958318B1 · Hastwell et al. · 2015 [cited by applicant]
US 9060352B2 · Chan et al. · 2015 [cited by applicant]
US 9130859B1 · Knappe · 2015 [cited by applicant]
US 9173084B1 · Foskett · 2015 [cited by applicant]
US 9173158B2 · Varma · 2015 [cited by applicant]
US D744464S · Snyder et al. · 2015 [cited by applicant]
US 9270709B2 · Shatzkamer et al. · 2016 [cited by applicant]
US 9271216B2 · Friman et al. · 2016 [cited by applicant]
US 9281955B2 · Moreno et al. · 2016 [cited by applicant]
US D757424S · Phillips et al. · 2016 [cited by applicant]
US D759639S · Moon et al. · 2016 [cited by applicant]
US 9369387B2 · Filsfils et al. · 2016 [cited by applicant]
US 9389992B2 · Gataullin et al. · 2016 [cited by applicant]
US 9426305B2 · De et al. · 2016 [cited by applicant]
US D767548S · Snyder et al. · 2016 [cited by applicant]
US 9467918B1 · Kwan · 2016 [cited by applicant]
US D776634S · Lee et al. · 2017 [cited by applicant]
US 9544337B2 · Eswara et al. · 2017 [cited by applicant]
US 9569771B2 · Lesavich et al. · 2017 [cited by applicant]
US 9609504B2 · Karlqvist et al. · 2017 [cited by applicant]
US 9615268B2 · Navarro et al. · 2017 [cited by applicant]
US 9634952B2 · Gopinathan et al. · 2017 [cited by applicant]
US 9642167B1 · Snyder et al. · 2017 [cited by applicant]
US 9654344B2 · Chan et al. · 2017 [cited by applicant]
US 9712444B1 · Bolshinsky et al. · 2017 [cited by applicant]
US 9713114B2 · Yu · 2017 [cited by applicant]
US 9736056B2 · Vasseur et al. · 2017 [cited by applicant]
US 9762683B2 · Karampurwala et al. · 2017 [cited by applicant]
US 9772927B2 · Gounares et al. · 2017 [cited by applicant]
US 9820105B2 · Snyder et al. · 2017 [cited by applicant]
US D804450S · Spiel et al. · 2017 [cited by applicant]
US 9858559B2 · Raleigh et al. · 2018 [cited by applicant]
US 9860151B2 · Ganichev et al. · 2018 [cited by applicant]
US 9923780B2 · Rao et al. · 2018 [cited by applicant]
US 9933224B2 · Dorne et al. · 2018 [cited by applicant]
US 9961560B2 · Farkas et al. · 2018 [cited by applicant]
US 9967906B2 · Verkaik et al. · 2018 [cited by applicant]
US 9980220B2 · Snyder et al. · 2018 [cited by applicant]
US 9985837B2 · Rao et al. · 2018 [cited by applicant]
US 9998368B2 · Chen et al. · 2018 [cited by applicant]
US 10601724B1 · Filsfils · 2020 [cited by examiner]
US 11627094B2 · Filsfils · 2023 [cited by examiner]
US 20020016937A1 · Houh · 2002 [cited by examiner]
US 20020095498A1 · Chanda · 2002 [cited by examiner]
US 20020097674A1 · Balabhadrapatruni et al. · 2002 [cited by applicant]
US 20030087645A1 · Kim et al. · 2003 [cited by applicant]
US 20030116634A1 · Tanaka · 2003 [cited by applicant]
US 20040177087A1 · Wu · 2004 [cited by examiner]
US 20040203572A1 · Aerrabotu et al. · 2004 [cited by applicant]
US 20050090225A1 · Muehleisen et al. · 2005 [cited by applicant]
US 20050169193A1 · Black et al. · 2005 [cited by applicant]
US 20050186904A1 · Kowalski et al. · 2005 [cited by applicant]
US 20060022815A1 · Fischer et al. · 2006 [cited by applicant]
US 20060030290A1 · Rudolf et al. · 2006 [cited by applicant]
US 20060092964A1 · Park et al. · 2006 [cited by applicant]
US 20060126882A1 · Deng et al. · 2006 [cited by applicant]
US 20060187866A1 · Werb et al. · 2006 [cited by applicant]
US 20070037605A1 · Logan · 2007 [cited by applicant]
US 20070239854A1 · Janakiraman et al. · 2007 [cited by applicant]
US 20070291791A1 · English et al. · 2007 [cited by applicant]
US 20080037715A1 · Prozeniuk et al. · 2008 [cited by applicant]
US 20080084888A1 · Yadav et al. · 2008 [cited by applicant]
US 20080101381A1 · Sun et al. · 2008 [cited by applicant]
US 20080163207A1 · Reumann et al. · 2008 [cited by applicant]
US 20080233969A1 · Mergen · 2008 [cited by applicant]
US 20090129389A1 · Halna Defretay et al. · 2009 [cited by applicant]
US 20090203370A1 · Giles et al. · 2009 [cited by applicant]
US 20090282048A1 · Ransom et al. · 2009 [cited by applicant]
US 20090298511A1 · Paulson · 2009 [cited by applicant]
US 20090307485A1 · Weniger et al. · 2009 [cited by applicant]
US 20100039280A1 · Holm et al. · 2010 [cited by applicant]
US 20100097969A1 · De Kimpe et al. · 2010 [cited by applicant]
US 20110087799A1 · Padhye et al. · 2011 [cited by applicant]
US 20110142053A1 · Van Der Merwe et al. · 2011 [cited by applicant]
US 20110182295A1 · Singh et al. · 2011 [cited by applicant]
US 20110194553A1 · Sahin et al. · 2011 [cited by applicant]
US 20110228779A1 · Goergen · 2011 [cited by applicant]
US 20120023552A1 · Brown · 2012 [cited by applicant]
US 20120054367A1 · Ramakrishnan et al. · 2012 [cited by applicant]
US 20120088476A1 · Greenfield · 2012 [cited by applicant]
US 20120115512A1 · Grainger et al. · 2012 [cited by applicant]
US 20120157126A1 · Rekimoto · 2012 [cited by applicant]
US 20120167207A1 · Beckley et al. · 2012 [cited by applicant]
US 20120182147A1 · Forster · 2012 [cited by applicant]
US 20120311127A1 · Kandula et al. · 2012 [cited by applicant]
US 20120324035A1 · Cantu et al. · 2012 [cited by applicant]
US 20130029685A1 · Moshfeghi · 2013 [cited by applicant]
US 20130039391A1 · Skarp · 2013 [cited by applicant]
US 20130057435A1 · Kim · 2013 [cited by applicant]
US 20130077612A1 · Khorami · 2013 [cited by applicant]
US 20130088983A1 · Pragada et al. · 2013 [cited by applicant]
US 20130107853A1 · Pettus et al. · 2013 [cited by applicant]
US 20130108263A1 · Srinivas et al. · 2013 [cited by applicant]
US 20130115916A1 · Herz · 2013 [cited by applicant]
US 20130145008A1 · Kannan et al. · 2013 [cited by applicant]
US 20130155906A1 · Nachum et al. · 2013 [cited by applicant]
US 20130191567A1 · Rofougaran et al. · 2013 [cited by applicant]
US 20130203445A1 · Grainger et al. · 2013 [cited by applicant]
US 20130217332A1 · Altman et al. · 2013 [cited by applicant]
US 20130232433A1 · Krajec et al. · 2013 [cited by applicant]
US 20130273938A1 · Ng et al. · 2013 [cited by applicant]
US 20130317944A1 · Huang et al. · 2013 [cited by applicant]
US 20130322438A1 · Gospodarek et al. · 2013 [cited by applicant]
US 20130343198A1 · Chhabra et al. · 2013 [cited by applicant]
US 20130347103A1 · Veteikis et al. · 2013 [cited by applicant]
US 20140007089A1 · Bosch et al. · 2014 [cited by applicant]
US 20140016926A1 · Soto et al. · 2014 [cited by applicant]
US 20140025770A1 · Warfield et al. · 2014 [cited by applicant]
US 20140031031A1 · Gauvreau et al. · 2014 [cited by applicant]
US 20140052508A1 · Pandey et al. · 2014 [cited by applicant]
US 20140059655A1 · Beckley et al. · 2014 [cited by applicant]
US 20140087693A1 · Walby et al. · 2014 [cited by applicant]
US 20140105213A1 · Ak et al. · 2014 [cited by applicant]
US 20140118113A1 · Kaushik et al. · 2014 [cited by applicant]
US 20140148196A1 · Bassan-Eskenazi et al. · 2014 [cited by applicant]
US 20140179352A1 · V.M. et al. · 2014 [cited by applicant]
US 20140191868A1 · Ortiz et al. · 2014 [cited by applicant]
US 20140198808A1 · Zhou · 2014 [cited by applicant]
US 20140222997A1 · Mermoud et al. · 2014 [cited by applicant]
US 20140233460A1 · Pettus et al. · 2014 [cited by applicant]
US 20140269321A1 · Kamble et al. · 2014 [cited by applicant]
US 20140302869A1 · Rosenbaum et al. · 2014 [cited by applicant]
US 20140337824A1 · St. John et al. · 2014 [cited by applicant]
US 20140341568A1 · Zhang et al. · 2014 [cited by applicant]
US 20150016286A1 · Ganichev et al. · 2015 [cited by applicant]
US 20150016469A1 · Ganichev et al. · 2015 [cited by applicant]
US 20150023176A1 · Korja et al. · 2015 [cited by applicant]
US 20150030024A1 · Venkataswami et al. · 2015 [cited by applicant]
US 20150043581A1 · Devireddy et al. · 2015 [cited by applicant]
US 20150063166A1 · Sif et al. · 2015 [cited by applicant]
US 20150065161A1 · Ganesh et al. · 2015 [cited by applicant]
US 20150087330A1 · Prechner et al. · 2015 [cited by applicant]
US 20150103818A1 · Kuhn et al. · 2015 [cited by applicant]
US 20150163192A1 · Jain et al. · 2015 [cited by applicant]
US 20150172391A1 · Kasslin et al. · 2015 [cited by applicant]
US 20150223337A1 · Steinmacher-Burow · 2015 [cited by applicant]
US 20150256972A1 · Markhovsky et al. · 2015 [cited by applicant]
US 20150264519A1 · Mirzaei et al. · 2015 [cited by applicant]
US 20150280827A1 · Adiletta et al. · 2015 [cited by applicant]
US 20150288410A1 · Adiletta et al. · 2015 [cited by applicant]
US 20150326704A1 · Ko et al. · 2015 [cited by applicant]
US 20150358777A1 · Gupta · 2015 [cited by applicant]
US 20150362581A1 · Friedman et al. · 2015 [cited by applicant]
US 20160007315A1 · Lundgreen et al. · 2016 [cited by applicant]
US 20160044627A1 · Aggarwal et al. · 2016 [cited by applicant]
US 20160099847A1 · Melander et al. · 2016 [cited by applicant]
US 20160100395A1 · Xu et al. · 2016 [cited by applicant]
US 20160105408A1 · Cooper et al. · 2016 [cited by applicant]
US 20160127875A1 · Zampini, II · 2016 [cited by applicant]
US 20160146495A1 · Malve et al. · 2016 [cited by applicant]
US 20160234105A1 · Li et al. · 2016 [cited by applicant]
US 20160330045A1 · Tang et al. · 2016 [cited by applicant]
US 20160344641A1 · Javidi et al. · 2016 [cited by applicant]
US 20170026974A1 · Dey et al. · 2017 [cited by applicant]
US 20170054595A1 · Zhang et al. · 2017 [cited by applicant]
US 20170180999A1 · Alderfer et al. · 2017 [cited by applicant]
US 20170181136A1 · Bharadwaj et al. · 2017 [cited by applicant]
US 20170195205A1 · Li et al. · 2017 [cited by applicant]
US 20170202000A1 · Fu et al. · 2017 [cited by applicant]
US 20170214551A1 · Chan et al. · 2017 [cited by applicant]
US 20170257870A1 · Farmanbar et al. · 2017 [cited by applicant]
US 20170273083A1 · Chen et al. · 2017 [cited by applicant]
US 20170317997A1 · Smith et al. · 2017 [cited by applicant]
US 20170318468A1 · Aijaz · 2017 [cited by applicant]
US 20170332421A1 · Sternberg et al. · 2017 [cited by applicant]
US 20170339706A1 · Andreoli-Fang et al. · 2017 [cited by applicant]
US 20180063018A1 · Bosch et al. · 2018 [cited by applicant]
US 20180069311A1 · Pallas et al. · 2018 [cited by applicant]
US 20180084389A1 · Snyder et al. · 2018 [cited by applicant]
US 20180262585A1 · Zandi et al. · 2018 [cited by applicant]
US 20180270743A1 · Callard et al. · 2018 [cited by applicant]
US 20180309678A1 · Dillon · 2018 [cited by examiner]
US 20180367432A1 · Cociglio et al. · 2018 [cited by applicant]
US 20190068517A1 · Chen · 2019 [cited by examiner]
US 20190289647A1 · Li · 2019 [cited by examiner]
US 20200127948A1 · Jung · 2020 [cited by examiner]
US 20200244588A1 · Filsfils · 2020 [cited by examiner]
US 20230283568A1 · Filsfils · 2023 [cited by examiner]
WO 2013020126A1 · 2013 [cited by applicant]
WO 2014098556A1 · 2014 [cited by applicant]
WO 2015131920A1 · 2015 [cited by applicant]
WO 2017078657A1 · 2017 [cited by applicant]
WO 2017187011A1 · 2017 [cited by applicant]
WO 2017202334 · 2017 [cited by applicant]
WO 2018009340A1 · 2018 [cited by applicant]
WO 2018028777A1 · 2018 [cited by applicant]
WO 2018053271A1 · 2018 [cited by applicant]
WO 2018066362A1 · 2018 [cited by applicant]
Afolabi I., et al., “Network Slicing & Softwarization: A Survey on Principles, Enabling Technologies Solutions,” Mar. 21, 2018, pp. 1-24. [cited by applicant]
Ali Z., et al., “Performance Measurement in Segment Routing Networks with IPv6 Data Plane (SRv6); draft-ali-spring-srv6-pm-01.txt,” Spring Working Group, Feb. 26, 2018, pp. 1-17. [cited by applicant]
An X., et al., “Virtualization of Cellular Network EPC Gateways based on a Scalable SDN Architecture,” IEEE, Feb. 12, 2015, pp. 1-7. [cited by applicant]
Antonioli R.P., et al., “Dual Connectivity for LTE-NR Cellular Networks,” Research Gate, Sep. 3-6, 2017, pp. 171-175. [cited by applicant]
Bekan A., et al., “D5.1: Machine Learning Algorithms Development and Implementation,” 2016-2018 eWINE Consortium, 23, 2016, pp. 1-72. [cited by applicant]
Blogspot “I Love WiFi, The Difference between L2 and L3 Roaming Events,” Apr. 1, 2010, 6 Pages, Retrieved from URL: http://jenniferhuber.blogspot.com/2010/04/difference-between-12-and-13-roaming.html. [cited by applicant]
Bogale T.E., et al., “Machine Intelligence Techniques for Next-Generation Context-Aware Wireless Networks,” arxiv.org, Jan. 12, 2018, pp. 1-10. [cited by applicant]
Carter S.Sr., “E911 VoIP Essentials for Enterprise Deployments,” XO Communications, LLC, 2012, 9 pages. [cited by applicant]
Chalise B.K., et al., “MIMO Relaying for Multiaccess Communication in Cellular Networks,” Sensor Array and Multi Channel Signal Processing Workshop, 5th IEEE, Jul. 21, 2008, pp. 146-150. [cited by applicant]
Cheng W., et al., “Path Segment in MPLS Based Sement Routing Network; draft-cheng-spring-mpls-path-segment-00,” Network Working Group, Oct. 2017, pp. 1-10. [cited by applicant]
Christidis K., et al., “Blockchains and Smart Contracts for the Internet of Things,” IEEE Access, Special Section on the Plethora of Research in Internet of Things (IoT), May 10, 2016, pp. 2292-2303. [cited by applicant]
Cisco 10000 Series Router Quality of Service Configuration Guide, “Chapter 20: Configuring Quality of Service for MPLS Traffic,” Cisco Systems, Inc., Updated Nov. 17, 2013, pp. 1-34. [cited by applicant]
Cisco “ASR 5×00 Mobility Management Entity Administration Guide,” Version 15.0, Cisco, Last Updated Jun. 13, 2014, 266 Pages. [cited by applicant]
Cisco Systems, Inc., “Wi-Fi Location-Based Services 4.1 Design Guide,” May 20, 2008, 206 Pages. [cited by applicant]
Cox J.H.Jr., et al., “Advancing Software-Defined Networks: A Survey,” IEEE Access, Publication date Oct. 12, 2017, vol. 5, pp. 25487-25526. [cited by applicant]
Cui W., et al., “DiFS: Distributed Flow Scheduling for Data Center Networks,” Nanjing University, China, Jul. 28, 2013, 10 Pages. [cited by applicant]
De Sousa N.F.S., et al., “Network Service Orchestration: A Survey,” IEEE Communications Surveys Tutorials, Mar. 23, 2018, 30 Pages. [cited by applicant]
Doyle M.G., “An IP Address Management Solution for a Server Solution Provider,” A Dissertation Submitted to The University of Liverpool, Sep. 28, 2005, 116 Pages. [cited by applicant]
Enterprise Mobility 7.3 Design Guide, “Chapter 11: Cisco Mobility Services Engine,” Cisco Systems, Inc., Updated Apr. 20, 2015, 8 pages. [cited by applicant]
Galvan T.C.E., et al., “Wifi Bluetooth Based Combined Positioning Algorithm,” International Meeting of Electrical Engineering Research ENIINVIE 2012, Procedia Engineering, 2012, vol. 35, pp. 101-108. [cited by applicant]
Geller M., et al., “5G Security Innovation with Cisco,” Whitepaper Cisco Public, Jun. 8, 2018, pp. 1-29. [cited by applicant]
Gesbert D., “Advances in Multiuser MIMO Systems (Tutorial Part II) Emerging Topics in Multiuser MIMO Networks,” IEEE PIMRC Conference, Sep. 2007, 107 Pages. [cited by applicant]
Halperin D., et al., “Augmenting Data Center Networks with Multi-Gigabit Wireless Links,” SIGCOMM'11, Aug. 15-19, 2011, ACM978-1-4503-0797-Jan. 11, 2008, pp. 38-49. [cited by applicant]
Hsieh C., “Location Awareness in VMware View 4.5 and Above,” VMware, Information Guide, 2011, 8 Pages. [cited by applicant]
Husain S., et al., “Mobile Edge Computing with Network Resource Slicing for Internet-of-Things,” IEEE, 2017, 7 Pages. [cited by applicant]
International Preliminary Report on Patentability for International Application No. PCT/US2019/057322, mailed May 14, 2021, 9 Pages. [cited by applicant]
International Search Report and Written Opinion from the International Searching Authority, mailed Dec. 6, 2019, 10 pages, for corresponding International Patent Application No. PCT/US2019/057322. [cited by applicant]
Jero S., et al., “Identifier Binding Attacks and Defenses in Software-Defined Networks,” USENIX, The Advanced Computing Systems Association, Aug. 16-18, 2017, 19 Pages. [cited by applicant]
Ji P.N., et al., “Demonstration of High-Speed MIMO OFDM Flexible Bandwidth Data Center Network,” Optical Society of America, 2012, 2 Pages. [cited by applicant]
Kandula S., et al., “Flyways to De-Congest Data Center Networks,” Microsoft Research, Oct. 23, 2009, 6 Pages. [cited by applicant]
Katayama Y. et al., “MIMO Link Design Strategy for Wireless Data Center Applications,” IEEE Wireless Communications and Networking Conference: Services, Applications, and Business, 2012, 5 pages. [cited by applicant]
Leary J., et al., “Wireless LAN Fundamentals: Mobility | Characteristics of Roaming,” Ciscopress.com, Jan. 9, 2004, 15 pages. [cited by applicant]
Leonhardt U., “Supporting Location-Awareness in Open Distributed Systems,” Department of Computing Imperial College of Science, Technology and Medicine University of London, May 1998, 186 Pages. [cited by applicant]
Morozov Y., “BubbleTone Blockchain: Global Telecom Ecosystem Without Intermediaries: Smart Contracts Allow Direct Interaction between Mobile Operators, Subscribers and Service Providers,” Blockchain Telecom, Dec. 29, 20… [cited by applicant]
Network Heresy, “NVGRE, VXLAN and What Microsoft is Doing Right,” Network Virtualization, Open vSwitch, Oct. 3, 2011, 5 pages. [cited by applicant]
Norwegian National Security Authority, “N-03 Security Guidance for Switches and Routers,” Guidance on Network Security to Comply with the NSM Information Security Directive, Sep. 26, 2012, 24 Pages. [cited by applicant]
Regulatory & Market Environment, “Quality of Service Regulation Manual,” ITU, 2017, pp. 1-176. [cited by applicant]
Savvides A., et al., “Dynamic Fine-Grained Localization in Ad-Hoc Networks of Sensors,” Proceeding MobiCom '01 Proceedings of the 7th Annual International Conference on Mobile Computing and Networking, Jul. 2001, pp. 16… [cited by applicant]
Shwetha D., et al., “A Bandwidth Request Mechanism for QoS Enhancement in Mobile WiMAX Networks,” International Journal of Advanced Research in Electrical Electronics and Instrumentation Engineering, Jan. 2014, vol. 3, … [cited by applicant]
Sun, et al., “The Future of Wi-Fi,” IEEE Communications Magazine, Nov. 21, 2014, vol. 52, No. 11, 166 Pages. [cited by applicant]
Ventre P.L., et al., “Performance Evaluation and Tuning of Virtual Infrastructure Managers for (Micro) Virtual Network Functions,” IEEE, Nov. 7-10, 2016, 7 Pages. [cited by applicant]
Wright J., “Detecting Wireless LAN MAC Address Spoofing,” Jan. 21, 2003, pp. 1-20. [cited by applicant]
Zickau S., et al., “Enabling Location-based Policies in a Healthcare Cloud Computing Environment,” 2014 IEEE 3rd International Conference on Cloud Networking (Cloudnet), Oct. 2014, pp. 353-358. [cited by applicant]
Cited By (1)
US 12,677,193