[Ready for review/merge] Search time

search.js:
- Updated debugging output for readability
- Search results were trying to key compare on unset values

search.html
- UI now shows tags for search results and links to searches for those tags

connection.py
- Removing hostname to IP code due to unexpected connectivity issues and minimal benefit
- Fixed null callback passed to lambda
- Upped timeout to 5 seconds for slow peers

dht.py
- Add Known Node takes a URI not an ip and port separately so fixed that
- Removed some unnecessary debugging output to clarify logs
- Add Known Node if not in the knownNodes. Was not getting added properly
- Removed Timeout of peers unknowing. This seems to be causing a threading issue where someone might try to reach that peer as you’re unknowing it. There probably needs to be a better way to do this.
- Kademlia requires you to send back close nodes even if you have routing to the exact node and we were shorting that by just returning the exact node. This creates an issue stopping us from having redundancy of storage.
- Mostly debugging cleanup beyond this

market.py
- Debugging info added
- Threading now for DHT storage of contracts, updates to listing indices and keyword indices

transport.py
- Fixed the ip/port and URI issue mentioned above

ws.py
- Added a client refund order method for setting up refunds (somewhat unrelated to the rest of the PR but give me a break)



Unless you need to log the removal of each node separately, it is better performance-wise to do them all in one pass, using a [filter](https://en.wikipedia.org/wiki/Filter_(higher-order_function)). In python, you can use the [filter](https://docs.python.org/2/library/functions.html#filter) builtin or a comprehension.

Assuming that `self.knownNodes` is a `list`, the *entire* for-loop can be refactored as follows:
```
count_init = len(self.knownNodes)
self.knownNodes = [v for v in self.knownNodes if v[0] != node[0] or v[1] is not None]
count_removed = count_init - len(self.knownNodes)
if count_removed > 0:
    self.log.info('Removed %d old nodes', count_removed)
```
Similar expresssions can be written for `set`, `dict` and `tuple` comprehensions.