Abstract: This application provides a forwarding path determining method and an apparatus. In determining a forwarding path, a second network device sends a routing update message to a first network device, where the routing update message carries a first identifier list, the first identifier list includes a binding segment identifier, and the first identifier list indicates a first forwarding path that is from the second network device to a third network device. By using the method, a second forwarding path from the first network device to the third network device is determined. According to the method provided in this application, when there is no controller or controllers cannot communicate with each other, routing advertisement of the binding end identifier is implemented, to determine a forwarding path. This helps simplify a packet forwarding control process.

Abstract: A binding segment identifier processing method and a device are provided. The method includes a network device receives a message sent by a controller, where the message includes type information and a segment identifier, and the type information indicates that the segment identifier is a binding segment identifier BSID. The network device performs a processing action on the BSID based on the type information. According to embodiments of this application, the network device can identify the BSID, to resolve a technical problem that an incorrect processing result is caused when a segment identifier list of the network device includes the BSID.

Abstract: An example method for dynamic packet routing using prioritized groups includes: receiving, by a processing device, routing information specifying a plurality of paths to a network destination, wherein each path is associated with a respective cost metric value; associating a first subset of the plurality of paths with a first priority routing group for the network destination, wherein each path of the first subset satisfies a first cost criterion based on a cost metric value of the path; associating a second subset of the plurality of paths with a second priority routing group for the network destination, wherein each path of the second subset satisfies a second cost criterion; and storing, in a forwarding information data structure, a first definition of the first priority routing group and a second definition of a second priority routing group.

Abstract: Systems, methods, and computer-readable media are disclosed for characterizing data flows within an in-band telemetry (INT) domain. First aggregated statistical data regarding a flow of INT packets is periodically received from a first aggregating network device. The flow of INT packets flows from an initiator network device via one or more transit network devices to a terminator network device. Second aggregated statistical data regarding the flow of INT packets is periodically received from a second aggregating network device. In response to comparing the first aggregated statistical data and the second aggregated statistical data, one or more dropped INT packets may be implicitly identified. Based on the one or more dropped INT packets in the flow of INT packets, a dropped INT packet notification may be provided.

Abstract: Some embodiments of the invention provide a method of sending data messages from an edge router at a first location of an enterprise network to a SaaS (software as a service) application server provided by a third-party at a second location. The method receives, from a DNS (domain name system) first server, a resolution for a particular destination network address for the SaaS application server at the second location. From a second server, the method obtains an identifier for a first cloud gateway from multiple cloud gateways at multiple locations through which the particular destination address for the SaaS application server can be reached, the first cloud gateway farther from the first location than a second cloud gateway in the multiple cloud gateways but closer to the second location than the second cloud gateway. The method uses an optimized SD-WAN connection to the first cloud gateway to forward data messages for the first cloud gateway to the SaaS application at the second location.

Abstract: A system and method for disconnection tolerant network routing, termed Binary State Distance Vector Routing (BSDVR). BSDVR provides for unicast routing on partitioned networks by introducing binary state information for distance vector (DV) entries to compute unicast paths. In the presence of network partitions, BSDVR effectively avoids the count-to-infinity problem and operates with control overhead less than traditional DV routing by an order of magnitude, leading to much better convergence times for failures.

Abstract: A system and method for selecting a client gateway device to establish a path between client devices is provided. A method includes associating a first client gateway device of a first geographic region and a second client gateway device of a second geographic region with a first communication endpoint of a first client device, and associating a third client gateway device with a second client device, wherein the third client gateway device is a gateway of the first geographic region. The method also includes receiving a communication invitation directed to the first communication endpoint from the second client device via the third client gateway device, and responsive to receiving the communication invitation, selecting one of the first client gateway device or the second client gateway device. The method further includes establishing a communication path between the second client device and the first client device via the selected client gateway device and the third client gateway device.

Abstract: A method performed by a first node. The first node operates in a communications network. The first node determines, based on a header of a packet, a first number of hops. The first number of hops are the hops the packet has to traverse in the communications network to reach a second node in the communications network. The header of the packet indicates a second number of hops between the second node and a third node in the communications network in a first path. The first node obtains a wired backhaul connection to a core network of the communications network from the third node. The first node then initiates routing the packet towards the second node based on the determined first number of hops.

