This document describes the Locator/ID Separation Protoco (LISP) Map-Versioning mechanism, which provides in-packet information about Endpoint-ID-to-Routing-Locator (EID-to-RLOC) mappings used to encapsulate LISP data packets. This approach is based on associating a version number to EID-to-RLOC mappings and transporting such a version number in the LISP-specific header of LISP-encapsulated packets. LISP Map-Versioning is particularly useful to inform communicating Ingress Tunnel Routers (ITRs) and Egress Tunnel Routers (ETRs) about modifications of the mappings used to encapsulate packets. The mechanism is optional and transparent to implementations not supporting this feature, since in the LISP-specific header and in the Map Records, bits used for Map-Versioning can be safely ignored by ITRs and ETRs that do not support or do not want to use the mechanism. This document obsoletes RFC 6834, which is the initial experimental specifications of the mechanisms updated by this document. This document is a product of the Locator/ID Separation Protocol Working Group of the IETF. This is now a Proposed Standard.
@techreport{RFC9302,
number = {9302},
type = {RFC},
institution = {Internet Engineering Task Force},
publisher = {Internet Engineering Task Force},
url = {https://www.rfc-editor.org/info/rfc9302},
author = {Iannone, Luigi and Saucez, Damien and Bonaventure, Olivier},
title = {Locator/ID Separation Protocol (LISP) Map-Versioning},
pagetotal = {15},
year = {2022},
month = oct
}
This document presents a distributed mechanism to enforce strict delay bounds for some network flows in large scale networks. It leverages on the capacity of modern network devices to adapt their queue’s capacities to bound the maximum time spent by packets in those devices. It is using a reservation protocol to guarantee the availability of the resources in the devices’ queues to serve packets belonging to specific flows while enforcing an end-to-end delay constraint.
@techreport{draft-aft-detnet-bound-delay-queue-01,
number = {draft-aft-detnet-bound-delay-queue-01},
type = {Internet-Draft},
institution = {Internet Engineering Task Force},
publisher = {Internet Engineering Task Force},
note = {Work in Progress},
url = {https://datatracker.ietf.org/doc/draft-aft-detnet-bound-delay-queue/},
author = {Fressancourt, Antoine},
title = {Enforcing end-to-end delay bounds via queue resizing},
pagetotal = {19},
year = {2023},
month = nov,
day = {07}
}
This document specifies a mechanism enabling a node to request the allocation of an address or a prefix from neighbor routers. Such mechanism allows to algorithmically assign addresses and prefixes to nodes in a 6LowPAN deployment.
@techreport{draft-iannone-6lo-nd-gaao-01,
number = {draft-iannone-6lo-nd-gaao-01},
type = {Internet-Draft},
institution = {Internet Engineering Task Force},
publisher = {Internet Engineering Task Force},
note = {Work in Progress},
url = {https://datatracker.ietf.org/doc/draft-iannone-6lo-nd-gaao/},
author = {Luigi Iannone, Zhe Lou},
title = {Generic Address Assignment Option for 6LowPAN Neighbor Discovery},
pagetotal = {12},
year = {2023},
month = oct,
day = {23}
}
The Internet Protocol (IP) has been the major technological success in information technology of the last half century. As the Internet becomes pervasive, IP has been replacing communication technology for many domain-specific solutions, but it also has been extended to better fit the specificities of the different use cases. For Internet addressing in particular, as it is defined in RFC 791 for IPv4 and RFC 8200 for IPv6, respectively, there exist many extensions. Those extensions have been developed to evolve the addressing capabilities beyond the basic properties of Internet addressing. This document discusses the properties the IP addressing model, showcasing the continuing need to extend it and the methods
used for doing so.
@techreport{draft-iannone-ip-addressing-considerations-02,
number = {draft-iannone-ip-addressing-considerations-02},
type = {Internet-Draft},
institution = {Internet Engineering Task Force},
publisher = {Internet Engineering Task Force},
note = {Work in Progress},
url = {https://datatracker.ietf.org/doc/draft-iannone-ip-addressing-considerations/},
author = {Iannone, Luigi},
title = {IP Addressing Considerations},
pagetotal = {74},
year = {2023},
month = oct,
day = {23}
}
This document specifies a topological addressing scheme, Path-Aware Semantic Addressing (PASA), that enables IP packet stateless forwarding. No routing table needs to be built, rather, the forwarding decisionis based solely on the destination address structure. This document focuses on carrying IP packets across an LLN (Low power and Lossy Network), in which the topology is static, the location of the nodes is fixed, and the connection between the nodes is also rather stable. This specifications describes the PASA architecture, along with PASA address allocation, forwarding mechanism, header format design, and IPv6 interconnection support.
@techreport{draft-li-6lo-path-aware-semantic-addressing-03,
number = {draft-li-6lo-path-aware-semantic-addressing-03},
type = {Internet-Draft},
institution = {Internet Engineering Task Force},
publisher = {Internet Engineering Task Force},
note = {Work in Progress},
url = {https://datatracker.ietf.org/doc/draft-li-6lo-path-aware-semantic-addressing/},
author = {Li, Guangpeng and Lou, Zhe and Iannone, Luigi and Liu, Peng and Long, Rong and Makhijani, Kiran and Thubert, Pascal},
title = {Path-Aware Semantic Addressing (PASA) for Low power and Lossy Networks},
pagetotal = {35},
year = {2023},
month = oct,
day = {23}
}
This memo introduces "Signaling In-Network Computing operations"(SINC), a mechanism to enable signaling in-network computing operations on data packets in specific scenarios like NetReduce, NetDistributedLock, NetSequencer, etc. In particular, this solution allows to flexibly communicate computational parameters, to be used in conjunction with the payload, to in-network SINC-enabled devices in order to perform computing operations.
@techreport{draft-lou-rtgwg-sinc-01,
number = {draft-lou-rtgwg-sinc-01},
type = {Internet-Draft},
institution = {Internet Engineering Task Force},
publisher = {Internet Engineering Task Force},
note = {Work in Progress},
url = {https://datatracker.ietf.org/doc/draft-lou-rtgwg-sinc/},
author = {Lou, Zhe and Iannone, Luigi and Zhou, Yujing and Zhangcuimin and Yao, Kehan},
title = {Signaling In-Network Computing operations (SINC)},
pagetotal = {17},
year = {2023},
month = sep,
day = {15}
}
Path-Aware Semantic Address (PASA) [I-D.li-6lo-path-aware-semantic-addressing]), proposes to algorithmically assign addresses to nodes in a 6lo environment so to achieve stateless forwarding, hence, allowing to avoid using a routing protocol. PASA is more suitable for stable and static wireline connectivity, in order to avoid renumbering due to topology changes. Even in such kind of scenarios, reliability remains a concern. This memo tackles specifically reliability in PASA deployments, analyzing possible broad solution categories to solve the issue.
@techreport{draft-li-pasa-reliability-02,
number = {draft-li-6lo-pasa-reliability-02},
type = {Internet-Draft},
institution = {Internet Engineering Task Force},
publisher = {Internet Engineering Task Force},
note = {Work in Progress},
url = {https://datatracker.ietf.org/doc/draft-li-nsa-reliability/},
author = {Li, Guangpeng and Lou, Zhe and Iannone, Luigi},
title = {Reliability Considerations of Path-Aware Semantic Addressing},
pagetotal = {25},
year = {2023},
month = sep,
day = {08}
}
This memo describes an approach to updating topologies in typical MANET-like environments, relying on what is termed ’sloppy updates’ in the remainder of this document. Key to the approach is that updates are only initiated if existing communication relations may be effect by non-synchronized topology information, otherwise using the topology information as it exists. This ’sloppy’ nature of the approach reduces the needed updates and the associated communication for them, thus increases efficiency as well as performance from a user perspective. As such, STURP does not provide a complete routing protocol solution but is intended to extend existing routing protocols with this improved efficiency mechanism instead.
@techreport{draft-lou-manet-sturp-00,
number = {draft-lou-manet-sturp-00},
type = {Internet-Draft},
institution = {Internet Engineering Task Force},
publisher = {Internet Engineering Task Force},
note = {Work in Progress},
url = {https://datatracker.ietf.org/doc/draft-lou-manet-sturp/},
author = {Lou, Zhe and Iannone, Luigi and Trossen, Dirk and Shi, Zhaochen},
title = {Sloppy Topology Updates for ad-hoc Routing Protocols (STURP)},
pagetotal = {17},
year = {2023},
month = jun,
day = {30}
}
This document is intended to discuss some deployment aspects of "Signaling In-Network Computing operations" (SINC). Based on some examples, this document analyzes how each device in the SINC chain undertakes its own functions. This document showcase the use of SINC mechanism.
@techreport{draft-lou-rtgwg-sinc-deployment-considerations-00,
number = {draft-lou-rtgwg-sinc-deployment-considerations-00},
type = {Internet-Draft},
institution = {Internet Engineering Task Force},
publisher = {Internet Engineering Task Force},
note = {Work in Progress},
url = {https://datatracker.ietf.org/doc/draft-lou-rtgwg-sinc-deployment-considerations/},
author = {Lou, Zhe and Iannone, Luigi and Zhou, Yujing and Zhangcuimin},
title = {Signaling In-Network Computing operations (SINC) deployment considerations},
pagetotal = {11},
year = {2023},
month = jun,
day = {07}
}
Expired/Replaced Drafts
Iannone, Luigi and Trossen, Dirk and Shenoy, Nirmala and Mendes, Paulo and 3rd, Donald E. Eastlake and Liu, Peng and Farinacci, Dino and Finkhaeuser, Jens and Jia, Yihao, Challenging Scenarios and Problems in Internet Addressing,
draft-iannone-scenarios-problems-addressing-00
sep,
2022.
REPLACED by: https://datatracker.ietf.org/doc/draft-iannone-ip-addressing-considerations/
The Internet Protocol (IP) has been the major technological success in information technology of the last half century. As the Internet becomes pervasive, IP has been replacing communication technology for many domain-specific solutions. However, domains with specific requirements as well as communication behaviors and semantics still exist and represent what [RFC8799] recognizes as "limited domains". This document describes well-recognized scenarios that showcase possibly different addressing requirements, which are challenging to be accommodated in the IP addressing model. These scenarios highlight issues related to the Internet addressing model and call for starting a discussion on a way to re-think/evolve the addressing model so to better accommodate different domain-specific requirements. The limitations identified in this document are complemented and deepened by a detailed analysis in a separate companion document [I-D.iannone-internet-addressing-considerations].
@techreport{draft-iannone-scenarios-problems-addressing-00,
number = {draft-iannone-scenarios-problems-addressing-00},
type = {Internet-Draft},
institution = {Internet Engineering Task Force},
publisher = {Internet Engineering Task Force},
note = {REPLACED by: https://datatracker.ietf.org/doc/draft-iannone-ip-addressing-considerations/ },
url = {https://datatracker.ietf.org/doc/draft-iannone-scenarios-problems-addressing/},
author = {Iannone, Luigi and Trossen, Dirk and Shenoy, Nirmala and Mendes, Paulo and 3rd, Donald E. Eastlake and Liu, Peng and Farinacci, Dino and Finkhaeuser, Jens and Jia, Yihao},
title = {Challenging Scenarios and Problems in Internet Addressing},
pagetotal = {38},
year = {2022},
month = sep,
day = {05}
}
Finkel, Matthew and Lassey, Bradford and Iannone, Luigi and Chen, Brad, IP Address Privacy Considerations,
draft-irtf-pearg-ip-address-privacy-considerations-01
oct,
2022.
EXPIRED
This document provides an overview of privacy considerations related to user IP addresses. It includes an analysis of some current use cases for tracking of user IP addresses, mainly in the context of anti-abuse. It discusses the privacy issues associated with such tracking and provides input on mechanisms to improve the privacy of this existing model. It then captures requirements for proposed ’replacement signals’ for IP addresses from this analysis. In addition, existing and under-development techniques are evaluated for fulfilling these requirements.
@techreport{draft-irtf-pearg-ip-address-privacy-considerations-01,
number = {draft-irtf-pearg-ip-address-privacy-considerations-01},
type = {Internet-Draft},
institution = {Internet Research Task Force},
publisher = {Internet Research Task Force},
note = {EXPIRED},
url = {https://datatracker.ietf.org/doc/draft-irtf-pearg-ip-address-privacy-considerations/},
author = {Finkel, Matthew and Lassey, Bradford and Iannone, Luigi and Chen, Brad},
title = {IP Address Privacy Considerations},
pagetotal = {17},
year = {2022},
month = oct,
day = {23}
}
Li, Yizhou and Iannone, Luigi and Trossen, Dirk and Liu, Peng and Li, Cheng, Dynamic-Anycast Architecture,
draft-li-dyncast-architecture-04
jul,
2022.
EXPIRED
This document describes a proposal for an architecture for the Dynamic-Anycast (Dyncast). It includes an architecture overview, main components that shall exist, and the workflow. An example of workflow is provided, focusing on the load-balance multi-edge based service use-case, where load is distributed in terms of both computing and networking resources through the dynamic anycast architecture.
@techreport{draft-li-dyncast-architecture-04,
number = {draft-li-dyncast-architecture-04},
type = {Internet-Draft},
institution = {Internet Engineering Task Force},
publisher = {Internet Engineering Task Force},
note = {EXPIRED},
url = {https://datatracker.ietf.org/doc/draft-li-dyncast-architecture/},
author = {Li, Yizhou and Iannone, Luigi and Trossen, Dirk and Liu, Peng and Li, Cheng},
title = {Dynamic-Anycast Architecture},
pagetotal = {13},
year = {2022},
month = jul,
day = {04}
}
Lou, Zhe and Iannone, Luigi and Zhou, Yujing and Zhangcuimin, Signaling In-Network Computing operations (SINC),
draft-zhou-sfc-sinc-00
oct,
2022.
REPLACED by: https://datatracker.ietf.org/doc/draft-lou-rtgwg-sinc/
This memo introduces "Signaling In-Network Computing operations" (SINC), a mechanism to enable in-packet operation signaling for in-network computing for specific scenarios like NetReduce, NetDistributedLock, NetSequencer, etc. In particular, this solution allows to flexibly communicate computation parameters to be used in conjunction with the packets’ payload, to signal to in-network SINC-enabled devices the computing operations to be performed.
@techreport{draft-zhou-sfc-sinc-00,
number = {draft-zhou-sfc-sinc-00},
type = {Internet-Draft},
institution = {Internet Engineering Task Force},
publisher = {Internet Engineering Task Force},
note = {REPLACED by: https://datatracker.ietf.org/doc/draft-lou-rtgwg-sinc/},
url = {https://datatracker.ietf.org/doc/draft-zhou-sfc-sinc/},
author = {Lou, Zhe and Iannone, Luigi and Zhou, Yujing and Zhangcuimin},
title = {Signaling In-Network Computing operations (SINC)},
pagetotal = {19},
year = {2022},
month = oct,
day = {23}
}
Despite the stability of the Internet technology, tremendous advances and important innovation are always happening. In particular routing and addressing have profoundly changed during the years, with interesting research still ongoing and engineers willing to be hear about recent advance that may solve their operational problems. However, researchers and engineers lack a dedicated forum where they can meet and interact to discuss about routing and addressing. This document advocates the creation of such forum, to bring together these communities (researchers and engineers) and offer a dedicated venue.
@techreport{draft-iannone-routing-and-addressing-manifesto-02,
number = {draft-iannone-routing-and-addressing-manifesto-02},
type = {Internet-Draft},
institution = {Internet Engineering Task Force},
publisher = {Internet Engineering Task Force},
note = {EXPIRED},
url = {https://datatracker.ietf.org/doc/draft-iannone-routing-and-addressing-manifesto/},
author = {Iannone, Luigi},
title = {Innovation in Internet Routing and Addressing},
pagetotal = {22},
year = {2022},
month = oct,
day = {24}
}
Finkel, Matthew and Lassey, Bradford and Iannone, Luigi and Chen, Brad, IP Address Privacy Considerations,
draft-ip-address-privacy-considerations-03
jan,
2022.
REPLACED by: https://datatracker.ietf.org/doc/draft-irtf-pearg-ip-address-privacy-considerations/
This document provides an overview of privacy considerations related to user IP addresses. It includes an analysis of some current use cases for tracking of user IP addresses, mainly in the context of anti-abuse. It discusses the privacy issues associated with such tracking and provides input on mechanisms to improve the privacy of this existing model. It then captures requirements for proposed ’replacement signals’ for IP addresses from this analysis. In addition, existing and under-development techniques are evaluated for fulfilling these requirements.
@techreport{draft-ip-address-privacy-considerations-03,
number = {draft-ip-address-privacy-considerations-03},
type = {Internet-Draft},
institution = {Internet Engineering Task Force},
publisher = {Internet Engineering Task Force},
note = {REPLACED by: https://datatracker.ietf.org/doc/draft-irtf-pearg-ip-address-privacy-considerations/},
url = {https://datatracker.ietf.org/doc/draft-ip-address-privacy-considerations/},
author = {Finkel, Matthew and Lassey, Bradford and Iannone, Luigi and Chen, Brad},
title = {IP Address Privacy Considerations},
pagetotal = {17},
year = {2022},
month = jan,
day = {10}
}
Jia, Yihao and Trossen, Dirk and Iannone, Luigi and Mendes, Paulo and Shenoy, Nirmala and Toutain, Laurent and Chen, Abraham and Farinacci, Dino, Gap Analysis in Internet Addressing,
draft-jia-intarea-internet-addressing-gap-analysis-02
mar,
2022.
REPLACED by: https://datatracker.ietf.org/doc/draft-iannone-internet-addressing-considerations/
There exist many extensions to Internet addressing, as it is defined in [RFC0791] for IPv4 and [RFC8200] for IPv6, respectively. Those extensions have been developed to fill gaps in capabilities beyond the basic properties of Internet addressing. This document outlines those properties as a baseline against which the extensions are categorized in terms of methodology used to fill the gap together with examples of solutions doing so.
While introducing such extensions, we outline the issues we see with those extensions. This ultimately leads to consider whether or not a more consistent approach to tackling the identified gaps, beyond point-wise extensions as done so far, would be beneficial. The benefits are the ones detailed in the companion document [I-D.jia-intarea-scenarios-problems-addressing], where, leveraging on the gaps identified in this memo and scenarios provided in [I-D.jia-intarea-scenarios-problems-addressing], a clear problem statement is provided.
@techreport{draft-jia-intarea-internet-addressing-gap-analysis-02,
number = {draft-jia-intarea-internet-addressing-gap-analysis-02},
type = {Internet-Draft},
institution = {Internet Engineering Task Force},
publisher = {Internet Engineering Task Force},
note = {REPLACED by: https://datatracker.ietf.org/doc/draft-iannone-internet-addressing-considerations/},
url = {https://datatracker.ietf.org/doc/draft-jia-intarea-internet-addressing-gap-analysis/},
author = {Jia, Yihao and Trossen, Dirk and Iannone, Luigi and Mendes, Paulo and Shenoy, Nirmala and Toutain, Laurent and Chen, Abraham and Farinacci, Dino},
title = {Gap Analysis in Internet Addressing},
pagetotal = {17},
year = {2022},
month = mar,
day = {6}
}
Jia, Yihao and Trossen, Dirk and Iannone, Luigi and Shenoy, Nirmala and Mendes, Paulo and 3rd, Donald E. Eastlake and Liu, Peng and Farinacci, Dino, Challenging Scenarios and Problems in Internet Addressing,
draft-jia-intarea-scenarios-problems-addressing-03
mar,
2022.
REPLACED by: https://datatracker.ietf.org/doc/draft-iannone-scenarios-problems-addressing/
The Internet Protocol (IP) has been the major technological success in information technology of the last half century. As the Internet becomes pervasive, IP has been replacing communication technology for many domain-specific solutions. However, domains with specific requirements as well as communication behaviors and semantics still exist and represent what [RFC8799] recognizes as "limited domains".
This document describes well-recognized scenarios that showcase possibly different addressing requirements, which are challenging to be accommodated in the IP addressing model. These scenarios highlight issues related to the Internet addressing model and call for starting a discussion on a way to re-think/evolve the addressing model so to better accommodate different domain-specific requirements.
The issues identified in this document are complemented and deepened by a detailed gap analysis in a separate companion document [I-D.jia-intarea-internet-addressing-gap-analysis].
@techreport{draft-jia-intarea-scenarios-problems-addressing-03,
number = {draft-jia-intarea-scenarios-problems-addressing-03},
type = {Internet-Draft},
institution = {Internet Engineering Task Force},
publisher = {Internet Engineering Task Force},
note = {REPLACED by: https://datatracker.ietf.org/doc/draft-iannone-scenarios-problems-addressing/},
url = {https://datatracker.ietf.org/doc/draft-jia-intarea-scenarios-problems-addressing/},
author = {Jia, Yihao and Trossen, Dirk and Iannone, Luigi and Shenoy, Nirmala and Mendes, Paulo and 3rd, Donald E. Eastlake and Liu, Peng and Farinacci, Dino},
title = {Challenging Scenarios and Problems in Internet Addressing},
pagetotal = {35},
year = {2022},
month = mar,
day = {6}
}
Li, Guangpeng and Lou, Zhe and Iannone, Luigi and Liu, Peng and Long, Rong, Native Short Addressing for Low power and Lossy Networks Expansion,
draft-li-6lo-native-short-address-03
jun,
2022.
REPLACED by: https://datatracker.ietf.org/doc/draft-li-6lo-path-aware-semantic-addressing/
This document specifies a topological addressing scheme, Native Short Address (NSA) that enables IP packet transmission over links where the transmission of a full length address may not be desirable. This document focuses on carrying IP packets across an LLN (Low power and Lossy Network), in which the topology is relatively static where nodes’ location is fixed and the connection between nodes is rather stable. The changes in the logical topology are only caused by non-frequent disconnection in the link. The specifications details the NSA architecture, address allocation, forwarding mechanism, header format design, including length-variable fields, and IPv6 interconnection support.
@techreport{draft-li-6lo-native-short-address-03,
number = {draft-li-6lo-native-short-address-03},
type = {Internet-Draft},
institution = {Internet Engineering Task Force},
publisher = {Internet Engineering Task Force},
note = {REPLACED by: https://datatracker.ietf.org/doc/draft-li-6lo-path-aware-semantic-addressing/},
url = {https://datatracker.ietf.org/doc/draft-li-6lo-native-short-address/},
author = {Li, Guangpeng and Lou, Zhe and Iannone, Luigi and Liu, Peng and Long, Rong},
title = {Native Short Addressing for Low power and Lossy Networks Expansion},
pagetotal = {26},
year = {2022},
month = jun,
day = {1}
}
Native Short Address (NSA [I-D.li-6lo-native-short-address])proposes to algorithmically assign short addresses to nodes in a 6lo environment so to achieve stateless forwarding, hence, avoiding using a routing protocol. NSA is more suitable in case of stable and static wireline connectivity, in order to avoid renumbering due to topology changes. Even in such kind of scenarios, reliability remains an issue. This memo tackles specifically reliability in NSA deployments, analyzing possible broad solution categories to solve the issue.
@techreport{draft-li-nsa-reliability-00,
number = {draft-li-nsa-reliability-00},
type = {Internet-Draft},
institution = {Internet Engineering Task Force},
publisher = {Internet Engineering Task Force},
note = {REPLACED by: https://datatracker.ietf.org/doc/draft-li-nsa-reliability/},
url = {https://datatracker.ietf.org/doc/draft-li-nsa-reliability/},
author = {Li, Guangpeng and Lou, Zhe and Iannone, Luigi},
title = {Reliability Considerations of Native Short Addressing},
pagetotal = {25},
year = {2022},
month = may,
day = {31}
}