Corpus ID: 1694443

Basic algorithm

@inproceedings{Hales2006BasicA,
  title={Basic algorithm},
  author={D. Hales and Stefano Arteconi and O. Babaoglu},
  year={2006}
}
see the bus be empty for two times the maximum propagation time plus the minimum length of time needed to detect a packet plus the minimum space between packets. This makes an empty slot always cost 64 bytes. The third diagram shows a full slot, which incurs the cost of sending a new minimum length packet (35 bytes) plus its associated propagation delay and minimum space, for a total cost of between 47 and 76 bytes. The last diagram shows a collision slot. In this diagram, B actually stands for… Expand
4 Citations

Figures from this paper

Visual Based Predictive Control for a Six Degrees of Freedom Robot
  • P. Ferreira, J. Pinto
  • Engineering, Computer Science
  • 2006 IEEE Conference on Emerging Technologies and Factory Automation
  • 2006
Feed-forward guided generalized predictive control of PMSM drive
A Bihormonal Closed-Loop Artificial Pancreas for Type 1 Diabetes

References

SHOWING 1-10 OF 27 REFERENCES
Packet Trains-Measurements and a New Model for Computer Network Traffic
Announced Retransmission Random Access Protocols
Delay analysis of interval-searching contention resolution algorithms
Real-Time Communication in an Internetwork
  • D. Ferrari
  • Computer Science
  • J. High Speed Networks
  • 1992
A measurement study of diskless workstation traffic on an Ethernet
Tree algorithms for packet broadcast channels
Finite Population CSMA/CD Networks
Network performance of packet video on a local area network
  • K. Nichols
  • Computer Science
  • Eleventh Annual International Phoenix Conference on Computers and Communication [1992 Conference Proceedings]
  • 1992
...
1
2
3
...