Abstract: This application discloses a multi-hop transmission method and an apparatus, which are applicable to fields such as V2X, internet of vehicles, intelligent connected vehicles, assisted driving, and intelligent driving, to resolve a problem that a multi-hop transmission latency is large in a conventional technology. In example embodiments, terminal devices participating in multi-hop transmission may share a shared resource pool. A first terminal device and a second terminal device participating in the multi-hop transmission are used as an example. The multi-hop transmission method includes: sending, by the first terminal device, data to the second terminal device on a first resource in the shared resource pool; and if the first terminal device fails to send the data on the first resource, retransmitting, by the first terminal device, the data to the second terminal device on a second resource in the shared resource pool.

Abstract: Techniques for detecting path failures and reducing packet loss as a result of such failures are described for use within a data center or other environment. For example, a source and/or destination access node may create and/or maintain information about health and/or connectivity for a plurality of ports or paths between the source and destination device and core switches. The source access node may spray packets over a number of paths between the source access node and the destination access node. The source access node may use the information about connectivity for the paths between the source or destination access nodes and the core switches to limit the paths over which packets are sprayed. The source access node may spray packets over paths between the source access node and the destination access node that are identified as healthy, while avoiding paths that have been identified as failed.

Abstract: A packet processing method includes determining, by a node in a first network, a transmission path for a packet, where the transmission path includes a path in the first network and a path traversing a second network; adding, by the node, path information to the packet based on the transmission path, where the path information includes traversal indication information, and the traversal indication information indicates an ingress node in the second network to encapsulate and transmit the packet based on an egress node that is specified in the traversal indication information and that is located in the second network; and sending, by the node to the ingress node in the second network through the first network, the packet to which the traversal indication information is added.

Abstract: Embodiments of this application disclose a path fault detection method and apparatus, a related device, and a storage medium, and belong to the field of communication technologies. In embodiments of this application, a return path is determined according to a forward path. In a path fault detection process, the return path through which a fault detection packet fed back by a tail node to a head node passes includes the forward path. In this way, if the head node receives the fault detection packet fed back by the tail node, it indicates that the forward path is not faulty.

Abstract: Provided herein are systems and methods for managing redistribution and remapping of multicast services between networks in a multi-area network. Multicast streams can be sent through networks from a source node towards a boundary node. The boundary node can receive the multicast stream, remap a source node identifier and service instance identifier, and forward the multicast stream into a second network. The boundary node can receive a route for the multicast stream. The route can be installed in a link-state database and can be used to send the multicast stream through the multi-area network from the source node to a destination node.

Abstract: A first router generates session establishment metrics for use in network path selection. For example, a plurality of routers connect a client device to a network service instance hosted by a server. A first router is connected to the network service instance via first and second paths. The first router receives session performance requirements for a session between the client device and the network service instance. The first router forwards, along the first path, network traffic for the session by modifying a first packet of the session to include a session identifier for the session. The first router determines that session establishment metrics for the session do not satisfy the session performance requirements. In response, the first router forwards, along the second path, the network traffic for the session by modifying a second packet of the session to include the session identifier for the session.

Abstract: A method allowing execution of transmission functions hosted in intermediate pieces of equipment of a path established between two pieces of communication equipment. End-to-end encryption systems are designed to resist any surveillance or tampering attempt, as no third party can decrypt or modify the communicated data. There is a solution which, depending on the connection opening requests of the applications, allows to select and assemble the transport protocols necessary for the operation of the application. However, this method is local: this protocol stack is only assembled at the pieces of communication equipment constituting the ends of the connections. Consequently, the requests emitted by these applications are not transmitted to the intermediate pieces of equipment which host the desired functions.

Abstract: A disclosed computing device capable of instantly switching over between routing engines may include (1) a packet forwarding board configured to (A) forward control traffic via a first link to a traffic replication device and (B) forward data traffic via a second link to a first routing engine, (2) the traffic replication device configured to (A) replicate the control traffic received from the packet forwarding board and (B) select control signals received from the first routing engine, (3) the first routing engine configured to receive control traffic from the traffic replication device, and (4) a second routing engine configured to receive control traffic from the traffic replication device. Various other apparatuses, systems, and methods are also disclosed.

