WO2012064175A1 - Procédé d'optimisation de la gestion de trajet dans un environnement de machine virtuelle - Google Patents

Procédé d'optimisation de la gestion de trajet dans un environnement de machine virtuelle Download PDF

Info

Publication number
WO2012064175A1
WO2012064175A1 PCT/MY2011/000107 MY2011000107W WO2012064175A1 WO 2012064175 A1 WO2012064175 A1 WO 2012064175A1 MY 2011000107 W MY2011000107 W MY 2011000107W WO 2012064175 A1 WO2012064175 A1 WO 2012064175A1
Authority
WO
WIPO (PCT)
Prior art keywords
path
packet
mtu
size
profiling
Prior art date
Application number
PCT/MY2011/000107
Other languages
English (en)
Inventor
Setapa Sharipah
Anuar Mat Isa Mohd
Shamsuddin Solahuddin
Abd Aziz Norazah
Abdul Kadir Azimah
Original Assignee
Mimos Berhad
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Mimos Berhad filed Critical Mimos Berhad
Publication of WO2012064175A1 publication Critical patent/WO2012064175A1/fr

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/50—Routing or path finding of packets in data switching networks using label swapping, e.g. multi-protocol label switch [MPLS]
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/12—Shortest path evaluation
    • H04L45/124—Shortest path evaluation using a combination of metrics
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/58—Association of routers
    • H04L45/586—Association of routers of virtual routers

