The Tanenbaum quotes post returns. The first three are from the book Computer Networks, 4th edition. The last one from Modern Operating Systems, second edition.

Page 310: Talking about Bluetooth.

In 1994, the L.M. Ericsson company became interested in connecting its mobile phones and other devices without needing cables… The project was assigned the name Bluetooth, in honor of Harald Blaatand (Bluetooth) II (940-981), a Viking king who unified (that is, conquered) Denmark and Norway, also without needing cables.

Page 418: About interconnectivity, and how difficult it is to achieve with the number of different networks that exist today.

There is considerable controversy over whether the current abundance of network types is a temporary condition that will disappear as soon as everyone realizes how wonderful [insert your favorite network here] is…

Page 460: Before this one I’m going to make a mini introduction: The Internet is composed of autonomous systems. The protocols that handle routing between these systems are called Border Gateway Protocols. For example, a telephone company might decide not to use its routers with data sent from someone who is not its customer (from another telephone company). That is, these protocols are largely concerned with policy.

Typical policies involve political, security, or economic considerations. Some examples of routing restrictions are:

• No transit through certain autonomous systems.
• Never put Iraq on a route that starts at the Pentagon.
• Traffic that starts or ends at IBM should not transit through Microsoft.

Page 167: About deadlocks.

The simplest strategy (for handling deadlocks) is the ostrich algorithm: stick your head in the sand and pretend there is no problem. Footnote: Actually, what is said about ostriches is absurd. They can run at 60 km/h and their kick is violent enough to kill any lion that might be thinking about having giant chicken for dinner.