Name service query method and device in FC switched network

By setting the main switch in the FC switch network and introducing an intelligent judgment mechanism, the network congestion problem caused by multiple nodes being up and down or parameter changes is solved, and the effect of simplifying the network synchronization process, reducing network load and improving query efficiency is achieved.

CN119676314APending Publication Date: 2025-03-21WELL CORE MICROELECTRONICS TECH (TIANJIN) CO LTD
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202411740652.9
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2024-11-29
Publication Date
2025-03-21

AI Technical Summary

Technical Problem

In an FC switched network, multiple nodes are connected or the parameters are changed, causing network congestion.

Method used

A main switch is set up in the FC switch network, and all targeted notifications of parameter changes are sent directly to the main switch. The main switch updates the name service database and introduces an intelligent judgment mechanism during the name service query process. First, determine whether the requested switch is a direct connection node on the local switch.

Benefits of technology

It simplifies the network synchronization process, reduces unnecessary message delivery, reduces network load, improves query efficiency and response speed, effectively reduces the number of messages in the FC network, and avoids network congestion.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN119676314A_ABST
    Figure CN119676314A_ABST
Patent Text Reader

Abstract

The invention provides a name service query method and device in an FC switched network. The method comprises the following steps: determining a main switch in the FC switched network; when a parameter of a first target switch in the FC switched network changes, the first target switch sends a directional advertisement to the master switch. The host switch receives a directional advertisement and updates the name service database based on the directional advertisement. And when a second target switch in the FC switched network receives a name service query request, judging whether the requested switch is a direct connection node of the second target switch based on the name service query request. And if the node is the direct connection node of the second target switch, obtaining query data corresponding to the switch name of the requested switch in the storage space of the second target switch. And if not, sending the name service query request to a main switch. According to the method provided by the invention, the message congestion in the FC switching network can be avoided.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present application relates to the field of data processing technology, and in particular to a name service query method and device in an FC switching network. Background Art

[0002] With the continuous development of science and technology, the use of optical fiber is becoming more and more popular. Fibre Channel (FC) switch is a high-speed network transmission relay device. Compared with ordinary switches, it uses optical fiber cable as the transmission medium. The advantages of optical fiber transmission are fast speed and strong anti-interference ability. The switching network composed of Fibre Channel switches is FC switching network. In order to distinguish, each switch in the FC switching network has a unique and corresponding name.

[0003] The FC standard specifies two synchronization methods for name service information. The first is that each switch saves the name service information of the directly connected nodes on the local machine, and the second is that each switch saves the name service information of all nodes in the FC network. When a node goes online or offline or its parameters change in the FC network, switches exchange node information through messages until all switches in the FC network receive messages about node status changes. However, when multiple nodes in the FC switching network go online or offline or their parameters change, a large number of messages will exist in the FC network at the same time, causing congestion in the FC switching network.

[0004] Therefore, how to avoid congestion in the FC switching network when multiple nodes are online or offline or parameters are changed has become a technical problem that technical personnel in this field need to solve urgently. Summary of the invention

[0005] Based on the above problems, the present application provides a name service query method and device in an FC switching network to avoid congestion in the FC switching network when multiple nodes go online or offline or their parameters change.

[0006] The present application provides a name service query method in an FC switching network, the method comprising the following steps:

[0007] Determine a master switch in the FC switching network, each switch in the FC switching network has a corresponding switch name, and the master switch stores a name service database;

[0008] When a parameter of a first target switch in the FC switching network changes, the first target switch sends a directional notification to the master switch, and the destination address set in the directional notification is the address of the master switch;

[0009] The master switch receives the directed advertisement and updates the name service database based on the directed advertisement;

[0010] When the second target switch in the FC switching network receives the name service query request, determining whether the requested switch is a directly connected node of the second target switch based on the name service query request;

[0011] If the requested switch is a directly connected node of the second target switch, obtaining query data corresponding to the switch name of the requested switch in the storage space of the second target switch;

[0012] Returning the query data to the requester of the name service query request;

[0013] If the requested switch is not a directly connected node of the second target switch, sending the name service query request to the master switch;

[0014] The master switch obtains query data corresponding to the requested switch in the name service database based on the name service query request;

