Ed Arthurs

Learn More
A set of stations wish to transmit messages to one another over a shared link. Messages are generated either according to so called <italic>finite source</italic> or <italic>infinite source</italic> arrival statistics. The message lengths are independent identically distributed random variables. Two policies for arbitrating contention are compared:(More)
A transmitter sends packets over a local area network to a receiver. The receiver has a finite amount of storage capacity for buffering messages. A <italic>sliding window protocol</italic> is employed to insure all packets are delivered without error in order of arrival. Mean throughput rate and packet delay statistics are studied as a function of model(More)
  • 1