In this paper, we study the problem of resource allocation in small cell networks with distributed caching, that is, how to divide the spectrum resources for backhaul and access in order to improve network performance...In this paper, we study the problem of resource allocation in small cell networks with distributed caching, that is, how to divide the spectrum resources for backhaul and access in order to improve network performance. We formulate our concerned problem by using multi-dimensional Markov model. Our problem considers that each user may access multiple small cell base stations. We conduct simulation experiments to evaluate the performance of our proposed resource allocation scheme. Our simulation results show that the appropriate spectrum resource allocation is important to improve network performance.展开更多
Deep space networks,satellite networks,ad hoc networks,and the Internet can be modeled as DTNs(Delay Tolerant Networks).As a fundamental problem,the maximum flow problem is of vital importance for routing and service ...Deep space networks,satellite networks,ad hoc networks,and the Internet can be modeled as DTNs(Delay Tolerant Networks).As a fundamental problem,the maximum flow problem is of vital importance for routing and service scheduling in networks.However,there exists no permanent end-to-end path since the topology and the characteristics of links are time-variant,resulting in a crucial maximum flow problem in DTNs.In this paper,we focus on the single-source-single-sink maximum flow problem of buffer-limited DTNs,followed by a valid algorithm to solve it.First,the BTAG(Buffer-limited Time Aggregated Graph)is constructed for modeling the buffer-limited DTN.Then,on the basis of BTAG,the two-way cache transfer series and the relevant transfer rules are designed,and thus a BTAG-based maximum flow algorithm is proposed to solve the maximum flow problem in buffer-limited DTNs.Finally,a numerical example is given to demonstrate the effectiveness of the proposed algorithm.展开更多
基金supported in part by the National Natural Science Foundation of China (Grants Nos. 61571351, and 61401326)the important national science & technology specific projects 2015ZX03002006-003Natural Science Basic Research Plan in Shaanxi Province of China (Program Nos. 2016JM6028 and 2016JQ6054)
文摘In this paper, we study the problem of resource allocation in small cell networks with distributed caching, that is, how to divide the spectrum resources for backhaul and access in order to improve network performance. We formulate our concerned problem by using multi-dimensional Markov model. Our problem considers that each user may access multiple small cell base stations. We conduct simulation experiments to evaluate the performance of our proposed resource allocation scheme. Our simulation results show that the appropriate spectrum resource allocation is important to improve network performance.
基金supported by the National Science Foundation(Nos.91338115,61231008)National S&T Major Project(No.2015ZX03002006)+2 种基金the Fundamental Research Funds for the Central Universities(Nos.WRYB142208,JB140117)Shanghai Aerospace Science and Technology Innovation Fund(No.201454)the 111 Project(No.B08038).
文摘Deep space networks,satellite networks,ad hoc networks,and the Internet can be modeled as DTNs(Delay Tolerant Networks).As a fundamental problem,the maximum flow problem is of vital importance for routing and service scheduling in networks.However,there exists no permanent end-to-end path since the topology and the characteristics of links are time-variant,resulting in a crucial maximum flow problem in DTNs.In this paper,we focus on the single-source-single-sink maximum flow problem of buffer-limited DTNs,followed by a valid algorithm to solve it.First,the BTAG(Buffer-limited Time Aggregated Graph)is constructed for modeling the buffer-limited DTN.Then,on the basis of BTAG,the two-way cache transfer series and the relevant transfer rules are designed,and thus a BTAG-based maximum flow algorithm is proposed to solve the maximum flow problem in buffer-limited DTNs.Finally,a numerical example is given to demonstrate the effectiveness of the proposed algorithm.