Definitions

  • the present invention relates to a method to optimize path management in virtual machine environment.
  • Virtual machines are machine readable instructions that can be implemented in machines that execute instructions like physical machines. Virtual machines have been used to reduce physical hardware deployment that inspired significant number of processes switching to virtual machines.
  • Path maximum transmission unit relates to communication between two hosts on internet wherein, the important parameter is that smallest maximum transmission unit (MTU) of any data link that has packets traverses between any two hosts. This is called a path MTU and the said path depends on route which is being used at anytime.
  • Virtual machines have been used to reduce physical hardware deployment, which inspired significant number of processes switching to virtual machines.
  • virtual machines may require several packet sizes and constructing variety of packet sizes or variable packet sizes incurs high costs.
  • Another disadvantage is low speed, which may lead to reduction in performance of transmission of packet.
  • packet In order to transfer data, packet needs to go through different MTUs. However, size of the MTU is limited. Therefore, development of packet varies for each packet transaction, which will delay performance and may cause high power consumption.
  • the approach as proposed in the present invention utilizes virtual router that resizes packet based on size that was predetermined by smart path profiling in global/secondary buffer.
  • the proposed approach is capable of handling variable packet size for all MTU paths based on smart path profiling by selecting multiple path from source to destination, prioritizing multiple paths based on round trip time (RTT), MTU size and number of hops and profiling path.
  • RTT round trip time
  • 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, comprising steps of determining route between source and destination which is a path (101); selecting maximum transmission unit (MTU) path having smallest size for path between source and destination (102); creating route based on round trip time, size of MTU together with number of hops that form smart path profiling (103); 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.
  • maximum transmission unit (MTU) path will have smallest size (105) and if not by repeating steps of creating further route based on round trip time, size of MTU, and number of hops that form smart path profiling (106) by restarting the path (101).
  • the method is provided with an alternate path based on smart path profiling if the selected path is busy.
  • Another aspect is a method wherein smart path profiling is embedded in global buffer and extended to secondary buffer.
  • Another aspect of the invention is to provide a method, wherein virtual router pushes the said packet having the smallest MTU size to smart path by acquiring information from global buffer or secondary buffer,
  • a further aspect of the invention is to provide a method having to transmit the said packets simultaneously from multiple guest operating system (OS) with different maximum segment size, the said packet includes transmission control protocol (TCP) and user datagram protocol (UDP) packet and pushing source routing in Internet Protocol (IP) header to destination by said source routing option in IP header.
  • TCP transmission control protocol
  • UDP user datagram protocol
  • the method of transmission of data is supported by transmission control protocol (TCP) and user datagram protocol (UDP) protocols.
  • TCP transmission control protocol
  • UDP user datagram protocol
  • the present invention consists of features and a combination of parts hereinafter fully described and illustrated in the accompanying drawings, it being understood that various changes in the details may be made without departing from the scope of the invention or sacrificing any of the advantages of the present invention.
  • the subject matter claimed herein is not limited to embodiments that solve any disadvantages or that operate only in environments such as those described above. Rather, this background is only provided to illustrate one exemplary technology area where some embodiments described herein may be practice.
  • FIG. 1 illustrates architecture to intercept and push packet to at least equal or lower to smallest of MTU sizes in optimal route.
  • FIG. 2 illustrates process to determine route and create smart path profiling.
  • FIG. 3 is a flowchart illustrating parameter needed for path profiling.
  • FIG. 4 is a flowchart illustrating packet from Virtual Machine filtering though virtual router.
  • FIG. 5 is a flowchart illustrating interception of request.
  • the invention relates to virtual machine that sends packet to virtual router to intercept packet that will standardize size of packet.
  • Router enabled Multi Protocol Label Switching MPLS
  • IP Internet Protocol
  • TCP Transmission Control Protocol
  • UDP User Datagram Protocol
  • Fragmentation happens when IP datagram has to travel through network with maximum transmission unit (MTU) that is smaller than size of the IP datagram. For example, if IP datagram that is bigger than 1500 bytes is sent to an Ethernet network, datagram will need to be fragmented. Packets are then assembled at the receiving host. Fragmentation can be either at the originating sending host or at an intermediate router.
  • MTU maximum transmission unit
  • IP fragmentation packets are not reassembled until they reach final destination. They are re-assembled at IP layer at receiving end. This makes fragmentation and reassembly transparent to protocol layers, such as, TCP and UDP. If one of the packets is lost, the group of packets need to be transmitted again.
  • protocol layers such as, TCP and UDP.
  • Packets are reassembled at receiving host by associating each fragment with an identical fragment identification number, or frag id for sort.
  • the frag ID is a copy of ID field in IP header.
  • Each fragment must carry its "position" or “offset” in original unfragmented packet. Thus, first fragment will have an offset of 0, since it is at the front row and counting starts from 0.
  • Each fragment must also tell the length of data that it carries. This is like the compartments in a train. Finally, each fragment must flat the more fragments (MF) bit if it is not the last fragment.
  • the present invention solves this problem by creating smart path profile based on preliminary route that enables transmission of fragments to continue even though MTU size and/or path size varies.
  • FIG. 1 illustrates architecture to intercept and push a packet to at least an equal or lower to smallest of MTU sizes in optimal route.
  • the architecture has a plurality of virtual machines (VMO, VM1), each having an application and operating system (OS).
  • VMO and VM1 on guest operating systems (OS) will have TAPO and TAP1 interfaces, respectively, which are used to communicate with bridge implement network devices that are supported entirely in software.
  • This design is different from ordinary network devices that are backed up by hardware network adapters.
  • Packets are sent by an operating system via a TUN/TAP device and are delivered to user-space program that attaches itself to the device.
  • a user-space program may also pass packets into a TUN/TAP device. In this case, TUN/TAP device delivers (or "injects") these packets to operating system network stack thus emulating their reception from an external source.
  • a smart path is obtained by the following steps:
  • a Virtual router provides for the following:
  • Smart path is store in global database and forwarded to a secondary database.
  • Virtual router will read the smart path in database.
  • MPLS traffic engineering Internet Protocol (IP) explicit address exclusion feature provides means to exclude a link or node from path for MPLS traffic engineering label-switched path (LSP).
  • IP Internet Protocol
  • the exclusion feature is accessible via IP explicit-path command that allows creating IP explicit path and enters configuration sub mode for specifying path.
  • the feature adds to sub mode commands the exclude-address command for specifying addresses to exclude from path. If the exclude-address for MPLS traffic engineering LSP identifies a flooded link, the constraint-based shortest path first (CSPF) routing algorithm doesn't consider that link when computing paths for the LSP. If exclude-address specifies a flooded MPLS traffic engineering router ID, the CSPF routing algorithm doesn't allow paths for LSP to traverse the node identified by router ID.
  • CSPF constraint-based shortest path first
  • FIG. 2 illustrates process to determine route and create profiling of present invention.
  • route on source and destination (202) is determined in order to get MTU size on each route/path (204). Thereafter, smallest MTU size of any data link that packet traverse between the said two hosts is selected (206) and create profiling for entire route (208). The said route is repeated if smallest size cannot be achieved (210) and the said process repeats (212). Else, entire process starts from beginning. All profiling will be stored in database.
  • FIG. 3 is a flowchart showing profiling (302) that includes parameter round trip time (304), which is time required for packet to travel from specific source to specific destination and back again.
  • the other parameter that is number of hops (306) related to maximum number of hops in hypercube network from one node to another.
  • the last parameter is path MTU (308) size that is equal to minimum MTUs of each hop in the said path. All values will be put as path profiling (310).
  • the process proceeds to path profiling (312) if all parameter value is successful, else process proceeds with profiling.
  • FIG. 4 illustrates process wherein packet from virtual machine is filtered through virtual router before pushing to destination.
  • Virtual Machine will simultaneously send packet (402) to virtual router (404) which will process packet based on smart path/plan (406). Upon processing of the said packet, the said packet will be closed (408) to continue with other request (410).
  • An aspect of the present invention is handling variable packet sizes for all MTU paths based on smart path profiling by selecting multiple paths from the source to the destination; prioritizing the multiple paths based on round trip time (RTT), size of the MTU, and number of hops; and path profiling.
  • RTT round trip time

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