[0015] The query data is returned to the requester of the name service query request.

[0016] In a possible implementation manner, determining a master switch in the FC switching network includes:

[0017] The switch with the lowest switch name in the FC switching network is used as the master switch.

[0018] In a possible implementation, the method further includes:

[0019] When a parameter of a first target switch in the FC switching network changes, the first target switch stores the changed parameter in a storage space of the first target switch.

[0020] In a possible implementation, the method further includes:

[0021] When a node of the first target switch in the FC switching network is deleted, the first target switch deletes data corresponding to the deleted node in the storage space of the first target switch.

[0022] In a possible implementation, the method further includes:

[0023] When a node is added to the first target switch in the FC switching network, the first target switch stores data corresponding to the added node in the storage space of the first target switch.

[0024] In a possible implementation manner, sending the name service query request to the master switch includes:

[0025] then sending a name service query request to the next-hop switch of the second target switch;

[0026] The next-hop switch determines whether the address of the main switch in the name service query request is consistent with the address of the next-hop switch;

[0027] If they are inconsistent, the next-hop switch is used as the second target switch to execute the step of sending a name service query request to the next-hop switch of the second target switch.

[0028] The present application also provides a name service query device in an FC switching network, the device comprising the following modules:

[0029] A determination module, used for determining a master switch in an FC switching network, each switch in the FC switching network having a corresponding switch name, and the master switch storing a name service database;

[0030] a sending module, configured to, when a parameter of a first target switch in the FC switching network changes, cause the first target switch to send a directional notification to the master switch, wherein the destination address set in the directional notification is the address of the master switch;

[0031] An updating module, configured for the master switch to receive the directed announcement and update the name service database based on the directed announcement;

[0032] a judgment module, configured to judge whether the requested switch is a directly connected node of the second target switch based on the name service query request when the second target switch in the FC switching network receives the name service query request;

[0033] a first query module, configured to obtain query data corresponding to the switch name of the requested switch in the storage space of the second target switch if the requested switch is a directly connected node of the second target switch;

[0034] A first returning module, used for returning the query data to the requester of the name service query request;

[0035] A second query module, configured to send the name service query request to the master switch if the requested switch is not a directly connected node of the second target switch;

[0036] A third query module, configured for the master switch to obtain query data corresponding to the requested switch in the name service database based on the name service query request;

[0037] The second returning module returns the query data to the requester of the name service query request.

[0038] In a possible implementation manner, the second query module is specifically configured to:

[0039] then sending a name service query request to the next-hop switch of the second target switch;

[0040] The next-hop switch determines whether the address of the main switch in the name service query request is consistent with the address of the next-hop switch;

[0041] If they are inconsistent, the next-hop switch is used as the second target switch to execute the step of sending a name service query request to the next-hop switch of the second target switch.

[0042] The present application also provides an electronic device, the electronic device comprising a processor and a memory:

[0043] The memory is used to store a computer program and transmit the computer program to the processor;

[0044] The processor is used to execute the steps of the name service query method in the FC switching network according to the instructions in the computer program.

[0045] The present application also provides a computer-readable storage medium, which is used to store a computer program. When the computer program is executed by an electronic device, the steps of the name service query method in the FC switching network are implemented.

[0046] Compared with the prior art, this application has the following beneficial effects:

[0047] In the prior art, node status updates require the entry switch to send notifications to adjacent switches step by step, resulting in a large number of SW_RSCN messages in the network, increasing the complexity and congestion risk of the network. The method provided by the present application sets a master switch in the FC switching network, and all directional notifications of parameter changes are directly sent to the master switch, which updates the name service database. This mechanism greatly simplifies the network synchronization process, reduces unnecessary message transmission, and reduces network load. In the name service query process, the present application introduces an intelligent judgment mechanism, firstly judging whether the requested switch is a directly connected node in the local switch. If it is a directly connected node, the query data is directly obtained locally to respond to the request quickly. This localized processing method reduces the dependence on the master switch, reduces the burden on the master switch, and improves the query efficiency and response speed. By optimizing the update and query process of the name service, the present application effectively reduces the number of messages in the FC network, especially when multiple nodes change at the same time or multiple query requests are carried out at the same time. This optimized design avoids network congestion caused by the transmission of a large number of messages, and ensures the stability of the network and the reliability of data transmission. BRIEF DESCRIPTION OF THE DRAWINGS