Abstract: In general, embodiments relate to a method, obtaining, by a monitoring fabric network device operating in the monitoring fabric, a packet, wherein the packet is a replication of a packet sent to a second network device, applying a classification to the packet, performing, using the classification, a modification on a layer 2 (L2) address of the packet to obtain a modified packet, wherein the modified packet includes a modified L2 address, and transmitting the modified packet to a second monitoring fabric network device based on forwarding policies, wherein the forwarding policies do not utilize the modified L2 address.

Abstract: A system that incorporates teachings of the present disclosure may include, for example avoiding data copy and task switching by processing protocol headers of network PDUs as a serial tape to be processed in order such as by a single method. Other processing includes reducing stages and simplifying protocol processing and multiplexing during network communications. Address changing in an active network can be implemented by assigning multiple addresses to an entity so that a new address can replace the old address. Peer-to-peer application searching can be performed among networks that can be accessible or non-accessible networks. Utilizing anycast sets that include selected and alternative addresses to enable immediate or near immediate alternative route selection on failure or congestion. Other embodiments are disclosed.

Abstract: An efficient method to handle fragmented packets in multi-node all-active clusters. In one particular embodiment, a method includes receiving an initial fragment packet at a node in a cluster, creating a secondary flow table, linking the secondary flow table to a primary flow table, determining the primary flow owner of the initial fragment packet, and transmitting initial and succeeding fragment packets out of the cluster through, if possible, the primary flow owner.

Abstract: Embodiments of the present invention relate to a Lookup and Decision Engine (LDE) for generating lookup keys for input tokens and modifying the input tokens based on contents of lookup results. The input tokens are parsed from network packet headers by a Parser, and the tokens are then modified by the LDE. The modified tokens guide how corresponding network packets will be modified or forwarded by other components in a software-defined networking (SDN) system. The design of the LDE is highly flexible and protocol independent. Conditions and rules for generating lookup keys and for modifying tokens are fully programmable such that the LDE can perform a wide variety of reconfigurable network features and protocols in the SDN system.

Abstract: Techniques for load balancing encrypted traffic based on security parameter index (SPI) values of packet headers and sets of 5-tuple values of the packet headers are described herein. Additionally, techniques for including quality of service (QoS)-type information in SPI value fields of packet headers are also described herein. The QoS-type information may indicate a particular traffic class according to which the packet is to be handled. Further, techniques for pre-configuring a backend host such that encrypted traffic may be migrated to the backend host from another backend host without causing temporary service disruptions are also described herein.

Abstract: Embodiments of this application disclose path traffic allocation methods and network devices. One of the disclosed path traffic allocation methods includes sending, by an ingress node, a measurement packet to an egress node on each of at least two paths, where the at least two paths are paths between the ingress node and the egress node, and the measurement packet on each path indicates path information of each path. The disclosed method further includes receiving, by the ingress node, a response packet from the egress node, where the response packet indicates traffic adjustment information of each path, and determining, by the ingress node, to-be-sent traffic on each path based on the traffic adjustment information of each path.

Abstract: A mesh network may be established between a plurality of access points to facilitate load balancing for one or more of the access points. The mesh network may define a plurality of communication routes through the access points having capabilities sufficient to facilitate or mimic communications underperforming or being unavailable at the access point requesting load balancing.

Abstract: Described herein are systems, methods, and software to enhance the implementation of communication rules in a computing network. In one example, a method of operating a communication settings system maintains communication rules for a plurality of networks, wherein the communication rules define forwarding actions for ingress and egress packets to and from applications in the plurality of computing networks. The service further identifies a configuration request from a computing network with applications executing in the computing network, identifies a subset of the communication rules based on the plurality of applications, and provides the subset of the communication rules to the computing network.

Abstract: Methods, apparatus, systems, and articles of manufacture to facilitate data transmission are disclosed. An examples apparatus includes a schedule controller to determine a first time corresponding to an end of a window for a data exchange; a data packet controller to determine a second time corresponding to an acknowledgement send during the window; a link performance calculator to calculate link performance based on the first time and the second time; and an interface to transmit the link performance to a network configuration entity.

Abstract: Systems and methods are disclosed herein for output pacing in a cellular communications system that serves as a virtual Time-Sensitive Networking (TSN) node in a TSN network. In some embodiments, a method of operation of a boundary node associated with a cellular communications system that operates as a virtual TSN node in a TSN network comprises receiving user plane traffic from a node in the cellular communications system. The user plane traffic is user plane traffic received by the cellular communications system from a previous hop TSN node. The method further comprises performing output pacing for the user plane traffic when outputting the user plane traffic to a next hop TSN node such that the user plane traffic is output to the next hop TSN node at a rate that matches a desired rate at the next hop TSN node. Corresponding embodiments of a boundary node are also disclosed.

