Update IPoMC Yellow Pages.txt
This commit is contained in:
parent
8243f04a53
commit
d9ad7cfe49
@ -1,133 +1,133 @@
|
|||||||
CURRENTLY (and for the forseeable future) IPoMC is always in unary mode, so dont worry about talk about any binary mode because thats all just speculative and not actually applicable to real world use
|
CURRENTLY (and for the forseeable future) IPoMC is always in unary mode, so dont worry about talk about any binary mode because thats all just speculative and not actually applicable to real world use
|
||||||
|
|
||||||
|
|
||||||
to use IPoMC:
|
to use IPoMC:
|
||||||
Step 1:
|
Step 1:
|
||||||
go to a IPoMC mailbox and place a minecart chest on the unpowered rail
|
go to a IPoMC mailbox and place a minecart chest on the unpowered rail
|
||||||
|
|
||||||
Step 2A:
|
Step 2A:
|
||||||
starting from the top left, fill the minecart with the correct combination of sugar and sugarcane for the targeted address
|
starting from the top left, fill the minecart with the correct combination of sugar and sugarcane for the targeted address
|
||||||
|
|
||||||
Step 2B:
|
Step 2B:
|
||||||
getting the proper combination of sugar and sugarcane is quite trivial,
|
getting the proper combination of sugar and sugarcane is quite trivial,
|
||||||
take the first number of the address (each number is seperated by a '.')
|
take the first number of the address (each number is seperated by a '.')
|
||||||
and put, the first number minus one, sugar in the minecart ( this can be 0 sugar)
|
and put, the first number minus one, sugar in the minecart ( this can be 0 sugar)
|
||||||
then put one sugarcane in afterwards to confirm the number
|
then put one sugarcane in afterwards to confirm the number
|
||||||
(for example if first number was 6 then you would put 5 sugar and one sugarcane in the cart)
|
(for example if first number was 6 then you would put 5 sugar and one sugarcane in the cart)
|
||||||
then keep repeating the process for each non zero number in the address
|
then keep repeating the process for each non zero number in the address
|
||||||
(if a number in the address is zero you can skip that number)
|
(if a number in the address is zero you can skip that number)
|
||||||
|
|
||||||
Step 3:
|
Step 3:
|
||||||
fill the minecart starting from the bottom right with the contents you wish to mail
|
fill the minecart starting from the bottom right with the contents you wish to mail
|
||||||
|
|
||||||
Step 4:
|
Step 4:
|
||||||
press the button to send the minecart
|
press the button to send the minecart
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
SIMPLE ADDRESS LIST:
|
SIMPLE ADDRESS LIST:
|
||||||
0.0.0.0 - SPECIAL - will repeat the last used address on the whole network
|
0.0.0.0 - SPECIAL - will repeat the last used address on the whole network
|
||||||
1.0.0.0 ghouly
|
1.0.0.0 ghouly
|
||||||
2.0.0.0 lighthouse
|
2.0.0.0 lighthouse
|
||||||
3.0.0.0 Reserved for rockettman
|
3.0.0.0 Reserved for rockettman
|
||||||
4.0.0.0 Opplers cafe
|
4.0.0.0 Opplers cafe
|
||||||
5.0.0.0 EMPTY
|
5.0.0.0 EMPTY
|
||||||
6.0.0.0 EMPTY
|
6.0.0.0 EMPTY
|
||||||
7.0.0.0 APEX harbor
|
7.0.0.0 APEX harbor
|
||||||
8.0.0.0 Mosqu thing
|
8.0.0.0 Mosqu thing
|
||||||
9.0.0.0 EMPTY
|
9.0.0.0 EMPTY
|
||||||
10.0.0.0 EMPTY
|
10.0.0.0 EMPTY
|
||||||
11.0.0.0 Community Center
|
11.0.0.0 Community Center
|
||||||
12.0.0.0 - 12.7.0.0 gregplex
|
12.0.0.0 - 12.7.0.0 gregplex
|
||||||
12.0.0.0 - SPECIAL - will send to the last used address in the sub-net
|
12.0.0.0 - SPECIAL - will send to the last used address in the sub-net
|
||||||
12.1.0.0 EMPTY
|
12.1.0.0 AMAZON IRON
|
||||||
12.2.0.0 wizard tower
|
12.2.0.0 wizard tower
|
||||||
12.3.0.0 zomblite house
|
12.3.0.0 zomblite house
|
||||||
12.4.0.0 EMPTY
|
12.4.0.0 EMPTY
|
||||||
12.5.0.0 EMPTY
|
12.5.0.0 EMPTY
|
||||||
12.6.0.0 EMPTY
|
12.6.0.0 EMPTY
|
||||||
12.7.0.0 EMPTY
|
12.7.0.0 EMPTY
|
||||||
12.8.0.0* SPECIAL - 8 sugar no cane: special address that loops-back and will send the packet to the next used address on the network once it is used again
|
12.8.0.0* SPECIAL - 8 sugar no cane: special address that loops-back and will send the packet to the next used address on the network once it is used again
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
Random Notes:
|
Random Notes:
|
||||||
|
|
||||||
The "Primary Network" is the physical system that handles the first address
|
The "Primary Network" is the physical system that handles the first address
|
||||||
(if you have an address like 12.3.0.0 the primary network handles the 12)
|
(if you have an address like 12.3.0.0 the primary network handles the 12)
|
||||||
|
|
||||||
Max address ranges per network:
|
Max address ranges per network:
|
||||||
Primary: 0.0.0.0 - 12.0.0.0
|
Primary: 0.0.0.0 - 12.0.0.0
|
||||||
Gregplex: 12.0.0.0 - 12.7.0.0
|
Gregplex: 12.0.0.0 - 12.7.0.0
|
||||||
|
|
||||||
if you send a package to an address outside of the range then it can produce a variety of results depending on the network handling that specific portion of the address:
|
if you send a package to an address outside of the range then it can produce a variety of results depending on the network handling that specific portion of the address:
|
||||||
On the primary network: loop back as if starting from zero (13.0.0.0 is the same as 1.0.0.0) but it will take significantly longer to send the message (12 or more hops)
|
On the primary network: loop back as if starting from zero (13.0.0.0 is the same as 1.0.0.0) but it will take significantly longer to send the message (12 or more hops)
|
||||||
On the gregplex network: technically sends the package like a blank slate, will effectively start the address back at 0.0.0.0 and increment that depending on what is actually input (this is absolute gibberish bullshit lol its not easy to understand im bad at articulating exactly what happens)
|
On the gregplex network: technically sends the package like a blank slate, will effectively start the address back at 0.0.0.0 and increment that depending on what is actually input (this is absolute gibberish bullshit lol its not easy to understand im bad at articulating exactly what happens)
|
||||||
|
|
||||||
if you send a package to an address that is EMPTY it will be deleted
|
if you send a package to an address that is EMPTY it will be deleted
|
||||||
|
|
||||||
TIME Complexity:
|
TIME Complexity:
|
||||||
First to properly calculate the amount of time to send a message (or ping) we must define a few terms
|
First to properly calculate the amount of time to send a message (or ping) we must define a few terms
|
||||||
|
|
||||||
IPoMC router: a router is basically the thing that reads out of a minecart and decides where to send it next (in unary this is always either the NEXT router or a Node, while in binary it can be either a router or a node)
|
IPoMC router: a router is basically the thing that reads out of a minecart and decides where to send it next (in unary this is always either the NEXT router or a Node, while in binary it can be either a router or a node)
|
||||||
|
|
||||||
Hop: a hop is basically the amount of time it takes for a minecart to pass through an IPoMC (unary) router
|
Hop: a hop is basically the amount of time it takes for a minecart to pass through an IPoMC (unary) router
|
||||||
1 hop (as of IPoMC rev 3) is about 8-9 seconds
|
1 hop (as of IPoMC rev 3) is about 8-9 seconds
|
||||||
|
|
||||||
Node: a segment of the IPoMC network
|
Node: a segment of the IPoMC network
|
||||||
nodes can either Mailboxes, or networks themselves such as the primary network or gregplex network
|
nodes can either Mailboxes, or networks themselves such as the primary network or gregplex network
|
||||||
for example; you can have network nodes, or mail nodes
|
for example; you can have network nodes, or mail nodes
|
||||||
|
|
||||||
Track Length Time (TLT): The track length time is the amount of time that it takes for a minecart to cross between two nodes in the network
|
Track Length Time (TLT): The track length time is the amount of time that it takes for a minecart to cross between two nodes in the network
|
||||||
|
|
||||||
There are 2 Potential Track times that can be defined
|
There are 2 Potential Track times that can be defined
|
||||||
|
|
||||||
Send TLT (STLT):
|
Send TLT (STLT):
|
||||||
the time between sending the message from a node, and it hitting the first IPoMC router in the next node ( the destination node will always be a network node )
|
the time between sending the message from a node, and it hitting the first IPoMC router in the next node ( the destination node will always be a network node )
|
||||||
|
|
||||||
Recieve TLT (RTLT):
|
Recieve TLT (RTLT):
|
||||||
the time between the cart leaving the last IPoMC router, and it reaching the next destination node
|
the time between the cart leaving the last IPoMC router, and it reaching the next destination node
|
||||||
( the destination node can either be a mailbox or another network node )
|
( the destination node can either be a mailbox or another network node )
|
||||||
|
|
||||||
now that we have defined some vocabulary, lets actually get to calculating the time it will take to send messages across IPoMC
|
now that we have defined some vocabulary, lets actually get to calculating the time it will take to send messages across IPoMC
|
||||||
|
|
||||||
firstly, if you just want a quick and dirty calculation u can just use this one
|
firstly, if you just want a quick and dirty calculation u can just use this one
|
||||||
HOPS(HOPTIME) + 2(STLT)
|
HOPS(HOPTIME) + 2(STLT)
|
||||||
you can get stlt quick and dirty by sending yourself a message and timing where that amount of time is T
|
you can get stlt quick and dirty by sending yourself a message and timing where that amount of time is T
|
||||||
STLT = (T - HOPS(HOPTIME)) / 2
|
STLT = (T - HOPS(HOPTIME)) / 2
|
||||||
|
|
||||||
The equation to do so is as follows
|
The equation to do so is as follows
|
||||||
(hoptime is the amount of time that a hop takes in whatever unit you are using)
|
(hoptime is the amount of time that a hop takes in whatever unit you are using)
|
||||||
HOPS(HOPTIME) + STLT + (RTLT₁ + RTLT₂ + RTLT₃ ...)
|
HOPS(HOPTIME) + STLT + (RTLT₁ + RTLT₂ + RTLT₃ ...)
|
||||||
|
|
||||||
there can be multiple Recieve TLT's in the equation as there can be track between multiple network nodes in the system
|
there can be multiple Recieve TLT's in the equation as there can be track between multiple network nodes in the system
|
||||||
|
|
||||||
so how do we calculate HOPS??
|
so how do we calculate HOPS??
|
||||||
hops is very simple to calculate, it is always going to be the sum of all the numbers in an address
|
hops is very simple to calculate, it is always going to be the sum of all the numbers in an address
|
||||||
for example, 12.3.0.0 would make 15 hops.
|
for example, 12.3.0.0 would make 15 hops.
|
||||||
|
|
||||||
so how do we calculate the real values of STLT and RTLT('s)?
|
so how do we calculate the real values of STLT and RTLT('s)?
|
||||||
well at this point its pretty much just algebra.
|
well at this point its pretty much just algebra.
|
||||||
first you need to measure the amount of time that it takes to send a package to the nodes own address
|
first you need to measure the amount of time that it takes to send a package to the nodes own address
|
||||||
(time from sending a cart to a node, to the cart making it back to the node it was sent from)
|
(time from sending a cart to a node, to the cart making it back to the node it was sent from)
|
||||||
lets say that the variable T = the amount of time you just measured
|
lets say that the variable T = the amount of time you just measured
|
||||||
you now have the equation T - HOPS(HOPTIME)
|
you now have the equation T - HOPS(HOPTIME)
|
||||||
you can fill in the hops and hoptime and evaluate the equation
|
you can fill in the hops and hoptime and evaluate the equation
|
||||||
now T - HOPS(HOPTIME) = STLT + (RTLT₁ + RTLT₂ + RTLT₃ ...)
|
now T - HOPS(HOPTIME) = STLT + (RTLT₁ + RTLT₂ + RTLT₃ ...)
|
||||||
|
|
||||||
now for the tricky part
|
now for the tricky part
|
||||||
|
|
||||||
you can basically do some fairly complicated math and timing from here and crosscompare everything or you can just manually solve for the STLT or RTLT by just timing one of them individually and solving for the other
|
you can basically do some fairly complicated math and timing from here and crosscompare everything or you can just manually solve for the STLT or RTLT by just timing one of them individually and solving for the other
|
||||||
|
|
||||||
the fairly complicated math route:
|
the fairly complicated math route:
|
||||||
FUCK THIS its 3 fucking AM< right now i cant do this shit without any sleep figure it out your god damn self i held your hand this far
|
FUCK THIS its 3 fucking AM< right now i cant do this shit without any sleep figure it out your god damn self i held your hand this far
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
|
Loading…
x
Reference in New Issue
Block a user