[0048] In order to more clearly illustrate the embodiments of the present application or the technical solutions in the prior art, the drawings required for use in the embodiments or the description of the prior art will be briefly introduced below. Obviously, the drawings described below are only some embodiments of the present application. For ordinary technicians in this field, other drawings can be obtained based on these drawings without paying creative labor.

[0049] Figure 1 A flowchart of a name service query method in an FC switching network provided by an embodiment of the present application;

[0050] Figure 2 A schematic diagram of the structure of a name service query device in a switching network provided in an embodiment of the present application. DETAILED DESCRIPTION

[0051] As described above, the FC standard specifies two synchronization methods for name service information. The first method is for each switch to store the name service information of the directly connected nodes on the local machine, and the second method is for each switch to store the name service information of all nodes in the FC network. When a node goes online or offline or its parameters change in the FC network, switches exchange node information through messages until all switches in the FC network receive messages about node status changes. However, when multiple nodes in the FC switching network go online or offline or their parameters change, a large number of messages will exist in the FC network at the same time, causing congestion in the FC switching network.

[0052] In order to enable those skilled in the art to better understand the solution of the present application, the technical solution in the embodiments of the present application will be clearly and completely described below in conjunction with the drawings in the embodiments of the present application. Obviously, the described embodiments are only part of the embodiments of the present application, not all of the embodiments. Based on the embodiments in the present application, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of this application.

[0053] It is understandable that the method provided in the present application can be applied to a processing device, which is a processing device that can determine the main switch in the FC switching network, for example, a terminal device or a server that can determine the main switch in the FC switching network. The method provided in the present application can be executed independently by a terminal device or a server, and can also be applied to a network scenario in which a terminal device and a server communicate, and is executed by the cooperation of a terminal device and a server. Among them, the terminal device can be a computer, a mobile phone and other devices. The server can be understood as an application server or a Web server. In actual deployment, the server can be an independent server or a cluster server.

[0054] Figure 1 A flowchart of a name service query method in an FC switching network provided by the present application, the method comprising the following steps:

[0055] S101: Determine a master switch in the FC switching network.

[0056] The processing device determines a master switch in the FC switching network. Each switch in the FC switching network has a corresponding switch name. The master switch stores a name service database.

[0057] In a possible implementation, switches in the FC switching network are named with sequential identifiers, and the processing device uses the switch with the lowest switch name in the FC switching network as the master switch.

[0058] When the FC switching network is being networked, the FC switch that is networked first generally has a lower identification order. The identification with an order can be, for example, numbers or letters, or any identification with an order.

[0059] Next, taking letters as an example, it can be pre-defined that letter A has a lower identification order. If the FC switching network includes five FC switches, the five FC switches are FC switch A to FC switch E. When determining the master switch, the processing device can determine FC switch A with a lower identification order as the master switch.

[0060] In a possible implementation, if the FC switching network that has been networked needs to be re-networked, a switch with a lower identification order can still be selected as the main switch.

[0061] S102: When a parameter of a first target switch in the FC switching network changes, the first target switch sends a directional notification to the master switch.

[0062] When the parameters of the first target switch in the FC switching network are changed, the first target switch sends a directed notification to the master switch, and the destination address set in the directed notification is the address of the master switch.

[0063] In the related art, the notification specified by the protocol is a non-directional notification. The first target switch will send a non-directional notification to the directly connected node, and the directly connected node will continue to send non-directional notifications to other switches until the entire FC switching network completes the parameter change.

[0064] The destination address of the directed advertisement is set to the address of the main switch. The neighboring switch receives the directed advertisement and checks whether the address in the directed advertisement is the same as its own address. If not, it is forwarded to the next hop until it reaches the main switch.

[0065] S103: The master switch receives the directed advertisement and updates the name service database based on the directed advertisement.

[0066] The master switch receives the directed notification and updates the name service database based on the directed notification. The name service database includes the name of each FC switch in the FC switching network and the corresponding name service data.

[0067] In a possible implementation, when a parameter of a first target switch in the FC switching network changes, the first target switch stores the changed parameter in a storage space of the first target switch.