Abstract: A processor is configured to receive, from a first device, a plurality of first-direction packets belonging to a flow of communication, pass the first-direction packets to a second device, receive, from the second device, a plurality of second-direction packets belonging to the flow, pass the second-direction packets to the first device, calculate, after receiving each of at least some of the second-direction packets, an estimated in-flight number, by assuming that the second-direction packet acknowledges receipt of a number of the first-direction packets that is based on an estimated average number of received first-direction packets acknowledged by the second-direction packets, the estimated in-flight number being an estimated volume of payload data, contained at least partly in the first-direction packets, that has been passed by the processor to the second device but has not yet been received by the second device, and to regulate the flow, based on the estimated in-flight number.

Abstract: A method for implementing collective communication, a computer device, and a communication system are provided, to resolve problems of high communication latency and resource consumption in the conventional technology. The method includes: identifying a work request having no communication dependency, and when forwarding work requests, directly forwarding the work request identified as having no communication dependency, and forwarding, after queue management, a work request that is not identified as having no communication dependency. According to the application, communication latency caused when the work request having no communication dependency is managed by using a queue can be avoided, and resource consumption caused by performing related management can be reduced, to improve overall communication performance of collective communication.

Abstract: A system, method, and computer-readable medium for performing a data center management and monitoring operation. The data center management and monitoring operation includes: identifying data forwarder configuration information for a plurality of data forwarders, the forwarder configuration information including scheduling information; scheduling collection of data from a data source according to the scheduling information; collecting data from a data source based upon the scheduling, the collecting using the forwarder configuration information to identify the data to be collected; formatting the data collected from the data source according to the data forwarder configuration information to provide formatted data; and, forwarding the formatted data to a recipient.

Abstract: Systems and methods for building service templates that allow for an agentless, data-driven and stateful automation of a provisioning of services to mobile network customers. Data associated with a request to create a target schema object class for a device and protocol are received. Based on the device and protocol information, a set of data fields associated with CRUD semantics is retrieved from either a database or from user provided data. A decorated target object class is created based on the requested target schema object class. A subrecipe is created including the decorated target object class, and one or more other decorated target object classes. A recipe is processed for transmission to an execution engine to form a service instance, the service instance being customizable by an operator for a specific network device such that the service instance data fields that are not pre-filled can be customized by the operator.

Abstract: Methods, apparatus, systems, and articles of manufacture are disclosed to optimize resources in edge networks. An example apparatus includes agent managing circuitry to invoke an exploration agent to identify platform resource devices, select a first one of the identified platform resource devices, and generate first optimization metrics for the workload corresponding to the first one of the identified platform resource devices, the first optimization metrics corresponding to a first path. The example agent is to further select a second one of the identified platform resource devices, generate second optimization metrics for the workload corresponding to the second one of the identified platform resource devices, the second optimization metrics corresponding to a second path.

Abstract: Systems and methods for mitigating latency. For example, prior to ingesting a data stream, the system extracts a communication identifier from the data stream. The system may then compare the communication identifier to a state-specific communication reference directory that indicates a current state a given communication, a cloud component currently processing the communication (or a portion thereof), and/or other information used to sort the communication. As the state-specific communication reference directory ensures proper triaging of the data stream, the system is not reliant on maintaining session persistence.

Abstract: Aspects of the present disclosure relate to managing storage array resources. In embodiments, a request from a client machine is received by a storage array via a command-line path. Additionally, the consumption of storage array resources can be controlled. For instance, resource consumption control can include limiting an initialization of one or more microservices based on the request's related information.

Abstract: A method for distributing data process according to technical resource capacity availability and constraints across a network is disclosed. The method includes receiving, at a database, a feed request for processing by a computing resource, among a network of computing resources that are geographically dispersed. Further, the method includes identifying, among the network of computing resources, a computing resource for processing the feed request based on the at least one attribute and processing capacity of the computing resources, and assigning the feed request for processing to the identified computing resource in real-time and without predetermined assignment to process increase in data volume by leveraging remotely located and/or underutilized computing resources.

