The question of whether an ideal network exists with global scalability in its full life cycle has always been a first-principles problem in the research of network systems and architectures.Thus far,it has not been p...The question of whether an ideal network exists with global scalability in its full life cycle has always been a first-principles problem in the research of network systems and architectures.Thus far,it has not been possible to scientifically practice the design criteria of an ideal network in a unimorphic network system,making it difficult to adapt to known services with clear application scenarios while supporting the ever-growing future services with unexpected characteristics.Here,we theoretically prove that no unimorphic network system can simultaneously meet the scalability requirement in a full cycle in three dimensions—the service-level agreement(S),multiplexity(M),and variousness(V)—which we name as the“impossible SMV triangle”dilemma.It is only by transforming the current network development paradigm that the contradiction between global scalability and a unified network infrastructure can be resolved from the perspectives of thinking,methodology,and practice norms.In this paper,we propose a theoretical framework called the polymorphic network environment(PNE),the first principle of which is to separate or decouple application network systems from the infrastructure environment and,under the given resource conditions,use core technologies such as the elementization of network baselines,the dynamic aggregation of resources,and collaborative software and hardware arrangements to generate the capability of the“network of networks.”This makes it possible to construct an ideal network system that is designed for change and capable of symbiosis and coexistence with the generative network morpha in the spatiotemporal dimensions.An environment test for principle verification shows that the generated representative application network modalities can not only coexist without mutual influence but also independently match well-defined multimedia services or custom services under the constraints of technical and economic indicators.展开更多
Heterogeneous graphs generally refer to graphs with different types of nodes and edges.A common approach for extracting useful information from heterogeneous graphs is to use meta-graphs,which can be seen as a special...Heterogeneous graphs generally refer to graphs with different types of nodes and edges.A common approach for extracting useful information from heterogeneous graphs is to use meta-graphs,which can be seen as a special kind of directed acyclic graph with same node and edge types as the heterogeneous graph.However,how to design proper metagraphs is challenging.Recently,there have been many works on learning suitable metagraphs from a heterogeneous graph.Existing methods generally introduce continuous weights for edges that are independent of each other,which ignores the topological structures of meta-graphs and can be ineffective.To address this issue,the authors propose a new viewpoint from tensor on learning meta-graphs.Such a viewpoint not only helps interpret the limitation of existing works by CANDECOMP/PARAFAC(CP)decomposition,but also inspires us to propose a topology-aware tensor decomposition,called TENSUS,that reflects the structure of DAGs.The proposed topology-aware tensor decomposition is easy to use and simple to implement,and it can be taken as a plug-in part to upgrade many existing works,including node classification and recommendation on heterogeneous graphs.Experimental results on different tasks demonstrate that the proposed method can significantly improve the state-of-the-arts for all these tasks.展开更多
基金supported by the National Key Research and Development Program of China(2022YFB2901403)the Songshan Laboratory Project(221100210900-02).
文摘The question of whether an ideal network exists with global scalability in its full life cycle has always been a first-principles problem in the research of network systems and architectures.Thus far,it has not been possible to scientifically practice the design criteria of an ideal network in a unimorphic network system,making it difficult to adapt to known services with clear application scenarios while supporting the ever-growing future services with unexpected characteristics.Here,we theoretically prove that no unimorphic network system can simultaneously meet the scalability requirement in a full cycle in three dimensions—the service-level agreement(S),multiplexity(M),and variousness(V)—which we name as the“impossible SMV triangle”dilemma.It is only by transforming the current network development paradigm that the contradiction between global scalability and a unified network infrastructure can be resolved from the perspectives of thinking,methodology,and practice norms.In this paper,we propose a theoretical framework called the polymorphic network environment(PNE),the first principle of which is to separate or decouple application network systems from the infrastructure environment and,under the given resource conditions,use core technologies such as the elementization of network baselines,the dynamic aggregation of resources,and collaborative software and hardware arrangements to generate the capability of the“network of networks.”This makes it possible to construct an ideal network system that is designed for change and capable of symbiosis and coexistence with the generative network morpha in the spatiotemporal dimensions.An environment test for principle verification shows that the generated representative application network modalities can not only coexist without mutual influence but also independently match well-defined multimedia services or custom services under the constraints of technical and economic indicators.
基金National Key Research and Development Program of China,Grant/Award Number:2023YFB2903904。
文摘Heterogeneous graphs generally refer to graphs with different types of nodes and edges.A common approach for extracting useful information from heterogeneous graphs is to use meta-graphs,which can be seen as a special kind of directed acyclic graph with same node and edge types as the heterogeneous graph.However,how to design proper metagraphs is challenging.Recently,there have been many works on learning suitable metagraphs from a heterogeneous graph.Existing methods generally introduce continuous weights for edges that are independent of each other,which ignores the topological structures of meta-graphs and can be ineffective.To address this issue,the authors propose a new viewpoint from tensor on learning meta-graphs.Such a viewpoint not only helps interpret the limitation of existing works by CANDECOMP/PARAFAC(CP)decomposition,but also inspires us to propose a topology-aware tensor decomposition,called TENSUS,that reflects the structure of DAGs.The proposed topology-aware tensor decomposition is easy to use and simple to implement,and it can be taken as a plug-in part to upgrade many existing works,including node classification and recommendation on heterogeneous graphs.Experimental results on different tasks demonstrate that the proposed method can significantly improve the state-of-the-arts for all these tasks.