[0068] In another possible implementation, when a node of a first target switch in the FC switching network is deleted, the first target switch deletes data corresponding to the deleted node in a storage space of the first target switch.

[0069] In yet another possible implementation, when a first target switch in the FC switching network adds a node, the first target switch stores data corresponding to the added node in a storage space of the first target switch.

[0070] S104: When the second target switch in the FC switching network receives the name service query request, it determines whether the requested switch is a directly connected node of the second target switch based on the name service query request.

[0071] It should be noted that the first target switch may be any switch in the FC switching network, and the second target switch may also be any switch in the FC switching network. The first target switch and the second target switch may be the same FC switch or different FC switches.

[0072] S105: If the requested switch is a directly connected node of the second target switch, then obtain query data corresponding to the switch name of the requested switch in the storage space of the second target switch.

[0073] The second target switch receives the name service query request, determines whether the query object is a node directly connected to the local device, and for the node directly connected to the local device, queries the local name database and directly returns a query response.

[0074] S106: Return the query data to the requester of the name service query request.

[0075] The second target switch returns the query data to the requester of the name service query request.

[0076] S107: If the requested switch is not a directly connected node of the second target switch, the name service query request is sent to the main switch.

[0077] In a possible implementation, the second target switch may send a name service query request to the next-hop switch of the second target switch. The next-hop switch determines whether the address of the main switch in the name service query request is consistent with the address of the next-hop switch. If they are inconsistent, the next-hop switch is used as the second target switch to execute the step of sending the name service query request to the next-hop switch of the second target switch.

[0078] S108: The master switch obtains query data corresponding to the requested switch in the name service database based on the name service query request.

[0079] S109: Return the query data to the requester of the name service query request.

[0080] The master switch returns the query data to the requester of the name service query request.

[0081] In the prior art, node status updates require the entry switch to send notifications to adjacent switches step by step, resulting in a large number of SW_RSCN messages in the network, increasing the complexity and congestion risk of the network. The method provided by the present application sets a master switch in the FC switching network, and all directional notifications of parameter changes are directly sent to the master switch, which updates the name service database. This mechanism greatly simplifies the network synchronization process, reduces unnecessary message transmission, and reduces network load. In the name service query process, the present application introduces an intelligent judgment mechanism, firstly judging whether the requested switch is a directly connected node in the local switch. If it is a directly connected node, the query data is directly obtained locally to respond to the request quickly. This localized processing method reduces the dependence on the master switch, reduces the burden on the master switch, and improves the query efficiency and response speed. By optimizing the update and query process of the name service, the present application effectively reduces the number of messages in the FC network, especially when multiple nodes change at the same time or multiple query requests are carried out at the same time. This optimized design avoids network congestion caused by the transmission of a large number of messages, and ensures the stability of the network and the reliability of data transmission.

[0082] This application also provides a Figure 2 The structure diagram of the name service query device in the FC switching network shown in the figure, the name service query device 200 in the FC switching network includes the following modules:

[0083] The determination module 201 is used to determine a master switch in the FC switching network, each switch in the FC switching network has a corresponding switch name, and the master switch stores a name service database;

[0084] The sending module 202 is configured to, when a parameter of a first target switch in the FC switching network changes, cause the first target switch to send a directional notification to the master switch, wherein the destination address set in the directional notification is the address of the master switch;

[0085] An updating module 203, configured for the master switch to receive the directed announcement and update the name service database based on the directed announcement;

[0086] A determination module 204 is configured to determine, when a second target switch in the FC switching network receives a name service query request, whether the requested switch is a directly connected node of the second target switch based on the name service query request;

[0087] A first query module 205, configured to obtain query data corresponding to the switch name of the requested switch in the storage space of the second target switch if the requested switch is a directly connected node of the second target switch;

[0088] A first returning module 206, configured to return the query data to the requester of the name service query request;

[0089] The second query module 207 is configured to send the name service query request to the master switch if the requested switch is not a directly connected node of the second target switch;

[0090] A third query module 208, configured for the master switch to obtain query data corresponding to the requested switch in the name service database based on the name service query request;

[0091] The second returning module 209 returns the query data to the requester of the name service query request.

[0092] In a possible implementation manner, the second query module is specifically configured to:

