EP1491005A1 - Procede de modification d'une pmtu dans un reseau ip dynamique et appareil utilisant ce procede - Google Patents

Procede de modification d'une pmtu dans un reseau ip dynamique et appareil utilisant ce procede

Info

Publication number
EP1491005A1
EP1491005A1 EP03745469A EP03745469A EP1491005A1 EP 1491005 A1 EP1491005 A1 EP 1491005A1 EP 03745469 A EP03745469 A EP 03745469A EP 03745469 A EP03745469 A EP 03745469A EP 1491005 A1 EP1491005 A1 EP 1491005A1
Authority
EP
European Patent Office
Prior art keywords
packet
mtu
node
pmtu
information
Prior art date
Legal status (The legal status 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 status listed.)
Withdrawn
Application number
EP03745469A
Other languages
German (de)
English (en)
Other versions
EP1491005A4 (fr
Inventor
Hak-Goo Lee
Young-Keun 528-103 Daedong Apt. KIM
Sun-Woo 331-1602 Gwonseon 3-jigu KIM
Jae-Hwang Samsung Electronics Co. Ltd. LEE
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Samsung Electronics Co Ltd
Original Assignee
Samsung Electronics Co Ltd
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
Priority claimed from KR10-2002-0034132A external-priority patent/KR100453056B1/ko
Application filed by Samsung Electronics Co Ltd filed Critical Samsung Electronics Co Ltd
Publication of EP1491005A1 publication Critical patent/EP1491005A1/fr
Publication of EP1491005A4 publication Critical patent/EP1491005A4/fr
Withdrawn legal-status Critical Current

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L69/00—Network arrangements, protocols or services independent of the application payload and not provided for in the other groups of this subclass
    • H04L69/16—Implementation or adaptation of Internet protocol [IP], of transmission control protocol [TCP] or of user datagram protocol [UDP]
    • 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
    • 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/26—Route discovery packet
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L69/00—Network arrangements, protocols or services independent of the application payload and not provided for in the other groups of this subclass
    • H04L69/16—Implementation or adaptation of Internet protocol [IP], of transmission control protocol [TCP] or of user datagram protocol [UDP]
    • H04L69/161—Implementation details of TCP/IP or UDP/IP stack architecture; Specification of modified or new header fields
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L69/00—Network arrangements, protocols or services independent of the application payload and not provided for in the other groups of this subclass
    • H04L69/16—Implementation or adaptation of Internet protocol [IP], of transmission control protocol [TCP] or of user datagram protocol [UDP]
    • H04L69/167—Adaptation for transition between two IP versions, e.g. between IPv4 and IPv6

Definitions

  • the present invention relates to a method and apparatus for more efficiently operating a network, and more particularly, to a method and apparatus for performing discovery of a maximum transmission unit (MTU) on a path more appropriately to a dynamic network environment, and changing path MTU (PMTU) according to the discovered MTU with higher efficiency.
  • MTU maximum transmission unit
  • PMTU changing path MTU
  • IPv4 Internet Protocol version 4
  • IPv6 Internet Protocol version 6
  • IPv6 Internet Protocol version 6
  • IPv6 unlike in IPv4, if a packet is once transmitted by a source node, a node in the middle of a path does not perform fragmentation of the packet. Instead, the source node searches for a minimum MTU on a path, fragments packets according to the discovered MTU, and transmits the fragmented packets.
  • FIG. 1 is a diagram showing a process for changing a PMTU by applying a prior art method for PMTU discovery when a routing path between a source node 110 and a destination node 170 changes from a path connecting a first node 120, a second 130, a third node 140, and the destination node 170, to a path connecting the first node 120, a fourth node 150, a fifth node 160, and the destination node 170 in a dynamic network environment.
  • a PMTU may change if there is a change of a routing path according to the dynamic network environment. Therefore, when a PMTU is maintained for a predetermined time, the prior art PMTU discovery method described above is used to discover the PMTU of the current routing path, and according to the discovered result, the PMTU is increased.
  • an ICMP error message of IPv6 that is, an error message such as an ICMP-Packet Too Big message, is unnecessarily generated such that network resources are wasted. Referring to FIG. 1 , a method for discovering and changing a
  • the present invention provides a method and apparatus for more efficiently discovering a PMTU of a current routing path in a dynamic network environment and changing a PMTU according to the discovered PMTU.
  • a method for changing a path maximum transmission unit (PMTU) between a source node and a destination node on a dynamic Internet protocol (IP) network comprising: (a) generating a PMTU discovery packet having a maximum transmission unit (MTU) information storage space in which an MTU value on a routing path between the source node and the destination node is stored; (b) transmitting the generated PMTU discovery packet to the destination node; and (c) if a response packet to the PMTU discovery packet from the destination node is received, changing the PMTU according to MTU information contained in the response packet, wherein the MTU value stored in the MTU information storage space is compared with a link MTU value on a path which the PMTU discovery packet traverses, and the smaller one of the stored MTU value and the link MTU value on the path which the packet traverses is stored in the MTU information storage space. It is preferable that the PMTU discovery packet which is generated in step (a) is generated if
  • step (a) a next-hop link MTU value of the source node is stored in the MTU information storage space.
  • step (c) comprises step (d ) in which if the
  • PMTU discovery packet arrives at the destination node, a packet containing the MTU value stored in the MTU information storage space of the PMTU discovery packet is generated, and the packet is transmitted to the source node.
  • an apparatus for changing a path maximum transmission unit (PMTU) between a source node and a destination node on a dynamic IP network comprising: a PMTU discovery packet generation unit which generates a PMTU discovery packet having an MTU information storage space in which a maximum transmission unit (MTU) value on a routing path between the source node and the destination node is stored; a transmission unit which transmits the generated PMTU discovery packet to the destination node; and a PMTU changing unit which, if a response packet to the PMTU discovery packet from the destination node is received, changes the PMTU according to MTU information contained in the response packet, wherein the MTU value stored in the MTU information storage space is compared with a link MTU in a path which the PMTU discovery packet traverses, and the smaller one of the stored MTU value and the link MTU value in the traverse path is stored in the MTU information storage space.
  • PMTU discovery packet generation unit which generates a PMTU discovery packet having an MTU information storage space in which a maximum transmission unit (MTU
  • the PMTU discovery packet is generated if the current PMTU value is maintained for a predetermined time.
  • the size of the PMTU discovery packet is equal to or less than the size of the current PMTU.
  • an option type field of the hop-by-hop option header of the PMTU discovery packet stores information indicating that if a node in the middle of a routing path does not recognize the option type field of the PMTU discovery packet, the PMTU discovery packet should be discarded.
  • the option type field stores information indicating whether or not it is possible to change MTU information stored in the MTU information storage space. It is preferable that the information indicating whether or not it is possible to change MTU information is located in the third highest bit stored in the option type field.
  • FIG. 2 is a diagram of a basic header of Internet Protocol version 6 (IPv6) used in the present invention
  • FIG. 3 is a diagram of a basic structure of an Internet Control
  • FIG. 4A is a diagram showing a basic structure of a hop-by-hop option header used in the present invention.
  • FIG. 4B is a diagram of the structure of an Options" field in the hop-by-hop option header shown in FIG. 4A
  • FIG. 5A is a diagram of the structure of an "Options" field in a hop-by-hop option header constructed according to a preferred embodiment of the present invention
  • FIG. 5B is a diagram of the structure of an "Options" field in a hop-by-hop option header constructed according to another preferred embodiment of the present invention.
  • FIG. 9A is a diagram showing a basic structure of an ICMPv6 message used in the present invention.
  • FIG. 9B is a diagram showing a basic structure of an ICMP- Packet Too Big message used in the present invention.
  • FIG. 10A is a diagram showing a modified ICMP-Packet Too Big message used in a PMTU discovery method according to the present invention.
  • node a device that implements IPv6.
  • router a node that forwards IPv6 packets not explicitly addressed to itself.
  • host any node that is not a router.
  • upper layer a protocol layer immediately above IPv6.
  • transport protocols such as TCP and UDP
  • control protocols such as ICMP path maximum transmission unit discovery (PMTU) Minimizing Packet: a newly defined ICMP information message.
  • link a communication facility or medium over which nodes can communicate at the link layer.
  • packet an IPv6 header plus a payload.
  • link MTU the maximum transmission unit.
  • path the set of links traversed by a packet between a source node and a destination node path
  • MTU (PMTU): the minimum link MTU of all the links in a path between a source node and a destination node.
  • FIG. 2 is a diagram of a basic header of IPv6 used in the present invention. All packets of IPv6 begin with a basic header formed with 40 bytes. "Version” of FIG. 2 indicates the version of IP, and “Payload Length” indicates the length of an IP packet in units of bytes. "Next Header” indicates which extension header follows the basic header of IPv6, and "Hop Limit” is used to restrict in units of hops a distance for transmitting an IP packet. "Source Address” and “Destination Address” indicate the address of a host transmitting a packet and the address of a destination to which the packet is to be transmitted, respectively. The length of the each address is 128 bits.
  • option headers are shown in table 1 by considering that when apparatuses of nodes located in the middle of a routing path through which a packet is transmitted retrieve the header part of the packet being transmitted, the apparatuses retrieve from the beginning part only to the needed part of the packet.
  • the routers supporting IPv6 refer to the hop-by-hop option header and routing information.
  • FIG. 4A is a diagram showing a basic structure of a hop-by-hop option header.
  • the "Next Header” field is used to distinguish the type of a header immediately following the hop-by-hop option header.
  • a "Hdr Ext Len” field indicates the length of the hop-by-hop option header.
  • An “Options” field is a variable-length field and stores option information related to the hop-by-hop option header.
  • FIG. 4B is a diagram of the structure of the Options" field in the hop-by-hop option header shown in FIG. 4A.
  • An Option Type” field stores option type information
  • an “Opt Data Len” field stores the length of an option data field of this option
  • an “Option data” field is a variable-length field and stores option type-specific data.
  • the third highest bit of the Option Type" field indicates whether or not information stored in the "Option Data" field of the hop-by-hop header changes in the middle of the routing path. For example, if the third highest bit of the Option Type" field is 0, it indicates that the option data information of the "Option Data” field cannot change and if the bit is 1 , it indicates that the option data information of the Option Data" field can change.
  • FIG. 5A is a diagram of the structure of the Options" field in a hop-by-hop option header constructed according to a preferred embodiment of the present invention when a packet is transmitted from a source node to a destination node.
  • FIG. 5B is a diagram of the structure of the Options" field in a hop-by-hop option header constructed according to another preferred embodiment of the present invention when a packet is transmitted from a destination node to a source node.
  • Information "0_1 0 0 0 1 1 1 " is stored in the "Option Type" field of
  • the value "0 1 0 0 0 1 1 1 " i.e., 71 stored in the "Option Type" field indicates that an OIP option of a case where a routing path is from the destination node to the source node is inserted into the present packet.
  • FIG. 6 is a diagram of the structure of a packet containing an OIP option according to the present invention.
  • the source node when time is up according to a timer setting and the source node desires to increase the PMTU, the source node generates a packet in which the OIP option described above is inserted (hereinafter, referred to as an "OIP packet") with the size of the existing PMTU, and transmits the packet to the destination node.
  • OIP packet a packet in which the OIP option described above is inserted
  • the next-hop link MTU value of the source node is stored.
  • each node While this OIP packet traverses each node on the routing path between the source node and the destination node, the apparatus of each node, for example, a router, performs the following operation.
  • the router compares the MTU value stored in the MTU field of the OIP packet with the next-hop link MTU.
  • the router stores the smaller one of the compared values in the MTU field of the OIP packet.
  • FIG. 7A is a diagram showing a preferred embodiment of a PMTU changing method according to the present invention.
  • the source node 710 When the present PMTU value is maintained for a predetermined time, the source node 710 with using a timer (not shown) generates an OIP packet 780 according to the present invention and transmits the OIP packet to the destination node 770.
  • the source node 710 uses another timer (not shown) to transmit the OIP packet and at the same time measures the time so that a PMTU can be changed according to the prior art PMTU changing method if a response packet to the transmitted OIP packet is not received for a predetermined time because the OIP packet is lost in the routing path.
  • the fifth node 760 receives the OIP packet 790 transmitted by the destination node 770, and recognizes the option type. Since the third highest bit value of the option type is 0, the fifth node 760 transmits the OIP packet 790 to the source node 710 without changing the MTU information stored in the MTU field.
  • the fourth node 750 receives the OIP packet 790 transmitted by the fifth node 760, and recognizes the option type.
  • the PMTU increasing method of the present invention it is possible to prevent generation of unnecessary error messages and waste of network resources that occur in the prior art PMTU increasing method by which a PMTU unconditionally increases as time passes. Also, when the fourth node 750 in the routing path cannot recognize the option type of the OIP packet 780 and therefore discards the OIP packet 780 in the embodiment of FIG. 7A, if the source node 710 does not receive a response OIP packet 790 to the OIP packet 780 from the destination node 770 after a predetermined time passes after transmission of the OIP packet 780, the source node 710 fragments the packet according to a PMTU value increased based on the prior art PMTU increasing method, and transmits the packet.
  • FIG. 7B is a diagram showing an improved PMTU changing method which is applied to a case when a node in the middle of a routing path between the source node 710 and the destination node 770 cannot recognize the OIP packet 780 and discards the OIP packet 780.
  • FIG. 9A is a diagram showing a basic structure of an ICMPv6 message used in the present invention.
  • FIG. 9B is a diagram showing a basic structure of an ICMP- Packet Too Big message when the value in the "Type" field of an ICMPv ⁇ message is 2.
  • the value in the "Type” field of the ICMPv ⁇ message is set to 2
  • the value in a "Code” field is usually set to 0 by a sender, and is neglected in a receiver.
  • An "MTU” field indicates a next-hop link MTU value.
  • FIG. 10A is a diagram showing a basic structure of a modified ICMP-Packet Too Big message used in a PMTU discovery method according to the present invention. Except the fact that the value of the "Code" field is 0 or 1 , the modified ICMP-Packet Too Big message shown in FIG. 10A has the same structure as that of the ICMP-Packet Too Big message of FIG. 9B.
  • the value in the "Code” field is set to 0.
  • the value in the "Code” field is set to 1.
  • the value in the "Code” field is 0 or 1.
  • the PMTU discovery method according to the present invention can be implemented.
  • FIG. 10B is a diagram showing a newly defined ICMP information message used in the PMTU discovery method according to the present invention, that is, an ICMP-PMTUD Minimizing Packet.
  • numbers 128 to 255 can be used in an ICMP information message and definitions have been determined to number 142.
  • a new ICMP information message having a "Type" field number of 143 is generated and used.
  • PMTU discovery method according to the present invention by using another "Type" field number that is not 143 and is not defined at present.
  • the number 143 indicating the PMTUD Minimizing Packet which is newly defined according to the present invention is stored in the "Type" field of the ICMP information message shown in FIG. 10B, and the value stored in the "Code” field is set to 0.
  • the next-hop link MTU value is stored in the "MTU" field.
  • the source address of the previous packet being discarded is stored as a source address value, and the destination address of the previous packet being discarded is stored as a destination address value.
  • the newly defined ICMP information message that is, the PMTUD Minimizing Packet is transmitted to the destination node unlike the ICMP- Packet Too Big message.
  • the message is filled with dummy data.
  • a PMTU discovery method using the modified ICMP-Packet Too Big message of FIG. 10A and the ICMP-PMTUD Minimizing Packet that is a newly defined ICMP information message shown in FIG. 10B is performed. Referring to FIG. 7B, the PMTU discovery method will now be explained.
  • the predetermined time can be appropriately adjusted by considering the system and network environment.
  • the source node 710 which operates as a host shown in FIG. 7B comprises a function unit which can distinguish between 0 and 1 of the "Code" field of the modified ICMP-Packet Too Big message, and immediately after this message is received, newly defines a PMTU, and retransmits a packet satisfying the size of the new PMTU.
  • Each of the first node 720, the fourth node 750, and the fifth node 760 comprises a function unit which can distinguish between 0 and 1 of the "Code" field of the modified ICMP-Packet Too Big message as in the source node, and generates the modified ICMP-Packet Too Big message of FIG. 10A and the ICMP-PMTUD Minimizing Packet, which is the newly defined ICMP information message of FIG. 10B. Also, each of these nodes comprises a storage space, as shown in FIG.
  • the message since the message is about an ICMP-PMTUD Minimizing Packet, the value in the "Code" field is 1.
  • the fourth node 750 stores information stored in the "MTU", “Source Address,” and “Destination Address” fields of the previous ICMP-PMTUD Minimizing Packet, that is, the ICMP-PMTUD Minimizing Packet ⁇ which is transmitted by the first node 720, into a storage space, for example, a cache having the structure shown in FIG. 8.
  • the message since the message is about an ICMP-PMTUD Minimizing Packet ⁇ , the value in the "Code" field is 1.
  • the source node 710 discards the packet fragmented according to the ICMP-Packet Too Big message ⁇ , and again fragments the packet according to the MTU value, that
  • the fourth node 750 already stored information stored in "MTU", “Source Address,” and “Destination Address” fields of the ICMP-PMTUD Minimizing Packet ⁇ which was transmitted by the first node 720, in the cache. Since these values stored in the cache are the same as the information in the packet, the fourth node 750 does not generate a separate ICMP error message. By doing so, it is possible to prevent unnecessary use of network resources.
  • the present invention may be embodied in a code, which can be read by a computer, on a computer readable recording medium.
  • the computer readable recording medium includes all kinds of recording apparatuses on which computer readable data are stored.
  • the computer readable recording media includes storage media such as magnetic storage media (e.g., ROM's, floppy disks, hard disks, etc.), optically readable media (e.g., CD-ROMs, DVDs, etc.) and carrier waves (e.g., transmissions over the Internet).
  • the computer readable recording media can be scattered on computer systems connected through a network and can store and execute a computer readable code in a distributed mode.
  • a PMTU can be determined in a shorter time, and it is possible to minimize the use of network resources, compared to prior art PMTU methods. Also, even though some of nodes in a routing path do not support the packet type according to the present invention, PMTU discovery between the source node and destination node can be performed by using the prior art PMTU discovery method.

Landscapes

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

Abstract

L'invention concerne un procédé de recherche et de changement d'une PMTU entre un noeud source et un noeud destination dans un réseau IP dynamique. Ce procédé consiste à : produire un paquet de recherche PMTU comportant un espace de stockage d'informations MTU dans lequel est stockée une valeur MTU enregistrée sur un chemin d'acheminement entre le noeud source et le noeud destination; transmettre le paquet de recherche PMTU produit au noeud destination; et, si un paquet de réponse au paquet de recherche PMTU est reçu du noeud destination, modifier la PMTU en fonction des informations MTU contenues dans le paquet de réponse, la valeur MTU stockée dans l'espace de stockage d'informations MTU étant comparée à une valeur MTU de liaison sur un chemin traversé par le paquet de recherche PMTU, et la plus petite des valeurs MTU stockée et MTU de liaison enregistrée sur le chemin traversé par le paquet étant stockée dans l'espace de stockage d'informations MTU.
EP03745469A 2002-03-29 2003-02-26 Procede de modification d'une pmtu dans un reseau ip dynamique et appareil utilisant ce procede Withdrawn EP1491005A4 (fr)

Applications Claiming Priority (5)

Application Number Priority Date Filing Date Title
US36832902P 2002-03-29 2002-03-29
US368329P 2002-03-29
KR2002034132 2002-06-18
KR10-2002-0034132A KR100453056B1 (ko) 2002-03-29 2002-06-18 동적 ｉｐ 네트워크 상에서의 ｐｍｔｕ 변경 방법 및 그장치
PCT/KR2003/000383 WO2003084145A1 (fr) 2002-03-29 2003-02-26 Procede de modification d'une pmtu dans un reseau ip dynamique et appareil utilisant ce procede

Publications (2)

Publication Number Publication Date
EP1491005A1 true EP1491005A1 (fr) 2004-12-29
EP1491005A4 EP1491005A4 (fr) 2006-09-13

Family

ID=28677697

Family Applications (1)

Application Number Title Priority Date Filing Date
EP03745469A Withdrawn EP1491005A4 (fr) 2002-03-29 2003-02-26 Procede de modification d'une pmtu dans un reseau ip dynamique et appareil utilisant ce procede

Country Status (4)

Country Link
EP (1) EP1491005A4 (fr)
CN (1) CN1647454A (fr)
AU (1) AU2003215923A1 (fr)
WO (1) WO2003084145A1 (fr)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2016192402A1 (fr) * 2015-06-03 2016-12-08 中兴通讯股份有限公司 Procédé et appareil de réglage d'unité de transmission maximale de tunnel ipv6

Families Citing this family (12)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
GB2406245B (en) * 2003-09-17 2006-01-04 Siemens Ag A method of transmitting packet data on a network
CN100375433C (zh) * 2003-11-13 2008-03-12 中兴通讯股份有限公司 动态发现IPsec隧道PMTU的方法
US7697524B2 (en) 2005-04-05 2010-04-13 Cisco Technology, Inc. Method and system for determining path maximum transfer unit for IP multicast
CN100459576C (zh) * 2005-08-05 2009-02-04 华为技术有限公司 一种探测路径最大传输单元的方法
US20070055784A1 (en) 2005-09-08 2007-03-08 Pancholi Ketan P Method to reduce the learning curve of a transmission control protocol connection
CN1992638A (zh) * 2005-12-26 2007-07-04 华为技术有限公司 在网络中获取路径最大传输单元的方法及系统
CN101022419B (zh) * 2007-03-27 2011-04-06 杭州华三通信技术有限公司 路径最大传输单元表项建立方法及报文发送方法和装置
CN101207571B (zh) * 2007-12-12 2011-04-20 华为技术有限公司 转发报文的方法和设备
JP5200755B2 (ja) * 2008-08-20 2013-06-05 日本電気株式会社 無線基地局、無線通信システム、パス接続方法およびプログラム
CN103117949B (zh) * 2013-01-24 2016-08-10 杭州华三通信技术有限公司 一种基于lsp隧道的报文传输方法和设备
US10142250B2 (en) 2015-01-26 2018-11-27 Hfi Innovation Inc. Maximum transmission unit size reporting using AT commands
CN113162866B (zh) * 2020-01-22 2023-08-01 中国移动通信有限公司研究院 一种报文传输方法、通信设备及介质

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6341129B1 (en) * 1998-04-03 2002-01-22 Alteon Networks, Inc. TCP resegmentation

Non-Patent Citations (4)

* Cited by examiner, † Cited by third party
Title
DHEERAJ SANGHI SAMEER SHAH IIT ET AL: "Extended Path MTU Discovery for IP version 6; draft-sanghi-pmtudisc-ext-00.txt;" IETF STANDARD-WORKING-DRAFT, INTERNET ENGINEERING TASK FORCE, IETF, CH, March 1997 (1997-03), XP015034908 ISSN: 0000-0004 *
MCCANN DIGITAL EQUIPMENT CORPORATION S DEERING XEROX PARC J MOGUL DIGITAL EQUIPMENT CORPORATION J: "Path MTU Discovery for IP version 6; rfc1981.txt" IETF STANDARD, INTERNET ENGINEERING TASK FORCE, IETF, CH, August 1996 (1996-08), XP015007765 ISSN: 0000-0003 *
See also references of WO03084145A1 *
SOOHONG DANIEL PARK HAKGOO LEE SAMSUNG ELECTRONICS: "The PMTU Discovery for IPv6 Using Hop-by-Hop Option Header <draft-park-pmtu-ipv6-option-header-00.txt >; draft-park-pmtu-ipv6-option-header-00.txt" IETF STANDARD-WORKING-DRAFT, INTERNET ENGINEERING TASK FORCE, IETF, CH, March 2003 (2003-03), XP015004784 ISSN: 0000-0004 *

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2016192402A1 (fr) * 2015-06-03 2016-12-08 中兴通讯股份有限公司 Procédé et appareil de réglage d'unité de transmission maximale de tunnel ipv6

Also Published As

Publication number Publication date
EP1491005A4 (fr) 2006-09-13
WO2003084145A1 (fr) 2003-10-09
CN1647454A (zh) 2005-07-27
AU2003215923A1 (en) 2003-10-13

Similar Documents

Publication Publication Date Title
US20030185208A1 (en) Method and apparatus for changing path maximum transmission unit on dynamic IP network
US7451227B2 (en) Method for path MTU discovery on IP network and apparatus thereof
McCann et al. Path MTU Discovery for IP version 6
JP5123367B2 (ja) データネットワークにおける断片化したデータグラムのフィルタリング及びルーティング
US9356879B2 (en) Optimized path maximum transmission unit discovery
US7450499B2 (en) Method and apparatus for interconnecting IPv4 and IPv6 networks
US20080159150A1 (en) Method and Apparatus for Preventing IP Datagram Fragmentation and Reassembly
Johnson et al. RFC 4728: The dynamic source routing protocol (DSR) for mobile ad hoc networks for IPv4
KR100513282B1 (ko) 에드 혹 네트워크에서의 패스 엠티유를 이용하여 데이터를 송신하는 데이터 송신 노드 및 송신 방법
WO2012124035A1 (fr) Dispositif de communication et procédé de communication
JPH11112574A (ja) 異種ネットワークでデータ・パケットを生成する方法およびシステム
KR100462864B1 (ko) 아이피브이6에서 인터페이스 아이디를 이용한 라우팅테이블 관리 방법
EP1491005A1 (fr) Procede de modification d&#39;une pmtu dans un reseau ip dynamique et appareil utilisant ce procede
US7317692B2 (en) Network path discovery
Sun et al. The Internet underwater: An IP-compatible protocol stack for commercial undersea modems
US7304959B1 (en) Utility based filtering mechanism for PMTU probing
US10205651B2 (en) Apparatus and method of selecting next hops for a session
WO2004075487A1 (fr) Noeud de communication ou de calcul et methode d&#39;acheminement de donnees
EP1491004A1 (fr) Procede de recherche de mtu a chemin de transmission dans un reseau ip et appareil correspondant
Papadopoulos et al. RFC 4944: per-hop fragmentation and reassembly issues
JP5657505B2 (ja) ネットワークシステム、中継装置、通信方法、中継方法及び中継プログラム
McCann et al. RFC1981: Path MTU Discovery for IP version 6
McCann et al. RFC 8201: Path MTU Discovery for IP version 6
JP2004511136A (ja) 通信ネットワークのためのインターネット・プロトコル・ヘッダ
Mogul et al. Network Working Group J. McCann Request for Comments: 1981 Digital Equipment Corporation Category: Standards Track S. Deering Xerox PARC

Legal Events

Date Code Title Description
PUAI Public reference made under article 153(3) epc to a published international application that has entered the european phase

Free format text: ORIGINAL CODE: 0009012

17P Request for examination filed

Effective date: 20040925

AK Designated contracting states

Kind code of ref document: A1

Designated state(s): AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HU IE IT LI LU MC NL PT SE SI SK TR

AX Request for extension of the european patent

Extension state: AL LT LV MK RO

A4 Supplementary search report drawn up and despatched

Effective date: 20060814

17Q First examination report despatched

Effective date: 20071002

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: THE APPLICATION IS DEEMED TO BE WITHDRAWN

18D Application deemed to be withdrawn

Effective date: 20080213