I need a structure that resembles an RSS feed of items, but each item is on a different network machine. Users cannot insert in the middle of the feed but only at its head. Deletions are possible. The first idea was to implement a basic linked-list where each item of the list is an RSS item. Being on the network, this means that to retrieve the latest 10 feed items, I need to wait sequentially until each node returns from the network (so that I can follow the pointer to the next item in the linked list). Skip lists make this more concurrent as each node also gives me back pointers to other portions of the list and I can request more items in parallel. However, I'm looking even further for something that follows more closely my users need: there will be more requests of the latest portion of the feed rather than the older portion. With this requirement in mind, I'd be looking for a structure that can perhaps allow me to achieve higher concurrency closer to the head of the list (where latest feed items are), and less concurrency (with more sequential properties) as users get towards the end of the list.My thinking is that skip lists achieve the same level of concurrency across the entire list, so perhaps there's something I can use to make it very concurrent at the beginning and less concurrent at the end rather than same concurrency all along. 
Best data structure for storing an ordered list, where each item is located on a separate server?
data structures;distributed systems;linked lists