Abstract: Techniques for routing in communications networks include determining a state of a destination node in a current routing table stored at a first node. A value for a reference cost to the destination node is determined based on a minimum cost to the destination in the current routing table. Based on the state, a request message is formed including a reference distance field to prevent loops, an originating node field, a destination field, and a previous hop field. The request message is sent to a different second node within range. A record that indicates the data in the request message is stored in a pending request table. A reply message is received in response to sending the request message. In response to receiving the reply message, the record in the pending request table is removed, and the current routing table is updated based on the reply message.

Abstract: Techniques for routing in communications networks include determining a state of a destination node in a current routing table stored at a first node. A value for a reference cost to the destination node is determined based on a minimum cost to the destination in the current routing table. Based on the state, a request message is formed including a reference distance field to prevent loops, an originating node field, a destination field, and a previous hop field. The request message is sent to a different second node within range. A record that indicates the data in the request message is stored in a pending request table. A reply message is received in response to sending the request message. In response to receiving the reply message, the record in the pending request table is removed, and the current routing table is updated based on the reply message.

Abstract: Embodiments described herein provide a system for facilitating dynamic content distribution in an enterprise environment. During operation, the system receives, from a controller of the enterprise environment, an instruction for downloading a piece of content from one or more peers of a peer-to-peer protocol. The instruction can include a file descriptor that indicates a set of blocks the piece of content is divided into. The system can receive an offer for a first block of the set of blocks from a first peer of the one or more peers and determine whether the system is in a full peer relationship with a second peer of the one or more peers. The full peer relationship indicates that the second peer and the system are clients and servers of each other. If the system is in a full peer relationship, the system elects, between the second peer and the system, a sender for a first request that responds to the first offer.

Abstract: Embodiments described herein provide a system for facilitating dynamic content distribution in an enterprise environment. During operation, the system receives, from a controller of the enterprise environment, an instruction for downloading a piece of content from one or more peers of a peer-to-peer protocol. The instruction can include a file descriptor that indicates a set of blocks the piece of content is divided into. The system can receive an offer for a first block of the set of blocks from a first peer of the one or more peers and determine whether the system is in a full peer relationship with a second peer of the one or more peers. The full peer relationship indicates that the second peer and the system are clients and servers of each other. If the system is in a full peer relationship, the system elects, between the second peer and the system, a sender for a first request that responds to the first offer.