La présente invention porte sur un procédé d'optimisation de la gestion de trajet dans un environnement de machine virtuelle possédant une machine virtuelle source, une machine virtuelle de destination, un routeur virtuel et un routeur de type MPLS, le procédé comprenant : la détermination d'un chemin entre la source et la destination qui est un trajet, la sélection d'un trajet d'unité de transmission maximale (MTU) possédant la taille la plus petite de chemin entre la source et la destination, la création d'un chemin en fonction d'une durée d'aller-retour (RTT), de la taille de la MTU et du nombre de sauts qui forment le profilage de trajet intelligent, la construction d'au moins un paquet provenant d'un environnement de machine virtuelle et l'envoi du au moins un paquet au travers du profilage de trajet intelligent, et l'identification d'un trajet en fonction d'un profilage de trajet intelligent par un routeur virtuel et l'envoi du au moins un paquet vers un routeur de type MPLS, où, si le trajet de la MTU possédant la plus petite taille ne peut pas être obtenu, la répétition des opérations de création de chemin en fonction de la RTT, de la taille de la MTU et du nombre de sauts, si la taille la plus petite ne peut pas être obtenue, le redémarrage du trajet.
PCT/MY2011/000107 2010-11-09 2011-06-17 Procédé d'optimisation de la gestion de trajet dans un environnement de machine virtuelle WO2012064175A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
MYPI2010005249 MY149439A (en) 2010-11-09 2010-11-09 A method to optimize path management in virtual machine environtment
MYPI2010005249 2010-11-09

Publications (1)

Publication Number Publication Date
WO2012064175A1 true WO2012064175A1 (fr) 2012-05-18

Family

ID=46051151

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/MY2011/000107 WO2012064175A1 (fr) 2010-11-09 2011-06-17 Procédé d'optimisation de la gestion de trajet dans un environnement de machine virtuelle

Country Status (2)

