共查询到20条相似文献,搜索用时 118 毫秒
1.
杨玉平 《计算机光盘软件与应用》2010,(1):16-16
本文介绍了利用用Ghost企业版的多播功能进行网络多播克隆的技巧和方法,如何进行多播克隆服务器的安装以及客户端引导盘的制作,计算机模板映像文件的生成等。 相似文献
2.
介绍PXE技术及工作环境,分析网络多播克隆的实现原理,实现了PXE和TFTP技术相结合的Ghost多播克隆过程. 相似文献
3.
HUA Hui 《数字社区&智能家居》2008,(35)
该文介绍了利用GHOST7.5进行网络多播克隆的方法与技巧,论述了如何通过利用Ghost7.5企业版的网络远程功能,将DHCP服务和TFTP文件传输与PXE网络启动功能相结合,实现了局域网内计算机系统在无软驱和光驱情况下的网络多播克隆. 相似文献
4.
当前在计算机职业实验实训教学中,计算机系统维护工作一直是项非常繁重、繁琐的日常工作。该文通过阐述利用PXE引导技术结合ghostSrv网络多播克隆软件实现网络多播克隆,这一方法的具体实现过程,描述了PXE技术在机房维护方面的一个具体应用。 相似文献
5.
对目前计算机网络机房维护技术中,采用的Ghost多播功能进行了详细的研究,并详细指出了进行网络克隆快速恢复计算机软件系统的具体实现步骤。 相似文献
6.
该文讲述基于网络的高校计算机机房管理,运用网络多播克隆、硬盘还原卡从理论以及实践技术方面阐述了对计算机机房管理的有效性。 相似文献
7.
基于主动网络的可靠多播路由协议 总被引:1,自引:0,他引:1
主动网络是一种允许用户对网络中间节点进行编程的新型网络结构,该文在多播网络系统模型基础上,探讨了主动网络可靠多播协议的特点和多播路由问题,提出了一个基于主动网络的可靠多播路由协议模型,该协议较好地减少了网络中大量的路由重构和分组的重传,缩短了错误发现和恢复时间。最后,利用仿真实验作了相关计算,给出了RMRPA协议的性能分析及与不可靠多播协议的比较。研究结果表明RMRPA协议为多媒体多播传输提供了一种新的有效途径。 相似文献
8.
一种新型的可重排多播网络 总被引:3,自引:0,他引:3
在并行分布式系统中,多播操作(包括一对多播送和多源点多播)是一种常见的操作,关于多播操作(尤其是多源点多播)的研究是一个有一定难度,但又具有重要应用价值的问题,也是目前升级互连网络研究领域中的一个热门课题,已有的关于多播的成果大多只针对现有的多级网络,并且一般只能实现单个多播。Yang在[3]中针对多源点多播的并发。提出了一种新的多播网络,硬件复杂度为O(Nlog^2N).本文提出了一种基于Omega网的多播网络(5-Omega网),通过重排各级开关的状态,可以并发的实现任意的多源点多播,所需开关元件总数为5/2NlongN,与Yang提出的多播网络相比,硬件代价小得多,同时,5-Omega网上的多播路由时间复杂度能达到O(NlogN),在相关的成果中也算是最优的,并且由于Omega网的结构较为简单,这种网的硬件集成也非常容易,因此更具有实用价值,在这种网络的构造基础上,还提出了一种新的多播网络模型,为以后设计多播网络提供了一种参考方法。 相似文献
9.
10.
11.
Ghost是最著名的硬盘复制备份工具,其企业版能通过网络同时从一台电脑上克隆多台电脑硬盘。具体阐述了在NortonGhost企业版的组播服务实施各环节中所应注意的问题以及改进方法。这些环节包括客户机引导盘的制作、母机映像文件的生成以及网络组播克隆。 相似文献
12.
Topology Design of Network-Coding-Based Multicast Networks 总被引:1,自引:0,他引:1
Kaikai Chi Xiaohong Jiang Horiguchi S. Minyi Guo 《Parallel and Distributed Systems, IEEE Transactions on》2008,19(5):627-640
It is anticipated that a large amount of multicast traffic needs to be supported in future communication networks. The network coding technique proposed recently is promising for establishing multicast connections with a significantly lower bandwidth requirement than that of traditional Steiner-tree-based multicast connections. How to design multicast network topologies with the consideration of efficiently supporting multicast by the network coding technique becomes an important issue now. It is notable, however, that the conventional algorithms for network topology design are mainly unicast-oriented, and they cannot be adopted directly for the efficient topology design of network-coding-based multicast networks by simply treating each multicast as multiple unicasts. In this paper, we consider for the first time the novel topology design problem of network-coding-based multicast networks. Based on the characteristics of multicast and network coding, we first formulate this problem as a mixed-integer nonlinear programming problem, which is NP-hard, and then propose two heuristic algorithms for it. The effectiveness of our heuristics is verified through simulation and comparison with the exhaustive search method. We demonstrate in this paper that, in the topology design of multicast networks, adopting the network coding technique to support multicast transmissions can significantly reduce the overall topology cost as compared to conventional unicast-oriented design and the Steiner-tree-based design. 相似文献
13.
14.
15.
已有研究证明,在多播网络中使用网络编码可以显著提高多播通信的性能。总结了网络编码多播理论的研究进展,同时对网络编码多播路由问题进行了研究与分析。考虑到影响链路负载和资源消耗的因素,提出了一种改进链路负载均衡的网络编码多播路由算法,优化了路径间链路的共享。通过使用常见的Waxman网络拓扑模型,产生随机网络拓扑。在这些拓扑中,分别针对传统IP多播路由、低速率网络下的网络编码多播路由以及提出的路由算法进行性能仿真。仿真结果表明,与其他两种路由算法相比,该算法在可达吞吐量、资源消耗和负载均衡等性能上均有很好的表现。 相似文献
16.
Most existing multicast protocols adopt a static retransmission scheme(unicast or multicast) to retransmit lost packets.In the mobile multicast environment,static multicast retransmission mode may lead to congestion in the receivers‘ wireless interfaces,while static unicast mode may result in great network load.Both static unicast and multicast retransmission modes will cause a performance loss.This paper logically divides the mobile multicast network into fixed and mobile parts,and focuses on the mobile part.Then this paper analyzes the retransmission costs when multicast or unicast mode is chosen.Two main parameters are used to compare their efficiencies:the average air-interface utilization of each receiver and the average network load.Based on the results of analysis,two new algorithms,called NLPA(Network Load Priority Algorithm)and AUPA(Air-interface Utilization Priority Algorithm)are presented.Finally,simulation results conclude that,with proper parameters,both NLPA and AUPA can dynamically alternate between unicast and multicast retransmission modes acording to the conditions of network and receiver,and avoid congestion in receivers‘ wireless interfaces as well as great network load,with a better use of network and terminal resources. 相似文献
17.
Yuanyuan Yang Jianchao Wang 《Parallel and Distributed Systems, IEEE Transactions on》2003,14(2):131-141
Multicast communication involves transmitting information from a single source to multiple destinations and is a requirement in high-performance networks. Current trends in networking applications indicate an increasing demand in future networks for multicast capability. Many multicast applications require not only multicast capability, but also predictable communication performance such as guaranteed multicast latency and bandwidth. In this paper, we present a design for a nonblocking k-fold multicast network, in which any destination node can be involved in up to k simultaneous multicast connections in a nonblocking manner. We also develop an efficient routing algorithm for the network. As can be seen, a k-fold multicast network has significantly lower network cost than that of k copies of ordinary 1-fold multicast networks and is a cost effective choice for supporting arbitrary multicast communication. 相似文献
18.
19.
We investigate the problem of maximizing multicast throughput under a fairness constraint. Multiple server nodes wish to communicate to their intended set of client nodes over a shared network infrastructure. Our goal is to devise distributed algorithms to construct multicast sessions, one for each server node, such that (a) the network infrastructure is optimally utilized and (b) the network resources are fairly distributed between multicast sessions, i.e., no individual session claims more than a prescribed share of the network bandwidth resources. We are particularly interested in multi-tree multicast strategies in which every multicast session may contain many multicast trees. We show how the use of multiple trees increases network throughput and the load distribution in the network. We propose a class of round-robin algorithms that are based on successive selection of multicast trees for each multicast session, in a loosely cooperative, yet distributed fashion. Our best algorithm, the Cooperative Shortest Path Tree Packing (CSPTP) algorithm, performs well in a variety of scenarios, ranging from very sparse to dense applications. Through extensive simulations on random networks, we compare the performance of our algorithms with those commonly used in IP-multicast as well as theoretical upper bounds derived from network coding formulations. We show that the CSPTP can improve the throughput, and often achieves about 90% of the theoretical upper bound. 相似文献