Menu

Show posts

This section allows you to view all posts made by this member. Note that you can only see posts made in areas you currently have access to.

Show posts Menu

Messages - networkloser

#1
There are things like C(7,4), CRC-8, different representations.
#2
Now, I'm absolutely unsure why is CRC giving me a headache.  :-X

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. :eek:

Grateful to any kind of help. Chatgpt and deepseek seems to be in what direction they have no idea
#3
Is 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.
#4


You mean something like this, right? I am learning slowly.
#5




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.
#7
Host a sends data 92 to 100.
Again host a sends 100 to 120.

The acknowledgement from b hasn't arrived and doesn't arrive within specified timeout interval.

Now my question is why doesn't host a retransmits both 92 to 100 and 100 to 120 when next timer starts. I know it does to make sure it doesn't applies too much pressure in network and wants to verify if there is some problems with receiver. But i forgot where i had read it. Can u send me?

I was following kurose ross networking book but can't find that specific line there no matter how much i searched so far...
#8
Thanks 🙏
#9
The kurose ross book says udp provides error detection is an example of end to end principle in system design. I want to further research humanly on this. Pls 🙏 guide
#10
https://d3s.mff.cuni.cz/teaching/nswi106/202324/reading/internetworking/

Something like this could prove beneficial. I prefer academically written textbooks.
#11
l to learn these topics? I mean I just want to learn this exact chapter from a book, what topics should I seek? I am trying to implement it on k3s.
#12
Network Security: Types of Computer Security, Types of Security Attacks, Principles of cryptography, RSA Algorithm, Digital Signatures, securing e-mail (PGP), Securing TCP connections (SSL), Network layer security (IPsec, VPN), Securing wireless LANs (WEP), Firewalls


This is the part of 20 subject syllabus for exam. It's subjective exam meaning answers are written instead of tick marks.


I am starting to learn this. What should I be learning in digital signatures? That benefit me in the long run as well as help me in exam? What about PGP? What practical scenarios can I implement on my own? Or is it left untouched because there're APIs that handle it for me these days? I'd love your insights on any of the topics.

#13
DVR shares entire routing table to neighbours periodically.

For loops prevention, it uses just hop count metric.

It uses bellman ford algorithm for implementation.


LSR doesn't send entire routing table to others, just share the LSA(Link State Advertisement).

To prevent looping various metric along with hop count is used.

Djikstra's shortest path finding algorithm is used here.
#14
I read the networking explained book and it has covered this description neatly.
#15
I've been searching my entire day for exercises. And finally went to chatpgt. It gave me some exercises but without context. Here's what it told me:


2. Solve Theoretical Problems
Practice questions and scenarios:

Analyze a network graph and calculate routing tables manually.
Trace how routing tables evolve over time in a distance-vector protocol.
Compute shortest paths using Dijkstra's algorithm for link-state routing.
Compare and contrast RIP vs. OSPF through theoretical scenarios.


About where to find problems it told me "CCNA" would have such problems as a part of exam. Can you point me towards it? Because I can merely find anything on my own so far.