Revision b9e0d721

View differences:

include/chunk.h
4 4
/** 
5 5
 * @file chunk.h
6 6
 *
7
 * Chunk structure.
7
 * @brief Chunk structure.
8 8
 * Describes the structure of the chunk
9 9
 *
10 10
 */
include/chunkbuffer.h
4 4
/** 
5 5
 * @file chunkbuffer.h
6 6
 *
7
 * This is the chunks buffer.
7
 * @brief This is the chunk buffer of the peer.
8 8
 * 
9 9
 * The chunks buffer is responsible for storing the chunks received by a
10 10
 * peer. Each chunk is stored until the chunk buffer decides to discard it
include/chunkidset.h
1 1
/** @file chunkidset.h
2 2
 *
3
 * Chunk ID Set
3
 * @brief Structure containing a set of chunk IDs.
4 4
 *
5 5
 * The Chunk ID Set is an abstract data structure that can contain a set of
6 6
 * (chunk ID, priority) couples. Few simple operations for adding chunk IDs
include/msg_types.h
6 6
 * @file msg_types.h
7 7
 * @brief Basic message type mappings.
8 8
 *
9
 * Here the definition of the various SOM message types are collected.
9
 * Here the definitions of the various SOM message types are collected.
10 10
 *
11 11
 */
12 12
#define MSG_TYPE_TOPOLOGY   0x10
include/peer.h
1 1
/**
2 2
 * @file:   peer.h
3
 * @brief Peer structure definition.
3 4
 * @author: Alessandro Russo <russo@disi.unitn.it>
4 5
 *
5 6
 * @date December 15, 2009, 2:09 PM
include/peerset.h
1 1
/** @file peerset.h
2 2
 *
3
 * Peer Set
3
 * @brief Structure containing a set of peers.
4 4
 *
5 5
 * The Peer Set is an abstract data structure that can contain a set of
6 6
 * peer structures. It handles peers by their nodeIDs. Peer structures
include/scheduler_common.h
3 3

  
4 4
/**
5 5
 * @file scheduler_common.h
6
 * @brief Common definitions for the scheduler
6
 * @brief Common definitions for the scheduler.
7 7
 *
8 8
 */
9 9

  
include/scheduler_ha.h
5 5

  
6 6
/** @file scheduler_ha.h
7 7

  
8
  Scheduling functions for chunk and peer selection.
8
  @brief Scheduling functions for chunk and peer selection.
9 9

  
10 10
  The chunk & peer scheduler (or simply ``scheduler'') is
11 11
  responsible for selecting a list of peer-chunk pairs whenever chunks or trade
include/scheduler_la.h
4 4
#include "scheduler_common.h"
5 5

  
6 6
/** @file scheduler_la.h
7
  Low level scheduling functions for chunk and peer selection. 
7
  @brief Low level scheduling functions for chunk and peer selection.
8 8

  
9 9
  The interface contains highly customizable selector functions. Customization is supported along the following concepts:
10 10
	-# evaluator functions: selector functions can be parameterized by evaluator functions.
include/trade_msg_ha.h
1 1
/** @file trade_msg_ha.h
2 2
 *
3
 * Chunk Delivery API - Higher Abstraction
3
 * @brief Chunk Delivery API - Higher Abstraction
4 4
 *
5 5
 * The Chunk Delivery HA provides the primitives for effective chunks exchange with other peers. <br>
6 6
 * This is a part of the Data Exchange Protocol which provides high level abstraction for sending chunks to a target peers.
include/trade_msg_la.h
1 1
/** @file trade_msg_la.h
2 2
 *
3
 * Chunk Delivery API - Lower Abstraction
3
 * @brief Chunk Delivery API - Lower Abstraction
4 4
 *
5 5
 * The Chunk Delivery LA provides the primitives to encode the send operation of a Chunk to a target Peer and decode the Chunk reception from a Peer. The former returns a bit stream obteined by the encoding of the Chunk to send, it is the packet that will be sent. The latter decode a packet received, the bit stream, in the corresponding Chunk.
6 6
 *
include/trade_sig_la.h
1 1
/** @file trade_sig_la.h
2 2
 *
3
 * Chunk Signaling  API - Lower Abstraction
3
 * @brief Chunk Signaling  API - Lower Abstraction
4 4
 *
5 5
 * The Chunk Signaling LA provides a set of primitives which encode and decode the signaling messages for chunks' negotiation. The former encode the signaling message returning a bit stream which is essentially the packet that will be sent, while the latter decode the received packet returning the signaling message understandable by the protocol.
6 6
 *

Also available in: Unified diff