Abstract: Providing access to content is disclosed. An indication of a context is received. Access is provided to a context-relevant subset of a body of managed content. In some cases, the context-relevant subset includes a document relevant to the content.

Abstract: An online software platform (OSP) classifies challenges to digital rules into buckets according to respective challenged digital rules that were applied to produce respective challenged resources. The OSP computes respective statistics for the buckets. Each bucket may have a corresponding statistic associated with the bucket based on a current total number of challenges that have been classified into that bucket. The OSP ranks the buckets according to the respective statistics of the buckets. The OSP may correct, based on the ranking of the buckets, the respective challenged stored digital rule of the selected bucket without yet correcting the respective challenged digital rule of at least one of the other buckets. This correction is stored and included in digital rules to be used to produce resources going forward.

Abstract: An electrical computer system processing architecture for providing an indication of activity in the electrical computer system, the electrical computer system processing architecture comprising a plurality of client computers connected to at least one server by a computer network. Each of the client computers is configured to provide requests to the at least one server. The or each server comprises a store for storing requests provided by the plurality of client computers. The or each server is configured to match complementary requests from the plurality of client computers stored in the store. Following the matching of complementary requests, the or each server counts unmatched requests corresponding to one or other of the complementary requests in the store, and outputs the counted number of unmatched requests to provide the indication of activity in the computer system.

Abstract: System and methods are provided that can address dynamically determining capacity allocations for multiple services on the same computing devices in the same point of presences (PoPs). A routing and capacity management system receives logs from the services. The routing and capacity management system processes logs from the services to generate data that reflects resource usage at respective PoPs and/or border links. The routing and capacity management system dynamically determines capacity allocation for the services based on the generated data and instructs the services with the capacity allocation changes.

Abstract: In one embodiment, quasi-Output Queue behavior of a packet switching device is achieved using virtual output queue (VOQ) ordering independently determined for each particular output queue (OQ), including using maintained latency information of the VOQs of the particular OQ. In one embodiment, all packets from all VOQs with a same port-priority destination experience similar latency within specific time-window, which is similar to the packet service provided by an Output Queue switch architecture. In one embodiment, all input ports that send traffic to same output port-priority receive bandwidth which is proportional to their bandwidth demand divided by total bandwidth. Prior approaches that emulate the performance of an OQ switch architecture require complex and time-consuming scheduling determinations and do not scale. Independently determining the order for sending packets from the VOQs associated with each particular OQ provides a scalable and implementable system with quasi-Output Queue behavior.

Abstract: The present disclosure relates to the field of communications technologies, and in particular, to a transmitting method, applicable to a base station. The method includes: determining a first time/frequency resource for data to be transmitted, the data to be transmitted being indicated by a first signaling to be transmitted, and a second time/frequency resource for a second signaling to be transmitted; determining an overlapping time/frequency resource between the first time/frequency resource and the second time/frequency resource; and transmitting at least one of the second signaling or transmitting the data to be transmitted to first user equipment on the overlapping time/frequency resource.

Abstract: This disclosure describes systems, methods, and devices related to enhanced bandwidth selection for wireless devices. A device may generate a request frame with at least one of a first indication of a bandwidth for which a second device is to measure a first noise level or a second indication of a resource unit for which the second device is to measure a second noise level. The device may send the request frame to the second device. The device may identify a response frame received from the second device, the response frame having a third indication of the first noise level or the second noise level and a fourth indication of the bandwidth or the resource unit. The device may determine, based on the first noise level or the second noise level, a parameter associated with a subsequent frame to send to the second device.

Abstract: According to various embodiments of the present invention, disclosed is an electronic device comprising: a first antenna element configured so as to transmit and receive a signal of a first frequency band or a second frequency band; a second antenna element configured so as to transmit and receive the signal of the first frequency band or the second frequency band; a first RF block electrically connected to the first antenna element and the second antenna element and including a first transmission and reception circuit and a second transmission and reception circuit; an RF reception circuit for receiving the signal of the first frequency band or the second frequency band from the first antenna element or the second antenna element; and a transceiver, wherein the first transmission and reception circuit processes the signal of the first frequency band or the second frequency band, the second transmission and reception circuit processes the signal of the first frequency band or the second frequency band, and th

