EFFICIENTLY AVOIDING PACKET LOOPS WHEN ROUTES ARE AGGREGATED IN A SOFTWARE DEFINED DATA CENTER
The disclosure provides an approach for avoiding packet loops when routes are aggregated in a data center. Embodiments include scanning logical segments associated with a customer gateway to identify network addresses associated with the logical segments. Embodiments include determining one or more...
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Patent |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | |
|---|---|
| container_issue | |
| container_start_page | |
| container_title | |
| container_volume | |
| creator | M.D., ANANTHA MOHAN RAJ DEVIREDDY, DILEEP K NATARAJAN, VIJAI COIMBATORE |
| description | The disclosure provides an approach for avoiding packet loops when routes are aggregated in a data center. Embodiments include scanning logical segments associated with a customer gateway to identify network addresses associated with the logical segments. Embodiments include determining one or more recommended supernets based on the network addresses associated with the logical segments. Embodiments include providing output to a user based on the one or more recommended supernets. Embodiments include, based on the output, receiving input from the user configuring an aggregation supernet for the customer gateway. Embodiments include advertising the aggregation supernet to one or more endpoints separate from the customer gateway. |
| format | Patent |
| fullrecord | <record><control><sourceid>epo_EVB</sourceid><recordid>TN_cdi_epo_espacenet_US2024069951A1</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>US2024069951A1</sourcerecordid><originalsourceid>FETCH-epo_espacenet_US2024069951A13</originalsourceid><addsrcrecordid>eNqNjEEKwjAQRbtxIeodBlwLbdVCl0MySYMlKcnU4sZSJK5EC_X-WMEDuPrw3uMvkyspZYQhy_UF8OyMNFZDg-JEDLVzTYCuIgvetUwB0BOg1p40MkkwFhCCU9x9hSRl7EwlMoKYL8mvk8V9eExx89tVslXEotrF8dXHaRxu8RnffRvyND-kRVkeM8z2_1Ufuv8zcQ</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>patent</recordtype></control><display><type>patent</type><title>EFFICIENTLY AVOIDING PACKET LOOPS WHEN ROUTES ARE AGGREGATED IN A SOFTWARE DEFINED DATA CENTER</title><source>esp@cenet</source><creator>M.D., ANANTHA MOHAN RAJ ; DEVIREDDY, DILEEP K ; NATARAJAN, VIJAI COIMBATORE</creator><creatorcontrib>M.D., ANANTHA MOHAN RAJ ; DEVIREDDY, DILEEP K ; NATARAJAN, VIJAI COIMBATORE</creatorcontrib><description>The disclosure provides an approach for avoiding packet loops when routes are aggregated in a data center. Embodiments include scanning logical segments associated with a customer gateway to identify network addresses associated with the logical segments. Embodiments include determining one or more recommended supernets based on the network addresses associated with the logical segments. Embodiments include providing output to a user based on the one or more recommended supernets. Embodiments include, based on the output, receiving input from the user configuring an aggregation supernet for the customer gateway. Embodiments include advertising the aggregation supernet to one or more endpoints separate from the customer gateway.</description><language>eng</language><subject>CALCULATING ; COMPUTING ; COUNTING ; ELECTRIC DIGITAL DATA PROCESSING ; PHYSICS</subject><creationdate>2024</creationdate><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://worldwide.espacenet.com/publicationDetails/biblio?FT=D&date=20240229&DB=EPODOC&CC=US&NR=2024069951A1$$EHTML$$P50$$Gepo$$Hfree_for_read</linktohtml><link.rule.ids>230,308,780,885,25564,76547</link.rule.ids><linktorsrc>$$Uhttps://worldwide.espacenet.com/publicationDetails/biblio?FT=D&date=20240229&DB=EPODOC&CC=US&NR=2024069951A1$$EView_record_in_European_Patent_Office$$FView_record_in_$$GEuropean_Patent_Office$$Hfree_for_read</linktorsrc></links><search><creatorcontrib>M.D., ANANTHA MOHAN RAJ</creatorcontrib><creatorcontrib>DEVIREDDY, DILEEP K</creatorcontrib><creatorcontrib>NATARAJAN, VIJAI COIMBATORE</creatorcontrib><title>EFFICIENTLY AVOIDING PACKET LOOPS WHEN ROUTES ARE AGGREGATED IN A SOFTWARE DEFINED DATA CENTER</title><description>The disclosure provides an approach for avoiding packet loops when routes are aggregated in a data center. Embodiments include scanning logical segments associated with a customer gateway to identify network addresses associated with the logical segments. Embodiments include determining one or more recommended supernets based on the network addresses associated with the logical segments. Embodiments include providing output to a user based on the one or more recommended supernets. Embodiments include, based on the output, receiving input from the user configuring an aggregation supernet for the customer gateway. Embodiments include advertising the aggregation supernet to one or more endpoints separate from the customer gateway.</description><subject>CALCULATING</subject><subject>COMPUTING</subject><subject>COUNTING</subject><subject>ELECTRIC DIGITAL DATA PROCESSING</subject><subject>PHYSICS</subject><fulltext>true</fulltext><rsrctype>patent</rsrctype><creationdate>2024</creationdate><recordtype>patent</recordtype><sourceid>EVB</sourceid><recordid>eNqNjEEKwjAQRbtxIeodBlwLbdVCl0MySYMlKcnU4sZSJK5EC_X-WMEDuPrw3uMvkyspZYQhy_UF8OyMNFZDg-JEDLVzTYCuIgvetUwB0BOg1p40MkkwFhCCU9x9hSRl7EwlMoKYL8mvk8V9eExx89tVslXEotrF8dXHaRxu8RnffRvyND-kRVkeM8z2_1Ufuv8zcQ</recordid><startdate>20240229</startdate><enddate>20240229</enddate><creator>M.D., ANANTHA MOHAN RAJ</creator><creator>DEVIREDDY, DILEEP K</creator><creator>NATARAJAN, VIJAI COIMBATORE</creator><scope>EVB</scope></search><sort><creationdate>20240229</creationdate><title>EFFICIENTLY AVOIDING PACKET LOOPS WHEN ROUTES ARE AGGREGATED IN A SOFTWARE DEFINED DATA CENTER</title><author>M.D., ANANTHA MOHAN RAJ ; DEVIREDDY, DILEEP K ; NATARAJAN, VIJAI COIMBATORE</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-epo_espacenet_US2024069951A13</frbrgroupid><rsrctype>patents</rsrctype><prefilter>patents</prefilter><language>eng</language><creationdate>2024</creationdate><topic>CALCULATING</topic><topic>COMPUTING</topic><topic>COUNTING</topic><topic>ELECTRIC DIGITAL DATA PROCESSING</topic><topic>PHYSICS</topic><toplevel>online_resources</toplevel><creatorcontrib>M.D., ANANTHA MOHAN RAJ</creatorcontrib><creatorcontrib>DEVIREDDY, DILEEP K</creatorcontrib><creatorcontrib>NATARAJAN, VIJAI COIMBATORE</creatorcontrib><collection>esp@cenet</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>M.D., ANANTHA MOHAN RAJ</au><au>DEVIREDDY, DILEEP K</au><au>NATARAJAN, VIJAI COIMBATORE</au><format>patent</format><genre>patent</genre><ristype>GEN</ristype><title>EFFICIENTLY AVOIDING PACKET LOOPS WHEN ROUTES ARE AGGREGATED IN A SOFTWARE DEFINED DATA CENTER</title><date>2024-02-29</date><risdate>2024</risdate><abstract>The disclosure provides an approach for avoiding packet loops when routes are aggregated in a data center. Embodiments include scanning logical segments associated with a customer gateway to identify network addresses associated with the logical segments. Embodiments include determining one or more recommended supernets based on the network addresses associated with the logical segments. Embodiments include providing output to a user based on the one or more recommended supernets. Embodiments include, based on the output, receiving input from the user configuring an aggregation supernet for the customer gateway. Embodiments include advertising the aggregation supernet to one or more endpoints separate from the customer gateway.</abstract><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | |
| ispartof | |
| issn | |
| language | eng |
| recordid | cdi_epo_espacenet_US2024069951A1 |
| source | esp@cenet |
| subjects | CALCULATING COMPUTING COUNTING ELECTRIC DIGITAL DATA PROCESSING PHYSICS |
| title | EFFICIENTLY AVOIDING PACKET LOOPS WHEN ROUTES ARE AGGREGATED IN A SOFTWARE DEFINED DATA CENTER |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-05T22%3A58%3A48IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-epo_EVB&rft_val_fmt=info:ofi/fmt:kev:mtx:patent&rft.genre=patent&rft.au=M.D.,%20ANANTHA%20MOHAN%20RAJ&rft.date=2024-02-29&rft_id=info:doi/&rft_dat=%3Cepo_EVB%3EUS2024069951A1%3C/epo_EVB%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |