1) Slotted-ALOHA
• The time of the channel is divided by a time-slot with the fixed length
• The size of a frame is fixed and a frame is transmitted during a time-slot.
• A node having frames transmits with probability p, at the beginning of a time-slot
2)1-persistent CSMA/CD + binary exponential backoff
• 1-persistent CSMA + Collision detection
- Listen before transmission till channel is free
- If the channel idle, transmit
- Additionally continue to monitor channel during transmission
- If collision is detected, immediately abort transmission and try to retransmit after the delay which is
determined according to the binary backoff scheme
• binary exponential backoff
- The delay is an integral multiple of slot time. The number of slot time to delay before nth retransmission
attempts is chosen as an uniformly distributed random integer r in the range 0 < r 2K,
where K=min(n,10).
3) Server에서 실행되고 있는 임의의 프로세스 cpu/mem usage 얻기
(top 소스 복잡하던데, 좋은 소스 없나?)
4) 임의의 프로세스가 syslog에 critical msg 또는 info msg를 남기면 trap이 발생되어 Client에서 해당정보를 얻기
ps. 누가 대신 만들어줬으면 좋겠다...ㅜㅜ