[0093] then sending a name service query request to the next-hop switch of the second target switch;

[0094] The next-hop switch determines whether the address of the main switch in the name service query request is consistent with the address of the next-hop switch;

[0095] If they are inconsistent, the next-hop switch is used as the second target switch to execute the step of sending a name service query request to the next-hop switch of the second target switch.

[0096] In the prior art, the node status update requires the entry switch to send notifications to the adjacent switches step by step, resulting in a large number of SW_RSCN messages in the network, increasing the complexity and congestion risk of the network. The device provided by the present application sets a main switch in the FC switching network, and all directional notifications of parameter changes are directly sent to the main switch, and the main switch updates the name service database. This mechanism greatly simplifies the network synchronization process, reduces unnecessary message transmission, and reduces the network load. In the name service query process, the present application introduces an intelligent judgment mechanism, firstly judging whether the requested switch is a directly connected node in the local switch. If it is a directly connected node, the query data is directly obtained locally and the request is responded to quickly. This localized processing method reduces the dependence on the main switch, reduces the burden on the main switch, and improves the query efficiency and response speed. By optimizing the update and query process of the name service, the present application effectively reduces the number of messages in the FC network, especially when multiple nodes change at the same time or multiple query requests are carried out at the same time. This optimized design avoids network congestion caused by the transmission of a large number of messages, and ensures the stability of the network and the reliability of data transmission.

[0097] An embodiment of the present application also provides a name service query device in an FC switching network, wherein the device includes a memory and a processor, the memory is used to store instructions or codes, and the processor is used to execute the instructions or codes so that the device performs the steps of the name service query method in the FC switching network described in any embodiment of the present application.

[0098] In practical applications, the computer-readable storage medium may be any combination of one or more computer-readable media, which may be a computer-readable signal medium or a computer-readable storage medium.

[0099] The computer-readable storage medium may be, for example, but not limited to, an electrical, magnetic, optical, electromagnetic, infrared, or semiconductor system, device or device, or any combination thereof. More specific examples of computer-readable storage media (a non-exhaustive list) include: an electrical connection with one or more wires, a portable computer disk, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disk read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination thereof. In the present embodiment, the computer-readable storage medium may be any tangible medium containing or storing a program that may be used by or in conjunction with an instruction execution system, device, or device.

[0100] Computer-readable signal media may include data signals propagated in baseband or as part of a carrier wave, which carry computer-readable program code. Such propagated data signals may take a variety of forms, including but not limited to electromagnetic signals, optical signals, or any suitable combination of the above. Computer-readable signal media may also be any computer-readable medium other than a computer-readable storage medium, which may send, propagate, or transmit a program for use by or in conjunction with an instruction execution system, apparatus, or device.

[0101] The program code embodied on the computer readable medium may be transmitted using any appropriate medium, including but not limited to wireless, wireline, optical fiber cable, RF, etc., or any suitable combination of the foregoing.

[0102] Computer program code for performing the operations of the present invention may be written in one or more programming languages ​​or a combination thereof, including object-oriented programming languages ​​such as Java, Smalltalk, C++, and conventional procedural programming languages ​​such as "C" or similar programming languages. The program code may be executed entirely on the user's computer, partially on the user's computer, as a separate software package, partially on the user's computer and partially on a remote computer, or entirely on a remote computer or server. In the case of a remote computer, the remote computer may be connected to the user's computer through any type of network, including a local area network (LAN) or a wide area network (WAN), or may be connected to an external computer (e.g., via the Internet using an Internet service provider).

[0103] It should be noted that each embodiment in this specification is described in a progressive manner, and the same or similar parts between the embodiments can be referred to each other, and each embodiment focuses on the differences from other embodiments. In particular, for the device embodiment, since it is basically similar to the method embodiment, the description is relatively simple, and the relevant parts can be referred to the partial description of the method embodiment. The device embodiment described above is merely schematic, in which the unit described as a separate component may or may not be physically separated, and the component prompted as a unit may or may not be a physical unit, that is, it may be located in one place, or it may be distributed on multiple network units. Some or all of the modules can be selected according to actual needs to achieve the purpose of the scheme of this embodiment. Ordinary technicians in this field can understand and implement it without paying creative work.

