现今,许多网络存储提供商致力于将SAN(Storage Area Networking存储区域网络)中使用的光纤通道设定为一种实用标准,但是其架构需要高昂的建设成本,远非一般企业所能够承受。与之相对,NAS(NetworkAttachedStorage网络接入存储)技术虽然...现今,许多网络存储提供商致力于将SAN(Storage Area Networking存储区域网络)中使用的光纤通道设定为一种实用标准,但是其架构需要高昂的建设成本,远非一般企业所能够承受。与之相对,NAS(NetworkAttachedStorage网络接入存储)技术虽然成本低廉,但是却受到带宽限制,而且系统难以满足开放性的要求。而iSCSI(互联网小型计算机系统接口)技术以其独具特色的优异品质而成为存储技术的“闪光点”。 iSCSI由IBM下属的两大研发机构——加利福尼亚Almaden和以色列Haifa研究中心共同开发,是一个供硬件设备使用的可以在IP协议上层运行的SCSI指令集。展开更多
In order to share multimedia transmissions in mesh networks and optimize the utilization of network resources, this paper presents a Two-stage Evolutionary Algorithm (TEA), i.e., unicast routing evolution and multicas...In order to share multimedia transmissions in mesh networks and optimize the utilization of network resources, this paper presents a Two-stage Evolutionary Algorithm (TEA), i.e., unicast routing evolution and multicast path composition, for dynamic multicast routing. The TEA uses a novel link-duplicate-degree encoding, which can encode a multicast path in the link-duplicate-degree and decode the path as a link vector easily. A dynamic algorithm for adding nodes to or removing nodes from a multicast group and a repairing algorithm are also covered in this paper. As the TEA is based on global evaluation, the quality of the multicast path remains stabilized without degradation when multicast members change over time. Therefore, it is not necessary to rearrange the multicast path during the life cycle of the multicast sessions. Simulation results show that the TEA is efficient and convergent.展开更多
文摘现今,许多网络存储提供商致力于将SAN(Storage Area Networking存储区域网络)中使用的光纤通道设定为一种实用标准,但是其架构需要高昂的建设成本,远非一般企业所能够承受。与之相对,NAS(NetworkAttachedStorage网络接入存储)技术虽然成本低廉,但是却受到带宽限制,而且系统难以满足开放性的要求。而iSCSI(互联网小型计算机系统接口)技术以其独具特色的优异品质而成为存储技术的“闪光点”。 iSCSI由IBM下属的两大研发机构——加利福尼亚Almaden和以色列Haifa研究中心共同开发,是一个供硬件设备使用的可以在IP协议上层运行的SCSI指令集。
文摘In order to share multimedia transmissions in mesh networks and optimize the utilization of network resources, this paper presents a Two-stage Evolutionary Algorithm (TEA), i.e., unicast routing evolution and multicast path composition, for dynamic multicast routing. The TEA uses a novel link-duplicate-degree encoding, which can encode a multicast path in the link-duplicate-degree and decode the path as a link vector easily. A dynamic algorithm for adding nodes to or removing nodes from a multicast group and a repairing algorithm are also covered in this paper. As the TEA is based on global evaluation, the quality of the multicast path remains stabilized without degradation when multicast members change over time. Therefore, it is not necessary to rearrange the multicast path during the life cycle of the multicast sessions. Simulation results show that the TEA is efficient and convergent.
