কলা
সৌন্দর্য এবং সুস্থতা
ক্রাফট
সংস্কৃতি ও ইতিহাস
বিনোদন
পরিবেশ
খাদ্য ও পানীয়
রিভার্স ইঞ্জিনিয়ারিং
বিজ্ঞান
খেলাধুলা
টেকনোলজি
পরিধানযোগ্য

The ARPANET IMP
Packet switching was an argument until BBN built the box. The Interface Message Processor was a ruggedised Honeywell DDP-516 with twelve thousand words of core memory, weighing about four hundred kilograms, and its entire purpose was to be the part of the network that the university's computer did not have to understand.
That division is the invention, more than any algorithm in it. Each site's host spoke to its IMP over a simple local interface specified in BBN Report 1822, and the IMP dealt with everything else: chopping messages into packets of about a thousand bits, checksumming them, sending them to a neighbour, waiting for that neighbour's acknowledgement, retransmitting when it did not come, and choosing which neighbour to use in the first place. A host with a different word length, a different character set and a different operating system needed to know none of it.
The first IMP went to UCLA on the thirtieth of August 1969. The second went to SRI. On the twenty-ninth of October they tried to send the word LOGIN from one to the other; SRI received L, then O, and then crashed. By December there were four nodes, joined by fifty-kilobit leased lines, and no IMP knew the shape of the network — each kept a table of estimated delays, told its neighbours, and believed whichever offered the lowest total.
FULLY BUILDABLE, and this is the one to actually build. Three microcontrollers in a chain, where the two ends have no direct link, so every packet between them must be stored, checked and forwarded by the middle one. That is an IMP's whole job, and seeing it work is different from reading about it.
উন্নত
5 hours
নির্দেশ
1
1
Build the three-node network
Build the three-node network
Flash the same sketch on three boards, changing MY_ADDR to 1, 2 and 3. Wire them as a chain — node 1 to node 2, node 2 to node 3 — and note that 1 and 3 are NOT connected.
Open all three serial monitors. Node 1 sends to node 3 every two seconds; node 2 prints that it is relaying; node 3 prints DELIVERED. Nothing in node 1's code knows how node 3 is reached.
Now do the experiment that matters. Briefly short the link between 2 and 3 with a jumper to corrupt a packet in flight. Node 2 prints CRC FAIL and DROPS it — it does not forward what it could not verify. That single decision is why a store-and-forward network can be built out of unreliable links at all: every hop refuses to launder corruption onward, so errors stop where they happen instead of arriving at the far end disguised as data.
imp_node.inocpp
এই ধাপের উপকরণ:
Jumper Wire Set1 টুকরা
Resistor Kit1 টুকরাআবশ্যক উপকরণ:
ESP32 Development Board
Breadboard - Classic
Desktop Computer
Digital Oscilloscope2
2
Watch the routing converge and then break
Watch the routing converge and then break
Extend the sketch so each node keeps a one-line table — for each destination, which neighbour and how many hops — and broadcasts it to both neighbours once a second. On receiving a neighbour's table, take any route that is cheaper than your own, plus one.
Boot all three at once with the tables empty and watch them fill. Node 1 learns about node 3 only because node 2 tells it. Nobody is in charge and there is no map.
Then unplug the link between 2 and 3 while it runs. Watch what node 1 believes. It will keep advertising a route to node 3 for several seconds, because its information came from node 2 and node 2 has not yet convinced it otherwise.
That lag is not a bug in your code. It is the counting-to-infinity problem, and the notebook shows why it is inherent to asking your neighbours instead of knowing the map.
আবশ্যক উপকরণ:
ESP32 Development Board
Desktop Computer
Stopwatch3
3
Delay, convergence, and counting to infinity
Delay, convergence, and counting to infinity
Jupyter নোটবুক লোড হচ্ছে…
আবশ্যক উপকরণ:
Desktop Computer4
4
Compendium: the box that let hosts stay ignorant
Compendium: the box that let hosts stay ignorant
THE INTERFACE WAS THE INVENTION. BBN Report 1822 defined a deliberately dumb link between host and IMP: hand over a message of up to 8095 bits with a destination number, and eventually get back a Request For Next Message meaning the far IMP has it. Everything else — packetisation, checksums, hop-by-hop acknowledgement, retransmission, routing, reassembly — happened inside the subnet. A PDP-10, a Sigma 7 and an IBM 360 with three different word lengths and three different character sets could join a network without agreeing on anything except that interface. Every later network kept the idea and moved the line: what an IMP did in hardware, IP and TCP later did in software on the host.
WHAT IT PROMISED, AND WHAT IT DID NOT. The IMP subnet promised to deliver messages between hosts, in order, or to say it could not. It did NOT promise a delivery time, and it could not survive a partition. It also could not talk to a network that was not the ARPANET, because addresses were IMP numbers on one network. That last limit is exactly what the datagram of blueprint 9 removes, and the word internetwork is what it removes it for.
সামগ্রী
2- 1 টুকরাপ্লেসহোল্ডর
- থেকে$5.79
সম্পর্কিত ব্লুপ্রিন্ট
এই ব্লুপ্রিন্টগুলি জ্ঞান ভাগ করে — কৌশল, উপকরণ বা নীতি
CC0 পব্লিক ডোমেন
এই ব্লুপ্রিন্ট CC0-এর অধীনে প্রকাশিত। আপনি অনুমতি ছাড়াই যেকোনো উদ্দেশ্যে এটি অনুলিপি, পরিবর্তন, বিতরণ ও ব্যবহার করতে পারেন।
মেকারের ব্লুপ্রিন্টের মাধ্যমে পণ্য কিনে তাঁকে সমর্থন করুন, যেখানে তিনি আয় করেন মেকর কমীশন বিক্রেতাদের নির্ধারিত, অথবা এই ব্লুপ্রিন্টের একটি নতুন সংস্করণ তৈরি করে নিজের ব্লুপ্রিন্টে সংযোগ হিসেবে যুক্ত করে আয় ভাগ করুন।




