[Seminar] TS. Phạm Tuấn Minh, lúc 14:30, ngày 24/07/2019 tại Đại học PHENIKAA
Kính gửi các đồng nghiệp,
Trân trọng kính mời các đồng nghiệp tới tham dự buổi seminar của Đại học PHENIKAA.
Người trình bày: TS. Phạm Tuấn Minh. PHENIKAA University
Thời gian: Tạm hoãn do trùng lịch của Khoa CNTT (sẽ báo lại sau).
Địa điểm: Phòng 101, nhà B, Đại học PHENIKAA. Tổ 8, Yên Nghĩa, Hà Đông, Hà Nội
Tiêu đề: Mô hình hóa và giải quyết một số bài toán tối ưu trong mạng máy tính hiện đại
We present our models and algorithms for the performance optimization of 5G networks including the support of DTN (Delay Tolerant Network) for news dissemination in an urban area, the collaborative caching in ICNs (Information-Centric Network), and the online load balancing for NFV (Network Functions Virtualization).
In our study of news dissemination over a Delay Tolerant Network (DTN), the target application is the distribution of the electronic version of a newspaper in a large city. Therefore, although strict time constraints do not apply, spreading the information should be achieved within a reasonable delay. Our goal is to increase our understanding of the performance of a simple DTN environment when content is distributed solely through inter-contact of mobile nodes. If the delay is found to be excessive, we suggest the deployment of some data kiosks in the environment to better support the dissemination of content. We investigate both an upper bound and a lower bound of the number of data kiosks to distribute the content over a geographical area within an expected spreading time objective. We then address the question of the optimal location of data kiosks in a more realistic scenario where users move along a transportation system (like a subway or suburban train) that connects several regions.
For the collaborative caching problem in ICN, we model and analyze the interactions in price and caching investments among transit ISPs, access ISPs and content providers in ICN interconnection. For a simplified version of our economic model, we show analytically that ICN interconnection is feasible from an economic point of view and a stable state can be reached. Our numerical results illustrate the case where caching investment is profitable for an access ISP. Interestingly, we observe that in the marketplace described by our model there are more opportunities for competition in ICN interconnection thanks to caching.
Network Functions Virtualization (NFV) aims to support service providers to deploy various services in a more agile and cost-effective way. However, the softwarization and cloudification of network functions can result in severe congestion and low network performance. In this work, we propose a solution to address this issue. We analyze and solve the online load balancing problem using multipath routing in NFV to optimize network performance in response to the dynamic changes of user demands. In particular, we first formulate the optimization problem of load balancing as a mixed integer linear program for achieving the optimal solution. We then develop the ORBIT algorithm that solves the online load balancing problem. The performance guarantee of ORBIT is analytically proved in comparison with the optimal offline solution. The experiment results on real-world datasets show that ORBIT performs very well for distributing traffic of each service demand across multipaths without knowledge of future demands, especially under high-load conditions.
Rất mong mọi người sắp xếp thời gian tham dự.
Xin chân thành cảm ơn.