Network virtualization enables service providers to instantiate virtual networks on a common physical infrastructure. Virtual networks are then allocated to clients in order to deploy or test their services. Thus, clients do not know how their traffic is routed, which server is responding, and which path is crossed. Service providers who own the physical infrastructure aim to share the load among multiple servers for traffic routing. However, those who do not own the infrastructure and want to lease it essay to concentrate all the traffic on one server and exactly the closest server. In this paper, we model the problems of load sharing on multiple servers and traffic concentration on one server as two mathematical programs. The objective functions correspond to service providers' aims under a delay constraint based on the M/D/1/N queue's mean sojourn time's formula. Due to its hardness, we provide an approximation of the delay constraint at low and medium traffic intensities. The approximation is analytically proved by the Taylor series development at a chosen point. Finally, through simulation and analytical models, we compare the performance of programs' optimal solutions. We notice that load sharing decreases the packet loss and jitter values. However, traffic concentration reduces the latency.

中文翻译：

---

网络虚拟化环境中的最佳流量路由

网络虚拟化使服务提供商能够在公共物理基础设施上实例化虚拟网络。然后将虚拟网络分配给客户端以部署或测试他们的服务。因此，客户端不知道他们的流量是如何路由的，哪个服务器正在响应，以及穿过哪个路径。拥有物理基础设施的服务提供商旨在在多个服务器之间共享负载以进行流量路由。然而，那些不拥有基础设施并想租用它的人会说将所有流量集中在一台服务器上，而且恰好是最近的服务器。在本文中，我们将多台服务器上的负载共享和一台服务器上的流量集中问题建模为两个数学程序。在基于 M/D/1/N 队列的延迟约束下，目标函数对应于服务提供商的目标 s 意思是逗留时间的公式。由于其硬度，我们提供了中低流量强度下延迟约束的近似值。该近似由选定点的泰勒级数发展分析证明。最后，通过仿真和分析模型，我们比较了程序最优解的性能。我们注意到负载共享减少了数据包丢失和抖动值。然而，流量集中减少了延迟。我们注意到负载共享减少了数据包丢失和抖动值。然而，流量集中减少了延迟。我们注意到负载共享减少了数据包丢失和抖动值。然而，流量集中减少了延迟。