The current study about lock schemes in SAN is summarized and it is concluded that distributing mutex information to shared disk and related nodes is the promising direction in the future. A new data structure named reticulation is presented to solve the problem that an existing distributed lock scheme has low efficiency in transferring messages among nodes in which it uses double linked lists to organize all the nodes in SAN. Reticulation structure's algorithms of adding and deletting nodes and its design of fault tolerance are given and their performance analyses are done. A simulation model is also implemented to prove the conclusions. What is more, the reticulation structure can also be used in applications in which messages need to be broadcasted and the information of nodes is distributed.