- Welcome to Networking-Forums.com.
We're Here to Help!
Recent posts
#11
Homework Help / Re: Computing CRC (used to fee...
Last post by networkloser - July 22, 2025, 06:55:43 AMThere are things like C(7,4), CRC-8, different representations.
#12
Homework Help / Computing CRC (used to feel si...
Last post by networkloser - July 22, 2025, 06:55:17 AMNow, I'm absolutely unsure why is CRC giving me a headache. 
Say I've this data to be sent with CRC:
1010
Now, I need CRC bits for this. Fourouzan and Kurose Ross book are too dense for me currently. Can anyone share some insightful materials to learn this? Something easier for my brain.
Grateful to any kind of help. Chatgpt and deepseek seems to be in what direction they have no idea
Say I've this data to be sent with CRC:
1010
Now, I need CRC bits for this. Fourouzan and Kurose Ross book are too dense for me currently. Can anyone share some insightful materials to learn this? Something easier for my brain.
Grateful to any kind of help. Chatgpt and deepseek seems to be in what direction they have no idea
#13
Homework Help / Re: How did Dijkstra's reach t...
Last post by deanwebb - July 14, 2025, 11:18:20 AMTo find the answer, I found this: https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm
And it's a fun little article about how Dijkstra thought it all out and made the algorithm. There is a step-by-step calculation that runs until one of the calculated paths reaches the destination. That first path is therefore the shortest.
The algorithm also works, with modifications, to present ranked-choice alternatives to the shortest path, should it become unavailable or degraded.
Other shortest-path solutions are discussed here: https://en.wikipedia.org/wiki/Shortest_path_problem . Solutions don't necessarily fail, but are rather perhaps better for some applications than others.
And it's a fun little article about how Dijkstra thought it all out and made the algorithm. There is a step-by-step calculation that runs until one of the calculated paths reaches the destination. That first path is therefore the shortest.
The algorithm also works, with modifications, to present ranked-choice alternatives to the shortest path, should it become unavailable or degraded.
Other shortest-path solutions are discussed here: https://en.wikipedia.org/wiki/Shortest_path_problem . Solutions don't necessarily fail, but are rather perhaps better for some applications than others.
#14
Homework Help / How did Dijkstra's reach to si...
Last post by networkloser - July 14, 2025, 02:19:34 AMIs there a history of attempts to write a shortest path algorithms? And how they failed? What was their thinking process. I am currently learning about link-state routing and I am unable to figure out centralized dijkstra's algorithm even after being stuck in screen/textbook for lots of hours. It is extremely overwhelming to me. Thus, if I could get ideas on why the algorithm was exactly made, why was it chosen for routing purposes, and stuffs like that, that'd greatly be of benefit to me.
#15
Homework Help / Re: Trying to understand scena...
Last post by icecream-guy - July 11, 2025, 09:08:31 AMyes but need a few more on ramps down the mainline.
#16
Homework Help / Re: Trying to understand scena...
Last post by networkloser - July 11, 2025, 06:31:58 AM
You mean something like this, right? I am learning slowly.
#17
Homework Help / Re: Trying to understand scena...
Last post by icecream-guy - July 07, 2025, 03:04:38 PMDo you have metered on-ramps on the highways near you? otherwise look it up, consider the highway the wire, consider the on -ramps as the buffer, cars as the packets, the more traffic on the highways, the slower the signals are to allow the cars from the on-ramps onto the highway to their destination. thus allowing all traffic on the highway, eventually (delay), but not so much that the highways are no so much congested (at capacity) and packets dropped (cars crash).
#18
Homework Help / Trying to understand scenario ...
Last post by networkloser - July 07, 2025, 02:28:44 AM
I tried googling in books dot google dot com for related materials on this, but was unable to find any. This is from kurose ross book and it's a bit convoluted. Can anyone guide me here a bit? I don't need exact answer but a way/place to look into.
#19
Homework Help / Re: Why doesn't tcp blindly re...
Last post by networkloser - July 07, 2025, 01:46:19 AMthanks
#20
Homework Help / Re: Why doesn't tcp blindly re...
Last post by deanwebb - July 04, 2025, 11:34:16 AMStart with 92-100. If no ack, then retry those a third time.
It's the "sliding window" idea. If transmissions are good, send larger and larger chunks up to a limit. If there is an interruption, start small again and see if that gets through. If not, then there's no point in sending all the other stuff.
It's the "sliding window" idea. If transmissions are good, send larger and larger chunks up to a limit. If there is an interruption, start small again and see if that gets through. If not, then there's no point in sending all the other stuff.