In-band Network-Wide Telemetry
draft-tian-bupt-inwt-mechanism-policy-00

Document Type Active Internet-Draft (individual)
Last updated 2020-04-28
Stream (None)
Intended RFC status (None)
Formats plain text xml pdf htmlized (tools) htmlized bibtex
Stream Stream state (No stream defined)
Consensus Boilerplate Unknown
RFC Editor Note (None)
IESG IESG state I-D Exists
Telechat date
Responsible AD (None)
Send notices to (None)
BUPT                                                              T. Pan
Internet-Draft                                                    M. Gao
Intended status: Informational                                   E. Song
Expires: October 30, 2020                                        Z. Bian
                                                                  X. Lin
                      Beijing University of Posts and Telecommunications
                                                          April 28, 2020

                     In-band Network-Wide Telemetry
                draft-tian-bupt-inwt-mechanism-policy-00

Abstract

   This document describes INT-path, a cost-effective network-wide
   telemetry framework based on INT(In-band Network Telemetry), by
   decoupling the network monitoring system into a routing mechanism and
   a routing path generation policy.  INT-path embed SR(Source Routing)
   into INT probes to allow specifying the route that the probe packet
   takes through the network.  Above this probing path control
   mechanism, an Euler trail-based path planning policy is developed to
   generate non-overlapped INT paths that cover the entire network with
   a minimum path member, reducing the overall telemetry overhead.  INT-
   path is very suitable for deployment in data center networks thanks
   to their symmetric topologies.

Requirements Language

   The key words "MUST", "MUST NOT", "REQUIRED", "SHALL", "SHALL NOT",
   "SHOULD", "SHOULD NOT", "RECOMMENDED", "NOT RECOMMENDED", "MAY", and
   "OPTIONAL" in this document are to be interpreted as described in BCP
   14 [RFC2119][RFC8174] when, and only when, they appear in all
   capitals, as shown here.

Status of This Memo

   This Internet-Draft is submitted in full conformance with the
   provisions of BCP 78 and BCP 79.

   Internet-Drafts are working documents of the Internet Engineering
   Task Force (IETF).  Note that other groups may also distribute
   working documents as Internet-Drafts.  The list of current Internet-
   Drafts is at https://datatracker.ietf.org/drafts/current/.

   Internet-Drafts are draft documents valid for a maximum of six months
   and may be updated, replaced, or obsoleted by other documents at any
   time.  It is inappropriate to use Internet-Drafts as reference
   material or to cite them other than as "work in progress."

Pan, et al.             Expires October 30, 2020                [Page 1]
Internet-Draft       In-band Network-Wide Telemetry           April 2020

   This Internet-Draft will expire on October 30, 2020.

Copyright Notice

   Copyright (c) 2020 IETF Trust and the persons identified as the
   document authors.  All rights reserved.

   This document is subject to BCP 78 and the IETF Trust's Legal
   Provisions Relating to IETF Documents
   (https://trustee.ietf.org/license-info) in effect on the date of
   publication of this document.  Please review these documents
   carefully, as they describe your rights and restrictions with respect
   to this document.  Code Components extracted from this document must
   include Simplified BSD License text as described in Section 4.e of
   the Trust Legal Provisions and are provided without warranty as
   described in the Simplified BSD License.

Table of Contents

   1.  Introduction  . . . . . . . . . . . . . . . . . . . . . . . .   2
   2.  Problem Statement . . . . . . . . . . . . . . . . . . . . . .   4
   3.  Source Routing-based Path Monitoring (Mechanism)  . . . . . .   4
     3.1.  Packet Header Format  . . . . . . . . . . . . . . . . . .   5
     3.2.  Forwarding Behaviors  . . . . . . . . . . . . . . . . . .   6
   4.  DFS-based path planning algorithm . . . . . . . . . . . . . .   8
     4.1.  Algorithm Outline . . . . . . . . . . . . . . . . . . . .   8
     4.2.  Example . . . . . . . . . . . . . . . . . . . . . . . . .   9
   5.  Euler trail-based path planning algorithm . . . . . . . . . .  10
     5.1.  Algorithm Outline . . . . . . . . . . . . . . . . . . . .  10
     5.2.  Example . . . . . . . . . . . . . . . . . . . . . . . . .  12
   6.  IANA Considerations . . . . . . . . . . . . . . . . . . . . .  13
   7.  Security Considerations . . . . . . . . . . . . . . . . . . .  14
   8.  References  . . . . . . . . . . . . . . . . . . . . . . . . .  14
     8.1.  Normative References  . . . . . . . . . . . . . . . . . .  14
     8.2.  Informative References  . . . . . . . . . . . . . . . . .  14
   Authors' Addresses  . . . . . . . . . . . . . . . . . . . . . . .  14

1.  Introduction

   At present, conducting fine-grained, network-wide traffic monitoring
   plays an increasingly significant role in maintaining large-scale
   computer networks.  It enables fine-grained network-wide visibility
   to ease the fast detection and localization of network gray failures.
   It also improves the network traffic load balancing with the prior
   knowledge of link congestion.  The network-wide traffic monitoring
   can be well applied to all types of networks, especially data center
Show full document text