A METHOD TO OPTIMIZE PATH MANAGEMENT IN VIRTUAL MACHINE ENVIRONTMENT
ONE EMBODIMENT OF THE PRESENT INVENTION IS A METHOD TO OPTIMIZE PATH MANAGEMENT IN VIRTUAL MACHINE ENVIRONMENT HAVING SOURCE VIRTUAL MACHINE, DESTINATION VIRTUAL MACHINE, VIRTUAL ROUTER, AND MULTI PROTOCOL LABEL SWITCHING (MPLS) ENABLED ROUTER, INCLUDING STEPS OF DETERMINING ROUTE BETWEEN A SOURCE A...
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 | SHARIPAH SETAPA NORAZAH ABD AZIZ MOHD ANUAR MAT ISA AZIMAH ABDUL KADIR SOLAHUDDIN SHAMSUDDIN |
description | ONE EMBODIMENT OF THE PRESENT INVENTION IS A METHOD TO OPTIMIZE PATH MANAGEMENT IN VIRTUAL MACHINE ENVIRONMENT HAVING SOURCE VIRTUAL MACHINE, DESTINATION VIRTUAL MACHINE, VIRTUAL ROUTER, AND MULTI PROTOCOL LABEL SWITCHING (MPLS) ENABLED ROUTER, INCLUDING STEPS OF DETERMINING ROUTE BETWEEN A SOURCE AND DESTINATION WHICH IS A PATH (202); SELECTING MAXIMUM TRANSMISSION UNIT (MTU) PATH HAVING SMALLEST SIZE FOR PATH BETWEEN SOURCE AND DESTINATION (204); CREATING ROUTE BASED ON ROUND TRIP TIME (RTT), SIZE OF MTU, AND NUMBER OF HOPS THAT FORM SMART PATH PROFILING (206); CONSTRUCTING AT LEAST ONE PACKET FROM VIRTUAL MACHINE ENVIRONMENT AND PUSHING THE SAID PACKET THROUGH SMART PATH PROFILING; AND IDENTIFYING PATH BASED ON SMART PATH PROFILING BY VIRTUAL ROUTER AND PUSHING THE SAID PACKET TO MPLS ENABLED ROUTER, WHEREIN IF MAXIMUM TRANSMISSION UNIT (MTU) PATH HAVING SMALLEST SIZE CANNOT BE ACHIEVED (210), REPEATING STEPS OF CREATING ROUTE BASED ON ROUND TRIP TIME (RTT), SIZE OF MTU, AND NUMBER OF HOPS THAT FORM SMART PATH PROFILING (212), IF THE SMALLEST SIZE CANNOT BE ACHIEVED,RESTARTING THE PATH (202). |
format | Patent |
fullrecord | <record><control><sourceid>epo_EVB</sourceid><recordid>TN_cdi_epo_espacenet_MY149439A</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>MY149439A</sourcerecordid><originalsourceid>FETCH-epo_espacenet_MY149439A3</originalsourceid><addsrcrecordid>eNrjZHBxVPB1DfHwd1EI8VfwDwjx9PWMclUIcAzxUPB19HN0d_V19QtR8PRTCPMMCgl19AGKOnt4-rkquPoBRfz9QkDyPAysaYk5xam8UJqbQc7NNcTZQze1ID8-tbggMTk1L7Uk3jfS0MTSxNjS0ZigAgBZgSrH</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>patent</recordtype></control><display><type>patent</type><title>A METHOD TO OPTIMIZE PATH MANAGEMENT IN VIRTUAL MACHINE ENVIRONTMENT</title><source>esp@cenet</source><creator>SHARIPAH SETAPA ; NORAZAH ABD AZIZ ; MOHD ANUAR MAT ISA ; AZIMAH ABDUL KADIR ; SOLAHUDDIN SHAMSUDDIN</creator><creatorcontrib>SHARIPAH SETAPA ; NORAZAH ABD AZIZ ; MOHD ANUAR MAT ISA ; AZIMAH ABDUL KADIR ; SOLAHUDDIN SHAMSUDDIN</creatorcontrib><description>ONE EMBODIMENT OF THE PRESENT INVENTION IS A METHOD TO OPTIMIZE PATH MANAGEMENT IN VIRTUAL MACHINE ENVIRONMENT HAVING SOURCE VIRTUAL MACHINE, DESTINATION VIRTUAL MACHINE, VIRTUAL ROUTER, AND MULTI PROTOCOL LABEL SWITCHING (MPLS) ENABLED ROUTER, INCLUDING STEPS OF DETERMINING ROUTE BETWEEN A SOURCE AND DESTINATION WHICH IS A PATH (202); SELECTING MAXIMUM TRANSMISSION UNIT (MTU) PATH HAVING SMALLEST SIZE FOR PATH BETWEEN SOURCE AND DESTINATION (204); CREATING ROUTE BASED ON ROUND TRIP TIME (RTT), SIZE OF MTU, AND NUMBER OF HOPS THAT FORM SMART PATH PROFILING (206); CONSTRUCTING AT LEAST ONE PACKET FROM VIRTUAL MACHINE ENVIRONMENT AND PUSHING THE SAID PACKET THROUGH SMART PATH PROFILING; AND IDENTIFYING PATH BASED ON SMART PATH PROFILING BY VIRTUAL ROUTER AND PUSHING THE SAID PACKET TO MPLS ENABLED ROUTER, WHEREIN IF MAXIMUM TRANSMISSION UNIT (MTU) PATH HAVING SMALLEST SIZE CANNOT BE ACHIEVED (210), REPEATING STEPS OF CREATING ROUTE BASED ON ROUND TRIP TIME (RTT), SIZE OF MTU, AND NUMBER OF HOPS THAT FORM SMART PATH PROFILING (212), IF THE SMALLEST SIZE CANNOT BE ACHIEVED,RESTARTING THE PATH (202).</description><language>eng</language><subject>ELECTRIC COMMUNICATION TECHNIQUE ; ELECTRICITY ; TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHICCOMMUNICATION</subject><creationdate>2013</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=20130830&DB=EPODOC&CC=MY&NR=149439A$$EHTML$$P50$$Gepo$$Hfree_for_read</linktohtml><link.rule.ids>230,308,776,881,25542,76290</link.rule.ids><linktorsrc>$$Uhttps://worldwide.espacenet.com/publicationDetails/biblio?FT=D&date=20130830&DB=EPODOC&CC=MY&NR=149439A$$EView_record_in_European_Patent_Office$$FView_record_in_$$GEuropean_Patent_Office$$Hfree_for_read</linktorsrc></links><search><creatorcontrib>SHARIPAH SETAPA</creatorcontrib><creatorcontrib>NORAZAH ABD AZIZ</creatorcontrib><creatorcontrib>MOHD ANUAR MAT ISA</creatorcontrib><creatorcontrib>AZIMAH ABDUL KADIR</creatorcontrib><creatorcontrib>SOLAHUDDIN SHAMSUDDIN</creatorcontrib><title>A METHOD TO OPTIMIZE PATH MANAGEMENT IN VIRTUAL MACHINE ENVIRONTMENT</title><description>ONE EMBODIMENT OF THE PRESENT INVENTION IS A METHOD TO OPTIMIZE PATH MANAGEMENT IN VIRTUAL MACHINE ENVIRONMENT HAVING SOURCE VIRTUAL MACHINE, DESTINATION VIRTUAL MACHINE, VIRTUAL ROUTER, AND MULTI PROTOCOL LABEL SWITCHING (MPLS) ENABLED ROUTER, INCLUDING STEPS OF DETERMINING ROUTE BETWEEN A SOURCE AND DESTINATION WHICH IS A PATH (202); SELECTING MAXIMUM TRANSMISSION UNIT (MTU) PATH HAVING SMALLEST SIZE FOR PATH BETWEEN SOURCE AND DESTINATION (204); CREATING ROUTE BASED ON ROUND TRIP TIME (RTT), SIZE OF MTU, AND NUMBER OF HOPS THAT FORM SMART PATH PROFILING (206); CONSTRUCTING AT LEAST ONE PACKET FROM VIRTUAL MACHINE ENVIRONMENT AND PUSHING THE SAID PACKET THROUGH SMART PATH PROFILING; AND IDENTIFYING PATH BASED ON SMART PATH PROFILING BY VIRTUAL ROUTER AND PUSHING THE SAID PACKET TO MPLS ENABLED ROUTER, WHEREIN IF MAXIMUM TRANSMISSION UNIT (MTU) PATH HAVING SMALLEST SIZE CANNOT BE ACHIEVED (210), REPEATING STEPS OF CREATING ROUTE BASED ON ROUND TRIP TIME (RTT), SIZE OF MTU, AND NUMBER OF HOPS THAT FORM SMART PATH PROFILING (212), IF THE SMALLEST SIZE CANNOT BE ACHIEVED,RESTARTING THE PATH (202).</description><subject>ELECTRIC COMMUNICATION TECHNIQUE</subject><subject>ELECTRICITY</subject><subject>TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHICCOMMUNICATION</subject><fulltext>true</fulltext><rsrctype>patent</rsrctype><creationdate>2013</creationdate><recordtype>patent</recordtype><sourceid>EVB</sourceid><recordid>eNrjZHBxVPB1DfHwd1EI8VfwDwjx9PWMclUIcAzxUPB19HN0d_V19QtR8PRTCPMMCgl19AGKOnt4-rkquPoBRfz9QkDyPAysaYk5xam8UJqbQc7NNcTZQze1ID8-tbggMTk1L7Uk3jfS0MTSxNjS0ZigAgBZgSrH</recordid><startdate>20130830</startdate><enddate>20130830</enddate><creator>SHARIPAH SETAPA</creator><creator>NORAZAH ABD AZIZ</creator><creator>MOHD ANUAR MAT ISA</creator><creator>AZIMAH ABDUL KADIR</creator><creator>SOLAHUDDIN SHAMSUDDIN</creator><scope>EVB</scope></search><sort><creationdate>20130830</creationdate><title>A METHOD TO OPTIMIZE PATH MANAGEMENT IN VIRTUAL MACHINE ENVIRONTMENT</title><author>SHARIPAH SETAPA ; NORAZAH ABD AZIZ ; MOHD ANUAR MAT ISA ; AZIMAH ABDUL KADIR ; SOLAHUDDIN SHAMSUDDIN</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-epo_espacenet_MY149439A3</frbrgroupid><rsrctype>patents</rsrctype><prefilter>patents</prefilter><language>eng</language><creationdate>2013</creationdate><topic>ELECTRIC COMMUNICATION TECHNIQUE</topic><topic>ELECTRICITY</topic><topic>TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHICCOMMUNICATION</topic><toplevel>online_resources</toplevel><creatorcontrib>SHARIPAH SETAPA</creatorcontrib><creatorcontrib>NORAZAH ABD AZIZ</creatorcontrib><creatorcontrib>MOHD ANUAR MAT ISA</creatorcontrib><creatorcontrib>AZIMAH ABDUL KADIR</creatorcontrib><creatorcontrib>SOLAHUDDIN SHAMSUDDIN</creatorcontrib><collection>esp@cenet</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>SHARIPAH SETAPA</au><au>NORAZAH ABD AZIZ</au><au>MOHD ANUAR MAT ISA</au><au>AZIMAH ABDUL KADIR</au><au>SOLAHUDDIN SHAMSUDDIN</au><format>patent</format><genre>patent</genre><ristype>GEN</ristype><title>A METHOD TO OPTIMIZE PATH MANAGEMENT IN VIRTUAL MACHINE ENVIRONTMENT</title><date>2013-08-30</date><risdate>2013</risdate><abstract>ONE EMBODIMENT OF THE PRESENT INVENTION IS A METHOD TO OPTIMIZE PATH MANAGEMENT IN VIRTUAL MACHINE ENVIRONMENT HAVING SOURCE VIRTUAL MACHINE, DESTINATION VIRTUAL MACHINE, VIRTUAL ROUTER, AND MULTI PROTOCOL LABEL SWITCHING (MPLS) ENABLED ROUTER, INCLUDING STEPS OF DETERMINING ROUTE BETWEEN A SOURCE AND DESTINATION WHICH IS A PATH (202); SELECTING MAXIMUM TRANSMISSION UNIT (MTU) PATH HAVING SMALLEST SIZE FOR PATH BETWEEN SOURCE AND DESTINATION (204); CREATING ROUTE BASED ON ROUND TRIP TIME (RTT), SIZE OF MTU, AND NUMBER OF HOPS THAT FORM SMART PATH PROFILING (206); CONSTRUCTING AT LEAST ONE PACKET FROM VIRTUAL MACHINE ENVIRONMENT AND PUSHING THE SAID PACKET THROUGH SMART PATH PROFILING; AND IDENTIFYING PATH BASED ON SMART PATH PROFILING BY VIRTUAL ROUTER AND PUSHING THE SAID PACKET TO MPLS ENABLED ROUTER, WHEREIN IF MAXIMUM TRANSMISSION UNIT (MTU) PATH HAVING SMALLEST SIZE CANNOT BE ACHIEVED (210), REPEATING STEPS OF CREATING ROUTE BASED ON ROUND TRIP TIME (RTT), SIZE OF MTU, AND NUMBER OF HOPS THAT FORM SMART PATH PROFILING (212), IF THE SMALLEST SIZE CANNOT BE ACHIEVED,RESTARTING THE PATH (202).</abstract><oa>free_for_read</oa></addata></record> |
fulltext | fulltext_linktorsrc |
identifier | |
ispartof | |
issn | |
language | eng |
recordid | cdi_epo_espacenet_MY149439A |
source | esp@cenet |
subjects | ELECTRIC COMMUNICATION TECHNIQUE ELECTRICITY TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHICCOMMUNICATION |
title | A METHOD TO OPTIMIZE PATH MANAGEMENT IN VIRTUAL MACHINE ENVIRONTMENT |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-30T23%3A58%3A59IST&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=SHARIPAH%20SETAPA&rft.date=2013-08-30&rft_id=info:doi/&rft_dat=%3Cepo_EVB%3EMY149439A%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 |