Country Link
MY (1) MY149439A (fr)
WO (1) WO2012064175A1 (fr)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP3024185A1 (fr) * 2014-11-18 2016-05-25 Fujitsu Limited Programme de fourniture d'informations d'itinéraire, procédé de fourniture d'informations d'itinéraire et système de traitement d'informations

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20040071140A1 (en) * 2002-10-10 2004-04-15 James Jason Determining network path transmission unit
US20050005024A1 (en) * 2002-10-30 2005-01-06 Allen Samuels Method of determining path maximum transmission unit
US20100107162A1 (en) * 2008-03-07 2010-04-29 Aled Edwards Routing across a virtual network
US20100183009A1 (en) * 2009-01-19 2010-07-22 International Business Machines Corporation Discriminatory mtu fragmentation in a logical partition

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20040071140A1 (en) * 2002-10-10 2004-04-15 James Jason Determining network path transmission unit
US20050005024A1 (en) * 2002-10-30 2005-01-06 Allen Samuels Method of determining path maximum transmission unit
US20100107162A1 (en) * 2008-03-07 2010-04-29 Aled Edwards Routing across a virtual network
US20100183009A1 (en) * 2009-01-19 2010-07-22 International Business Machines Corporation Discriminatory mtu fragmentation in a logical partition

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP3024185A1 (fr) * 2014-11-18 2016-05-25 Fujitsu Limited Programme de fourniture d'informations d'itinéraire, procédé de fourniture d'informations d'itinéraire et système de traitement d'informations

Also Published As

Publication number Publication date
MY149439A (en) 2013-08-30

Similar Documents

Publication Publication Date Title
JP6500304B2 (ja) Ｓｄｎスイッチにより正確なフロー・エントリを獲得するための方法、およびｓｄｎスイッチ、コントローラ、およびシステム
US9871781B2 (en) Systems and methods for path maximum transmission unit discovery
CN101573927B (zh) 网络系统中的路径最大传输单元发现
US7065086B2 (en) Method and system for efficient layer 3-layer 7 routing of internet protocol (“IP”) fragments
US7852774B2 (en) User datagram protocol traceroute probe extension
US9608938B2 (en) Method and system for tracking and managing network flows
US7948921B1 (en) Automatic network optimization
US7630368B2 (en) Virtual network interface card loopback fastpath
US8576847B2 (en) Mechanisms for discovering path maximum transmission unit
US9185033B2 (en) Communication path selection
US20080159150A1 (en) Method and Apparatus for Preventing IP Datagram Fragmentation and Reassembly
JPH11112574A (ja) 異種ネットワークでデータ・パケットを生成する方法およびシステム
EP3574617B1 (fr) Procédé et appareil de gestion d'interruptions de routage dans un réseau informatique
JP2003308262A (ja) ハードウェアプロトコルプロセシングロジックで実現されたインタネット通信プロトコル装置、及びその装置を用いたデータ並列処理方法
Voruganti et al. An analysis of three gigabit networking protocols for storage area networks
US10164870B2 (en) Relaxed ordering network
WO2015114473A1 (fr) Procédé et appareil d'équilibrage de charge sensible à la localisation basé sur un hachage
WO2018036254A1 (fr) Procédé et dispositif de retransmission de paquets
US7782790B1 (en) Extensions to the path verification protocol to support link bundling constructs
KR101386809B1 (ko) 다중 ｍｔｕ를 설정하는 모바일 디바이스 및 이를 이용한 데이터 전송 방법
WO2016124049A1 (fr) Procédé et appareil d'obtention de chemin de port
WO2020073907A1 (fr) Procédé et appareil de mise à jour d'entrée de transfert
WO2014022350A1 (fr) Maillage de connexion dans des systèmes multiprocesseurs asymétriques groupés d'écriture miroir
US9143448B1 (en) Methods for reassembling fragmented data units
US20170317933A1 (en) Optimized in-network retransmission for information-centric networking protocols

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 11840020

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 11840020

Country of ref document: EP

Kind code of ref document: A1