The inter-city linkage heat data provided by Baidu Migration is employed as a characterization of inter-city linkages in order to facilitate the study of the network linkage characteristics and hierarchical structure ...The inter-city linkage heat data provided by Baidu Migration is employed as a characterization of inter-city linkages in order to facilitate the study of the network linkage characteristics and hierarchical structure of urban agglomeration in the Greater Bay Area through the use of social network analysis method.This is the inaugural application of big data based on location services in the study of urban agglomeration network structure,which represents a novel research perspective on this topic.The study reveals that the density of network linkages in the Greater Bay Area urban agglomeration has reached 100%,indicating a mature network-like spatial structure.This structure has given rise to three distinct communities:Shenzhen-Dongguan-Huizhou,Guangzhou-Foshan-Zhaoqing,and Zhuhai-Zhongshan-Jiangmen.Additionally,cities within the Greater Bay Area urban agglomeration play different roles,suggesting that varying development strategies may be necessary to achieve staggered development.The study demonstrates that large datasets represented by LBS can offer novel insights and methodologies for the examination of urban agglomeration network structures,contingent on the appropriate mining and processing of the data.展开更多
The stable multicast flow aggregation （MFA） problem in internet protocol （IP） over optical network under the dynamical scenario is studied. Given an optical network topology, there is a set of head ends and access...The stable multicast flow aggregation （MFA） problem in internet protocol （IP） over optical network under the dynamical scenario is studied. Given an optical network topology, there is a set of head ends and access touters attached to the optical network, in which each head end can provide a set of programs （IP multicasting flows） and each access router requests a set of programs, we find a set of stable light-trees to accommodate the optimally aggregated multicast IP flows if the requests of access touters changed dynamically. We introduce a program correlation matrix to describe the preference of end users＇ requests. As the original MFA problem is NP-complete, a heuristic approach, named most correlated program first （MCPF）, is presented and compared with the extended least tree first （ELTF） algorithm which is topology- aware. Simulation results show that MCPF can achieve better performance than ELTF in terms of stability with negligible increment of network resource usage.展开更多
文摘The inter-city linkage heat data provided by Baidu Migration is employed as a characterization of inter-city linkages in order to facilitate the study of the network linkage characteristics and hierarchical structure of urban agglomeration in the Greater Bay Area through the use of social network analysis method.This is the inaugural application of big data based on location services in the study of urban agglomeration network structure,which represents a novel research perspective on this topic.The study reveals that the density of network linkages in the Greater Bay Area urban agglomeration has reached 100%,indicating a mature network-like spatial structure.This structure has given rise to three distinct communities:Shenzhen-Dongguan-Huizhou,Guangzhou-Foshan-Zhaoqing,and Zhuhai-Zhongshan-Jiangmen.Additionally,cities within the Greater Bay Area urban agglomeration play different roles,suggesting that varying development strategies may be necessary to achieve staggered development.The study demonstrates that large datasets represented by LBS can offer novel insights and methodologies for the examination of urban agglomeration network structures,contingent on the appropriate mining and processing of the data.
基金the National Natural Science Foundation of China (No.60502004) and the"863"Program of China.
文摘The stable multicast flow aggregation （MFA） problem in internet protocol （IP） over optical network under the dynamical scenario is studied. Given an optical network topology, there is a set of head ends and access touters attached to the optical network, in which each head end can provide a set of programs （IP multicasting flows） and each access router requests a set of programs, we find a set of stable light-trees to accommodate the optimally aggregated multicast IP flows if the requests of access touters changed dynamically. We introduce a program correlation matrix to describe the preference of end users＇ requests. As the original MFA problem is NP-complete, a heuristic approach, named most correlated program first （MCPF）, is presented and compared with the extended least tree first （ELTF） algorithm which is topology- aware. Simulation results show that MCPF can achieve better performance than ELTF in terms of stability with negligible increment of network resource usage.
