Sequential (30) Binding

.
John : See the 1st Pic above.  It's almost 100% equal to an integrated circuit. 
Me: The only difference is that there is a logical node.
.
__
.
John : Correct. Take a look.  https://chihaukam.blogspot.com/2024/09/blog-post_2.html?m=1. It said,
1) The telecom has a channel to access to the Cache of PTSN. 
2) The Cache is only to bind an address to a telephone number.
.
____
.
John : The Cache itself is only for binding not for logics.
Me: What do you mean by not for logics?
.
__
.
John : I mean,  you can't add a code like that in the Cache of PTSN,
.
 
Integer (the caller); <--- Physical address of the Caller.
Integer (the receiver) ; <--- The telephone number

if (the caller = John (Physical address)) 
{
Bind (the physical address, the receiver (the Telephone number));
Bind (the physical address, Kelvin); <-- Kelvin hack the telecom and add a code in the Logical Node.
}
.
Me: If I need a hacker's code like this,  what should I do?
.
John: See the Picture above.  Telecom can access to the Cache.  Telecom can access to the Logical Node either. 
.
Me: Ok.
.
John: Inside the Logical Node, you may add an extra code like that there.
.
Me: Ok.
.
John: If you don't add an extra code there in the Logical Node,  it normally runs like this, 
.
.
Int (the receiver); <--- Telephone number. 
.
Int (the caller); <--- Physical address. 
.
If (the caller and the receiver ! = Null)
{
To Cache network of Telephone. 
.
Bind (the receiver, physical address);
}
}
.
John: See the 2nd picture.  It's a cable TV broadcast.  It is a 1-to-1,000 relationship.
.
Me: In another words,  1 caller (Physical address) is to 1,000 receiver (Ip).
.
John: Yes,.

Comments