In this paper, we focus on the intermediate nodes of network and quantification of level of commodity and its cost on each node because intermediate nodes have stocking capacities which we generally see in the supply ...In this paper, we focus on the intermediate nodes of network and quantification of level of commodity and its cost on each node because intermediate nodes have stocking capacities which we generally see in the supply chain network. The commodity is supplied from a node to node in response to the power form of demand at a particular time. Since the traffic intensity of the demand of commodity also affects the flow of the commodity in the network, hence study of flow of commodity in the network is believed to be a significant contribution in this area. Several cases of quantifying the level of commodity in different situations as well as the cost analysis of incoming and outgoing commodity at a particular node have been thoroughly discussed in the paper. The present problem, presumably seeks to contribute to managerial decision making in supply chain network.展开更多
边缘计算将计算资源部署在离终端用户更近的边缘计算节点,从待选的位置中选择合适的边缘计算节点部署位置能提升边缘计算服务的节点容量以及用户服务质量(QoS)。然而,目前对于如何放置边缘计算节点以降低边缘计算成本的研究较少。此外,...边缘计算将计算资源部署在离终端用户更近的边缘计算节点,从待选的位置中选择合适的边缘计算节点部署位置能提升边缘计算服务的节点容量以及用户服务质量(QoS)。然而,目前对于如何放置边缘计算节点以降低边缘计算成本的研究较少。此外,在边缘服务的时延等QoS因素的约束下,目前尚没有一种边缘计算节点部署算法能最大限度地提高边缘服务的鲁棒性同时最小化边缘节点部署成本。针对上述问题,首先,通过建立计算节点、用户传输时延和鲁棒性的模型将边缘计算节点放置问题转化为带约束条件的最小支配集问题;随后,提出重合支配的概念,基于重合支配衡量网络鲁棒性,设计了基于重合支配的边缘计算节点放置算法——CHAIN(edge server plaCement algoritHm based on overlApping domINation)。仿真实验结果表明,与面向覆盖的近似算法和面向基站的随机算法相比,CHAIN的系统时延降低了50.54%与50.13%。展开更多
文摘In this paper, we focus on the intermediate nodes of network and quantification of level of commodity and its cost on each node because intermediate nodes have stocking capacities which we generally see in the supply chain network. The commodity is supplied from a node to node in response to the power form of demand at a particular time. Since the traffic intensity of the demand of commodity also affects the flow of the commodity in the network, hence study of flow of commodity in the network is believed to be a significant contribution in this area. Several cases of quantifying the level of commodity in different situations as well as the cost analysis of incoming and outgoing commodity at a particular node have been thoroughly discussed in the paper. The present problem, presumably seeks to contribute to managerial decision making in supply chain network.
文摘边缘计算将计算资源部署在离终端用户更近的边缘计算节点,从待选的位置中选择合适的边缘计算节点部署位置能提升边缘计算服务的节点容量以及用户服务质量(QoS)。然而,目前对于如何放置边缘计算节点以降低边缘计算成本的研究较少。此外,在边缘服务的时延等QoS因素的约束下,目前尚没有一种边缘计算节点部署算法能最大限度地提高边缘服务的鲁棒性同时最小化边缘节点部署成本。针对上述问题,首先,通过建立计算节点、用户传输时延和鲁棒性的模型将边缘计算节点放置问题转化为带约束条件的最小支配集问题;随后,提出重合支配的概念,基于重合支配衡量网络鲁棒性,设计了基于重合支配的边缘计算节点放置算法——CHAIN(edge server plaCement algoritHm based on overlApping domINation)。仿真实验结果表明,与面向覆盖的近似算法和面向基站的随机算法相比,CHAIN的系统时延降低了50.54%与50.13%。
