Internet DRAFT - draft-du-coordination-of-networks-in-ccn

draft-du-coordination-of-networks-in-ccn







Network Working Group                                              Z. Du
Internet-Draft                                              China Mobile
Intended status: Informational                           17 January 2023
Expires: 21 July 2023


         Coordination of Networks in Computing Centric Network
              draft-du-coordination-of-networks-in-ccn-00

Abstract

   This document describes a coordinatable mechanism for the networks
   that each contains a service node in the Computing Centric Network
   (CCN).  The CCN stands for an overlay network or called a network
   federation that focuses on the computing service providing.  In CCN,
   many service nodes in different networks can join in or leave the
   federation dynamically.


Requirements Language

   The key words "MUST", "MUST NOT", "REQUIRED", "SHALL", "SHALL NOT",
   "SHOULD", "SHOULD NOT", "RECOMMENDED", "MAY", and "OPTIONAL" in this
   document are to be interpreted as described in RFC 2119 [RFC2119].

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."

   This Internet-Draft will expire on 21 July 2023.

Copyright Notice

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





Du                        Expires 21 July 2023                  [Page 1]

Internet-Draft       Coordination of Networks in CCN        January 2023


   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 Revised BSD License text as
   described in Section 4.e of the Trust Legal Provisions and are
   provided without warranty as described in the Revised BSD License.

Table of Contents

   1.  Introduction  . . . . . . . . . . . . . . . . . . . . . . . .   2
   2.  Problem Statement . . . . . . . . . . . . . . . . . . . . . .   2
   3.  A Preliminary Distributed Mechanism for CCN . . . . . . . . .   3
   4.  IANA Considerations . . . . . . . . . . . . . . . . . . . . .   4
   5.  Security Considerations . . . . . . . . . . . . . . . . . . .   4
   6.  Acknowledgements  . . . . . . . . . . . . . . . . . . . . . .   4
   7.  References  . . . . . . . . . . . . . . . . . . . . . . . . .   4
     7.1.  Normative References  . . . . . . . . . . . . . . . . . .   4
     7.2.  Informative References  . . . . . . . . . . . . . . . . .   4
   Author's Address  . . . . . . . . . . . . . . . . . . . . . . . .   4

1.  Introduction

   In the future, AI applications would become more popular, and service
   scheduling would become generalized, even providing a common invoking
   function interface.  At the same time, computing resource would be
   more ubiquitous, and clients can get access to a nearby computing
   node to obtain a faster service response speed.  In this situation,
   the coordination of networks is needed, so that computing nodes in
   different networks can flexibly communicate to each other and
   complete the client's computing service.

   In this document, we introduce a preliminary mechanism to coordinate
   different networks in the Computing Centric Network (CCN).

2.  Problem Statement

   The CCN in this document means an overlay network or called a
   federation that focuses on the computing service providing.  In CCN,
   many service nodes in different networks can join in or leave the
   federation dynamically.  Currently, we suggest a distributed way to
   manage the federation, and thus the coordination of the different
   service nodes is a key issue in CCN.







Du                        Expires 21 July 2023                  [Page 2]

Internet-Draft       Coordination of Networks in CCN        January 2023


   From the aspect of the client, it does not care where the service is,
   and the main concern is that the service could be completed in time.
   In CCN, we assume that the service can be provided either in the
   clouds or in the MECs.

   As an example, the federation can own a common anycast address.  The
   associated anycast address will allow clients to access a nearby
   network service node, however it may not be optimal.  For example, in
   the scenarios of CAN [I-D.liu-can-ps-usecases], the nearest node may
   be busy and can not complete the job quickly because the computing
   ability in an MEC is limited.  In this document, we suggest that it
   can send this request to other service nodes if it is busy, in order
   to do the service steering or load balancing.

   In this situation, the request packet of the client appears like a
   DNS query, and the network federation will return a proper service
   node to the client.


3.  A Preliminary Distributed Mechanism for CCN

   In this distributed system, each network service node needs to know
   the statuses of the surrounding service nodes, such as whether they
   can accept more client sessions for a specific service, so as to make
   a better offload.  In this way, each node maintains part of the
   information of the whole federation, but they can provide a
   resolution mechanism and return a computing node address for the
   client.  A general procedure is described as follows.

   Firstly, each computing node needs to know the information of some of
   the surrounding nodes.

   Secondly, after receiving the client's request, the computing node
   will decide whether to provide the service by itself or offload to
   other nodes according to its own status and the computing information
   of nearby service nodes.  The looking up of the proper service node
   could be recursive.

   Finally, a feedback is given to the client.

   As a conclusion, a computing node needs to store and update the
   computing statuses of neighboring computing nodes that are currently
   available for the service.  If necessary, it can select a proper
   neighbor node for offloading according to a certain policy.







Du                        Expires 21 July 2023                  [Page 3]

Internet-Draft       Coordination of Networks in CCN        January 2023


4.  IANA Considerations

   TBD.

5.  Security Considerations

   TBD.

6.  Acknowledgements

   TBD.

7.  References

7.1.  Normative References

   [RFC2119]  Bradner, S., "Key words for use in RFCs to Indicate
              Requirement Levels", BCP 14, RFC 2119,
              DOI 10.17487/RFC2119, March 1997,
              <https://www.rfc-editor.org/info/rfc2119>.

7.2.  Informative References

   [I-D.liu-can-ps-usecases]
              Liu, P., Eardley, P., Trossen, D., Boucadair, M.,
              Contreras, L. M., Li, C., and Y. Li, "Computing-Aware
              Networking (CAN) Problem Statement and Use Cases", Work in
              Progress, Internet-Draft, draft-liu-can-ps-usecases-00, 23
              October 2022, <https://www.ietf.org/archive/id/draft-liu-
              can-ps-usecases-00.txt>.

Author's Address

   Zongpeng Du
   China Mobile
   No.32 XuanWuMen West Street
   Beijing
   100053
   China
   Email: duzongpeng@foxmail.com











Du                        Expires 21 July 2023                  [Page 4]