internet fragmentation and reassembly procedure
I am currently reading the RFC 791 of the IETF which explains the Internet Protocol thoroughly. At one place it talks about fragmentation and reassembly procedure based on network types. On researching further I came across a research paper the concept of MTU(Maximum Transmission Unit) based fragmentation. I have two questions regarding this. Firstly, are fragmentation and reassembly costly procedures (which I hope they are as there are the creation of new datagrams and a lot of copying) and if they are then secondly, do the routing protocols take in consideration of a longer path with a greater RTT but also having a greater MTU such that less or no fragmentation is required if the datagrams proceed through them?
routing network-programming ip
add a comment |
I am currently reading the RFC 791 of the IETF which explains the Internet Protocol thoroughly. At one place it talks about fragmentation and reassembly procedure based on network types. On researching further I came across a research paper the concept of MTU(Maximum Transmission Unit) based fragmentation. I have two questions regarding this. Firstly, are fragmentation and reassembly costly procedures (which I hope they are as there are the creation of new datagrams and a lot of copying) and if they are then secondly, do the routing protocols take in consideration of a longer path with a greater RTT but also having a greater MTU such that less or no fragmentation is required if the datagrams proceed through them?
routing network-programming ip
Welcome to Stackoverflow. This site is for questions that directly involve programming. Your question does not appear to be about programming, and therefore it is off-topic for Stackoverflow. You will have a better chance of getting an answer if you ask this question on the networkengineering.stackexchange.com site instead.
– ottomeister
Nov 22 '18 at 22:02
add a comment |
I am currently reading the RFC 791 of the IETF which explains the Internet Protocol thoroughly. At one place it talks about fragmentation and reassembly procedure based on network types. On researching further I came across a research paper the concept of MTU(Maximum Transmission Unit) based fragmentation. I have two questions regarding this. Firstly, are fragmentation and reassembly costly procedures (which I hope they are as there are the creation of new datagrams and a lot of copying) and if they are then secondly, do the routing protocols take in consideration of a longer path with a greater RTT but also having a greater MTU such that less or no fragmentation is required if the datagrams proceed through them?
routing network-programming ip
I am currently reading the RFC 791 of the IETF which explains the Internet Protocol thoroughly. At one place it talks about fragmentation and reassembly procedure based on network types. On researching further I came across a research paper the concept of MTU(Maximum Transmission Unit) based fragmentation. I have two questions regarding this. Firstly, are fragmentation and reassembly costly procedures (which I hope they are as there are the creation of new datagrams and a lot of copying) and if they are then secondly, do the routing protocols take in consideration of a longer path with a greater RTT but also having a greater MTU such that less or no fragmentation is required if the datagrams proceed through them?
routing network-programming ip
routing network-programming ip
asked Nov 22 '18 at 11:45
Pranav DubeyPranav Dubey
32
32
Welcome to Stackoverflow. This site is for questions that directly involve programming. Your question does not appear to be about programming, and therefore it is off-topic for Stackoverflow. You will have a better chance of getting an answer if you ask this question on the networkengineering.stackexchange.com site instead.
– ottomeister
Nov 22 '18 at 22:02
add a comment |
Welcome to Stackoverflow. This site is for questions that directly involve programming. Your question does not appear to be about programming, and therefore it is off-topic for Stackoverflow. You will have a better chance of getting an answer if you ask this question on the networkengineering.stackexchange.com site instead.
– ottomeister
Nov 22 '18 at 22:02
Welcome to Stackoverflow. This site is for questions that directly involve programming. Your question does not appear to be about programming, and therefore it is off-topic for Stackoverflow. You will have a better chance of getting an answer if you ask this question on the networkengineering.stackexchange.com site instead.
– ottomeister
Nov 22 '18 at 22:02
Welcome to Stackoverflow. This site is for questions that directly involve programming. Your question does not appear to be about programming, and therefore it is off-topic for Stackoverflow. You will have a better chance of getting an answer if you ask this question on the networkengineering.stackexchange.com site instead.
– ottomeister
Nov 22 '18 at 22:02
add a comment |
1 Answer
1
active
oldest
votes
Firstly, are fragmentation and reassembly costly procedures (which I
hope they are as there are the creation of new datagrams and a lot of
copying)
That depends on what you consider "costly". But generally speaking, yeah. Fragmentation is something you want to avoid. It's wasteful and risky (if one fragment is lost, the entire packet is lost).
secondly, do the routing protocols take in consideration of a longer
path with a greater RTT but also having a greater MTU such that less
or no fragmentation is required if the datagrams proceed through them?
No. Routers don't know the MTUs to different destinations. In practice, networks typically use a constant MTU of 1500 bytes, especially core networks. AFAIK the only places you might run into fragmentation in practice is at the edges of the network due to tunneling.
Then can i design a network layer protocol with heuristics in mind regarding congestion control, mtu and similar properties to effectively route a datagram in a more efficient way. I know it will require change in hardwares also but it's just hypothetical like if i design my own network above data link layer
– Pranav Dubey
Dec 3 '18 at 15:51
add a comment |
Your Answer
StackExchange.ifUsing("editor", function () {
StackExchange.using("externalEditor", function () {
StackExchange.using("snippets", function () {
StackExchange.snippets.init();
});
});
}, "code-snippets");
StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "1"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});
function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});
}
});
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fstackoverflow.com%2fquestions%2f53430307%2finternet-fragmentation-and-reassembly-procedure%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
Firstly, are fragmentation and reassembly costly procedures (which I
hope they are as there are the creation of new datagrams and a lot of
copying)
That depends on what you consider "costly". But generally speaking, yeah. Fragmentation is something you want to avoid. It's wasteful and risky (if one fragment is lost, the entire packet is lost).
secondly, do the routing protocols take in consideration of a longer
path with a greater RTT but also having a greater MTU such that less
or no fragmentation is required if the datagrams proceed through them?
No. Routers don't know the MTUs to different destinations. In practice, networks typically use a constant MTU of 1500 bytes, especially core networks. AFAIK the only places you might run into fragmentation in practice is at the edges of the network due to tunneling.
Then can i design a network layer protocol with heuristics in mind regarding congestion control, mtu and similar properties to effectively route a datagram in a more efficient way. I know it will require change in hardwares also but it's just hypothetical like if i design my own network above data link layer
– Pranav Dubey
Dec 3 '18 at 15:51
add a comment |
Firstly, are fragmentation and reassembly costly procedures (which I
hope they are as there are the creation of new datagrams and a lot of
copying)
That depends on what you consider "costly". But generally speaking, yeah. Fragmentation is something you want to avoid. It's wasteful and risky (if one fragment is lost, the entire packet is lost).
secondly, do the routing protocols take in consideration of a longer
path with a greater RTT but also having a greater MTU such that less
or no fragmentation is required if the datagrams proceed through them?
No. Routers don't know the MTUs to different destinations. In practice, networks typically use a constant MTU of 1500 bytes, especially core networks. AFAIK the only places you might run into fragmentation in practice is at the edges of the network due to tunneling.
Then can i design a network layer protocol with heuristics in mind regarding congestion control, mtu and similar properties to effectively route a datagram in a more efficient way. I know it will require change in hardwares also but it's just hypothetical like if i design my own network above data link layer
– Pranav Dubey
Dec 3 '18 at 15:51
add a comment |
Firstly, are fragmentation and reassembly costly procedures (which I
hope they are as there are the creation of new datagrams and a lot of
copying)
That depends on what you consider "costly". But generally speaking, yeah. Fragmentation is something you want to avoid. It's wasteful and risky (if one fragment is lost, the entire packet is lost).
secondly, do the routing protocols take in consideration of a longer
path with a greater RTT but also having a greater MTU such that less
or no fragmentation is required if the datagrams proceed through them?
No. Routers don't know the MTUs to different destinations. In practice, networks typically use a constant MTU of 1500 bytes, especially core networks. AFAIK the only places you might run into fragmentation in practice is at the edges of the network due to tunneling.
Firstly, are fragmentation and reassembly costly procedures (which I
hope they are as there are the creation of new datagrams and a lot of
copying)
That depends on what you consider "costly". But generally speaking, yeah. Fragmentation is something you want to avoid. It's wasteful and risky (if one fragment is lost, the entire packet is lost).
secondly, do the routing protocols take in consideration of a longer
path with a greater RTT but also having a greater MTU such that less
or no fragmentation is required if the datagrams proceed through them?
No. Routers don't know the MTUs to different destinations. In practice, networks typically use a constant MTU of 1500 bytes, especially core networks. AFAIK the only places you might run into fragmentation in practice is at the edges of the network due to tunneling.
answered Nov 23 '18 at 11:06
MaltMalt
16.4k34162
16.4k34162
Then can i design a network layer protocol with heuristics in mind regarding congestion control, mtu and similar properties to effectively route a datagram in a more efficient way. I know it will require change in hardwares also but it's just hypothetical like if i design my own network above data link layer
– Pranav Dubey
Dec 3 '18 at 15:51
add a comment |
Then can i design a network layer protocol with heuristics in mind regarding congestion control, mtu and similar properties to effectively route a datagram in a more efficient way. I know it will require change in hardwares also but it's just hypothetical like if i design my own network above data link layer
– Pranav Dubey
Dec 3 '18 at 15:51
Then can i design a network layer protocol with heuristics in mind regarding congestion control, mtu and similar properties to effectively route a datagram in a more efficient way. I know it will require change in hardwares also but it's just hypothetical like if i design my own network above data link layer
– Pranav Dubey
Dec 3 '18 at 15:51
Then can i design a network layer protocol with heuristics in mind regarding congestion control, mtu and similar properties to effectively route a datagram in a more efficient way. I know it will require change in hardwares also but it's just hypothetical like if i design my own network above data link layer
– Pranav Dubey
Dec 3 '18 at 15:51
add a comment |
Thanks for contributing an answer to Stack Overflow!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fstackoverflow.com%2fquestions%2f53430307%2finternet-fragmentation-and-reassembly-procedure%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Welcome to Stackoverflow. This site is for questions that directly involve programming. Your question does not appear to be about programming, and therefore it is off-topic for Stackoverflow. You will have a better chance of getting an answer if you ask this question on the networkengineering.stackexchange.com site instead.
– ottomeister
Nov 22 '18 at 22:02