Pending Interest Table (PIT) More...

#include "ndn/common.hpp"
#include "ndn/interest.hpp"
#include "ndn/name.hpp"
#include <functional>

Classes
class	ndn::PitEntry
	PIT entry. More...

class	ndn::Pit
	Pending Interest Table. More...

struct	ndn::Pit::Stats
	PIT statistics. More...

Enumerations
enum class	ndn::PitInsertResult : uint8_t { New , Aggregated , Duplicate , Full }
	PIT insertion result. More...

Variables
constexpr size_t	ndn::PIT_MAX_ENTRIES = 50
	Maximum number of PIT entries.

constexpr size_t	ndn::PIT_MAX_FACES_PER_ENTRY = 5
	Maximum number of Faces per PIT entry.

Detailed Description

Pending Interest Table (PIT)

The PIT is a table used by the forwarder to track received Interests. When the same Name Interest is received from multiple Faces, they are aggregated into a single entry.

See also: https://named-data.net/doc/NDN-packet-spec/current/

Definition in file pit.hpp.

Enumeration Type Documentation

◆ PitInsertResult

enum class ndn::PitInsertResult : uint8_t

strong

PIT insertion result.

An enum representing the result of an Interest insertion.

Enumerator
New	New entry created.
Aggregated	Face added to existing entry (aggregation)
Duplicate	Same nonce detected (loop)
Full	Table is full.

Definition at line 32 of file pit.hpp.

Variable Documentation

◆ PIT_MAX_ENTRIES

constexpr size_t ndn::PIT_MAX_ENTRIES = 50

constexpr

Maximum number of PIT entries.

Definition at line 22 of file pit.hpp.

Referenced by ndn::Pit::capacity().

◆ PIT_MAX_FACES_PER_ENTRY

constexpr size_t ndn::PIT_MAX_FACES_PER_ENTRY = 5

constexpr

Maximum number of Faces per PIT entry.

Definition at line 25 of file pit.hpp.

Referenced by ndn::PitEntry::addFace().

Classes