Geekbench 5 Benchmark Test: --------------------------------- Test | Value | Single Core | 336 Multi Core | 345 Full Test | https://browser.geekbench.com/v5/cpu/5399053
Geekbench releases can only be downloaded over IPv4. FTP the Geekbench files and run manually.
VirMach use Track - How to enable AES-NI without opening a ticket
You may already find that two box above, one is AES-NI enabled but another one not.
When you reinstall your OS in VirMach’s SolusVM:
You can see some operating system is end with a gen2 If you install these gen2 template, your box will likely to enable the AES-NI. Even you reinstall to other OS later, the AES are still enabled.
Personlly, I install Debian 8 x 86_64 Minimal v1 (gen 2)
Posted Updated How To2 minutes read (About 280 words)
Since I recently learned about Nodejs, and I will probably focus on nodejs in the foreseeable future, I migrated my blog from Wordpress to Hexo. Here is a little note about how to install a hexo blog.
Install VSCode
This part you need to do it yourself.
Install scoop
Scoop is a package manager on Windows. Highly suggested.
Type the following into PowerShell to ensure that local scripts are allowed to execute.
How long does it take for a packet to arrive at its destination
How responsive is the system to user commands
Can the network support real-delivery such as audio and video
Routing Algorithm
“Good” path:
The minimum cost path
Other definitions are possible
Hop count
The number of routers a packet must go through
Least-cost routing
Associate a cost with each link
Bandwidth
Delay
Reliability
To make routing decision:
Topology of the network
Traffic load
Link cost
Information should always keep up-to-date
More information
Fixed Routing
Central Directory is usually stored at a network control center
Matrix table
No different between Datagram and VC
Advantages
Simplicity
Work Well in a reliable network with a stable load (IPLC?)
Disadvantages
Lack of flexibility
Do not react to network congestion or failures
Flooding Algorithm
Packet sent to every neighbor node
No network information required
Evenually a number of copies will arrive at destination
Guarantees the packet reaches the destination in the shortest time
Duplicate packets are generated.
Node can remember packets already forwarded
Advantage
Very rebust
Used for sending emergency messages
Disadvantage
High traffic load
Random Algorithm
The outgoing link is chosen at random Round-robin?
Advantages
Robust and simple
no network information
Less traffic load compare to flooding
Disadvantages
Longer path
Performance not guaranteed
Adaptive Routing
Used by almost all packet switching network ** routing decision changes as network conditions change**
Failure Link
Network congestion
Require network information
Network information must be exchanged among the nodes
Decisions are more complex
Advantages
Impoved performance
Congestion control
Disadvantages
Substantial processing burden on nodes
Increased network traffic traffic due to the exchange of network information
Reacting too quickly can cause oscillation
Distance Vector Routing
Each node communicates only with directly-attached neighborsA routing table is created by building up a common set of routers in close proximity to each other, hence the term “distributed”. Each router on the network must maintain a two-dimensional Vector Table, which records the best known distance from its own router to each router. A router periodically builds a routing table by exchanging vector tables with neighboring routers (not broadcast to all routers). When a router receives a vector table from its neighbors and then corrects its own vector table, the contents of the vector table are continually corrected and retransmitted, and the entire network state is gradually passed to each router. As the routing tables on the routers become more complete, it becomes possible to find the best path. The vector table is sent only to the neighboring routers, which consumes less bandwidth and does not cause broadcast oscillation.
Link State Routing
Information sharing - each router shares its knowledge of its neighbourhood with all routers in the network. After all LASs from all nodes are gathered, the entire map of the network can be constructed.
Packets may go by different paths across the network
May arrive out of order, the transport layer neeeds to reorder them
Virtual circuit network
Connection-oriented switching
Call request and call accept packets are used to establish the connection between sender and receiver
Each packet carries tag(virtual circuit ID), tag determines next hop
fixed path determined at call setup time, remains fixed thru call
routers maintain per-call state
Path is fixed
Virtual Circuit approach
All packets of the same message are transferred via a preplanned route(same route)
Arrive in order
Eatablish between sender and receiver at the beginning
There are two main virtual circuit
Permanent virtual circuit(PVC)
Set up by the network provider
No need to terminate the VC after transmission, and no need to set up the VC before it(because it is already seted up by network provider)
Switch virtual circuit
Setup everytime when a VC is needed, and terminate after the transmission
May get different VC according to network conditions
More flexible, but required extra set up time before data transfer begins
Connection establishment
Data transfer
Connection release
VC vs Datagram
VC
sequencing and error control
No routing decisions to make -> Packets are forwarded more quickly
Less reliable
Datagram
No call setup phase - Good for bursty data
More flexible
can have alternate route
can avoid congested parts of the network
Switching
Switching in computer network helps in deciding the best route for data transmission if there are multiple paths in a larger network One-to-One connection
Packet Switching
The internet is a packet switched network
Message is broken into individual (Packets)
Each packet is sent individually
Each packet will have source and destination IP address with sequence number.