[0104] The above is only a specific implementation of the present application, but the protection scope of the present application is not limited thereto. Any changes or substitutions that can be easily thought of by a person skilled in the art within the technical scope disclosed in the present application should be included in the protection scope of the present application. Therefore, the protection scope of the present application should be based on the protection scope of the claims.

Claims

1. A name service query method in an FC switching network, characterized in that: include: Determine a master switch in the FC switching network, each switch in the FC switching network has a corresponding switch name, and the master switch stores a name service database; When a parameter of a first target switch in the FC switching network changes, the first target switch sends a directed notification to the master switch, and the destination address set in the directed notification is the address of the master switch; The master switch receives the directed advertisement and updates the name service database based on the directed advertisement; When the second target switch in the FC switching network receives the name service query request, determining whether the requested switch is a directly connected node of the second target switch based on the name service query request; If the requested switch is a directly connected node of the second target switch, obtaining query data corresponding to the switch name of the requested switch in the storage space of the second target switch; Returning the query data to the requester of the name service query request; If the requested switch is not a directly connected node of the second target switch, sending the name service query request to the master switch; The master switch obtains query data corresponding to the requested switch in the name service database based on the name service query request; The query data is returned to the requester of the name service query request.

2. The method according to claim 1, wherein the switches in the FC switching network are named with sequential identifiers, wherein: Determining the master switch in the FC switching network includes: The switch with the lowest switch name in the FC switching network is used as the main switch.

3. The method according to claim 1, characterized in that The method further comprises: When a parameter of a first target switch in the FC switching network changes, the first target switch stores the changed parameter in a storage space of the first target switch.

4. The method according to claim 1, characterized in that The method further comprises: When a node of the first target switch in the FC switching network is deleted, the first target switch deletes data corresponding to the deleted node in the storage space of the first target switch.

5. The method according to claim 1, characterized in that The method further comprises: When a node is added to the first target switch in the FC switching network, the first target switch stores data corresponding to the added node in the storage space of the first target switch.

6. The method according to claim 1, characterized in that The sending the name service query request to the master switch includes: then sending a name service query request to the next-hop switch of the second target switch; The next-hop switch determines whether the address of the main switch in the name service query request is consistent with the address of the next-hop switch; If they are inconsistent, the next-hop switch is used as the second target switch to execute the step of sending a name service query request to the next-hop switch of the second target switch.

7. A name service query device in an FC switching network, characterized in that: include: A determination module, used for determining a master switch in an FC switching network, each switch in the FC switching network having a corresponding switch name, and the master switch storing a name service database; a sending module, configured to, when a parameter of a first target switch in the FC switching network changes, cause the first target switch to send a directional notification to the master switch, wherein the destination address set in the directional notification is the address of the master switch; An updating module, configured for the master switch to receive the directed announcement and update the name service database based on the directed announcement; a judgment module, configured to judge whether the requested switch is a directly connected node of the second target switch based on the name service query request when the second target switch in the FC switching network receives the name service query request; a first query module, configured to obtain query data corresponding to the switch name of the requested switch in the storage space of the second target switch if the requested switch is a directly connected node of the second target switch; A first returning module, used for returning the query data to the requester of the name service query request; A second query module, configured to send the name service query request to the master switch if the requested switch is not a directly connected node of the second target switch; A third query module, configured for the master switch to obtain query data corresponding to the requested switch in the name service database based on the name service query request; The second returning module returns the query data to the requester of the name service query request.

8. The device according to claim 7, characterized in that The second query module is specifically used for: then sending a name service query request to the next-hop switch of the second target switch; The next-hop switch determines whether the address of the main switch in the name service query request is consistent with the address of the next-hop switch; If they are inconsistent, the next-hop switch is used as the second target switch to execute the step of sending a name service query request to the next-hop switch of the second target switch.

9. An electronic device, characterized in that: comprising a memory and a processor, wherein: The memory is used to store the computer program; The processor is used to execute the computer program to implement the name service query method in the FC switching network according to any one of claims 1 to 6.

10. A computer-readable storage medium, characterized in that: Used to store a computer program, wherein when the computer program is executed by a processor, the name service query method in the FC switching network according to any one of claims 1 to 6 is implemented.