scispace - formally typeset
Search or ask a question
Topic

Network planning and design

About: Network planning and design is a research topic. Over the lifetime, 12393 publications have been published within this topic receiving 229776 citations. The topic is also known as: network design.


Papers
More filters
Proceedings ArticleDOI
Lu Zhang1, Lin Yang1, Tao Yang1
04 Oct 2010
TL;DR: A cognitive-based interference management solution for LTE-Advanced (LTE-A) femtocells by sharing measured pathloss information among neighbors and selecting component carriers according to the estimated mutual interference is proposed.
Abstract: The concept of small cells such as femtocells has been regarded as a promising solution to overcome the indoor coverage problem and deal with the growth of traffic within macrocells. However, the unpredictable deployment pattern of such cells makes centralized network planning impractical and requires more efficient interference management and distributed spectrum planning schemes to realize the benefit of femtocells. In this paper, we propose a cognitive-based interference management solution for LTE-Advanced (LTE-A) femtocells by sharing measured pathloss information among neighbors and selecting component carriers according to the estimated mutual interference. System-level simulation results demonstrate that the proposed scheme can effectively avoid spectrum collision and significantly improve overall network capacity.

78 citations

Journal ArticleDOI
TL;DR: This paper proposes an optimisation model and a meta-heuristic algorithm for solving the urban network design problem and initial results show that the proposed approach allows local optimal solutions to be obtained in reasonable computation times.

78 citations

Journal ArticleDOI
TL;DR: TIDE is proposed, an intelligent network control architecture based on deep reinforcement learning that can dynamically optimize routing strategies in an SDN network without human experience and can improve the overall network transmitting delay by about 9% compared with traditional algorithms.

78 citations

Journal ArticleDOI
TL;DR: It is demonstrated how easily and efficiently extremely near minimax results can be achieved on a discrete set of sample points.
Abstract: A new and practical approach to computer-aided design optimization is presented. Central to the process is the application of least pth approximation using extremely large values of p, typically 1000 to 1 000 000. It is shown how suitable and reasonably well conditioned objective functions can be formulated, giving particular emphasis to more general approximation problems as, for example, in filter design. It is demonstrated how easily and efficiently extremely near minimax results can be achieved on a discrete set of sample points. Highly efficient gradient methods can be employed and, in network design problems, the use of the adjoint network approach for evaluating gradients results in greater savings in computer effort. A comparison between the Fletcher-Powell method and the more recent Fletcher method is made on the application of least pth approximation, using a range of values of p up to 1 000 000 000 000 on transmission-line transformer problems for which optimal minimax solutions are known. This is followed by filter design examples subject to certain constraints.

78 citations

Journal ArticleDOI
TL;DR: Three generic facility location models for the integrated distribution and collection of products that accommodate a variety of applications and industries are developed and a Lagrangian relaxation-based solution algorithm is developed that is both quick and effective.
Abstract: Recent research on reverse logistics and closed-loop supply chains has produced a number of specialized network design models. We develop three generic facility location models for the integrated distribution and collection of products that accommodate a variety of applications and industries. These models quantify the value of integrated decision making in the design of forward and reverse logistics networks throughout different stages of a product's life cycle. The formulations extend the uncapacitated fixed-charge location model to include the location of used product collection centers and the assignment of product return flows to these centers. In addition, we develop a Lagrangian relaxation-based solution algorithm that is both quick and effective. We measure the implications of integrated decision making by comparing the total facility and transportation costs of our joint optimization models with the cost of solutions in which forward and reverse facility location decisions are made sequentially or independently of one another. In addition, we discuss the implications of integrated decision making on network configuration and introduce a new network similarity measure to quantify this analysis. Computational results are also presented.

78 citations


Network Information
Related Topics (5)
Optimization problem
96.4K papers, 2.1M citations
85% related
Network packet
159.7K papers, 2.2M citations
84% related
Wireless network
122.5K papers, 2.1M citations
84% related
Node (networking)
158.3K papers, 1.7M citations
83% related
Wireless
133.4K papers, 1.9M citations
82% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
202390
2022195
2021432
2020493
2019570
2018573