Describe a data structure for keeping track of all open TCP connections for a machine. The data structure should support efficiently adding and deleting connections and searching by host, source port, and destination port

What will be an ideal response?

Create a record for each connection and store all records in a doubly linked list
L, which supports insertions and deletions in constant time, assuming that a link to the
record to be deleted is provided. To search efficiently for a connection record by host name,
source port, or destination port, create three search structures, such as red-black trees or
hash tables, that store items of the type (k, p), where k is the search key and p is a link to
a connection record in L.