Abstract: A system and method for allocating network resources are disclosed herein. In one embodiment, the system and method are configured to perform: receiving a resource allocation message indicative of a plurality of resource groups allocated for a signal; and transmitting the signal using a portion of the plurality of resource groups, wherein, in a frequency domain, the portion of the plurality of resource groups presents a hopping pattern comprising at least a first hopping path that is associated with a first plurality of increasing frequency spacings and a second hopping path that is associated with a second plurality of decreasing frequency spacings.

Abstract: The present disclosure provides a method and a device in a node used for wireless communications. A first node firstly receives a first signaling and a second signaling, the first signaling indicating a first zone size and a second zone size, while the second signaling indicating a first radio resource pool and a second radio resource pool; and then determines according to the current position whether to transmit a first signal in a first radio resource set; when the first radio resource set is associated with the first radio resource pool, the first zone size is used to determine the current position. By respectively associating the first zone size and the second zone size with the first radio resource pool and the second radio resource pool, the present disclosure manages to optimize the determination of feedback transmission in sidelink, which in turn improves the spectrum efficiency of sidelink transmission.

Abstract: Various aspects of the present disclosure generally relate to wireless communication. In some aspects, a user equipment (UE) may transmit an indication associated with phase noise characteristics of the UE. The UE may receive an indication of pilot allocation sizes, for different data modulation and coding schemes (MCSs) for communications, of frequency-domain contiguous pilots for phase noise mitigation based at least in part on the indication associated with the phase noise characteristics of the UE. Numerous other aspects are described.

Abstract: Systems, apparatuses, and methods are described for wireless communications. A base station may send a message to a wireless device to activate uplink transmissions for a non-activated cell. The wireless device may receive the message and activate a previously non-activated cell.

Abstract: The present specification relates to a method for transmitting and receiving an uplink in a wireless communication system. More specifically, the method may include: a step for transmitting, to a base station, terminal capability information related to the uplink transmission; a step for receiving, from the base station, configuration information based on the terminal capability information; a step for receiving, from the base station, downlink control information for scheduling the uplink transmission, wherein the configuration information includes information about one or more SRS resource sets and one more SRS resources related to the uplink transmission; and a step for transmitting the uplink on the basis of an SRS resource set and an SRS resource, among the one or more SRS resource sets and the one or more SRS resources, indicated by information included in the downlink control information.

Abstract: Methods, systems, and devices for wireless communications are described. In a wireless communications system, multiple transmission/reception points (TRPs) may perform a joint transmission to a user equipment (UE) such that the UE may rely on demodulation reference signals (DMRSs) from the TRPs for channel estimation and data demodulation to receive the joint transmission. When TRP transmissions are punctured, which may introduce reception errors at a receiving UE, one or more TRPs may transmit unique DMRSs such that each TRP transmits a DMRS that is unique to the transmitting TRP, transmit DMRSs that are unique to punctured resource elements (REs), or determine to refrain from transmitting on punctured REs. In some cases, TRPs may transmit preemption indications (PIs) to a UE, where the PIs may indicate punctured (e.g., or not utilized) REs to allow the UE to utilize a unique DMRS for channel estimation or to ignore the punctured REs.

Abstract: Methods, systems, and devices for multiple transmission schemes in wireless communication are described. In one aspect, a wireless communication method is disclosed to include: transmitting, by a first communication device, at least one of i) a repetition mode of data transmissions to be sent to a second communication device, ii) a mapping between N indicated beams and all scheduled transmissions of the data, or iii) a RV (Redundant Version) relationship among the all scheduled transmissions of the data, wherein the transmitting is based on at least one of the N indicated beam(s), a DMRS (Demodulation Reference Signals) port indication, or K time domain occasions, N and K being non-negative integers.

Abstract: The disclosure relates to a pre-5th-generation (5G) or 5G communication system to be provided for supporting higher data rates beyond 4th-generation (4G) communication system such as long term evolution (LTE). The disclosure provides a remote interference management method, a gNB, an electronic device, a readable storage medium, and a base station for performing inter-base station interference coordination. The method includes steps of: determining, by a gNB, a mapping relationship between a gNB set ID and a RIM-RS according to received configuration information; transmitting, by the gNB, the RIM-RS according to the allocated gNB set ID and the mapping relationship; and/or performing RIM-RS detection, by the gNB, determining gNB set ID information through the detected RIM-RS according to the mapping relationship, and reporting the determined gNB set ID information.