• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 1
  • Tagged with
  • 2
  • 2
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
1

Simulace lokalizace IP stanic pomocí algoritmů Vivaldi a GNP / Simulation of IP node localization, using Vivaldi and GNP algorithms

Sulík, Peter January 2011 (has links)
The work deals with the issues of network coordinate systems. The first chapter is devoted to a brief analysis of this systems and requirements placed on them. Furthermore, it deals with features of Vivaldi algorithm and its three versions: a centralized algorithm, algorithm with constant and adaptive time step. Subsequently it describes the GNP system and eash step of Nelder-Mead method for nodes localization. Next to it a developed simulation library is presented with its own graphical user interface for testing of these algorithms, which is capable of handling RTT responses database amongst individual IP network members. Simulations performed on data from PlanetLab network are evaluated in the conclusion.
2

NetClust: A Framework for Scalable and Pareto-Optimal Media Server Placement

Yin, H., Zhang, X., Zhan, T.Y., Zhang, Y., Min, Geyong, Wu, D.O. January 2013 (has links)
No / Effective media server placement strategies are critical for the quality and cost of multimedia services. Existing studies have primarily focused on optimization-based algorithms to select server locations from a small pool of candidates based on the entire topological information and thus these algorithms are not scalable due to unavailability of the small pool of candidates and low-efficiency of gathering the topological information in large-scale networks. To overcome this limitation, a novel scalable framework called NetClust is proposed in this paper. NetClust takes advantage of the latest network coordinate technique to reduce the workloads when obtaining the global network information for server placement, adopts a new Kappa -means-clustering-based algorithm to select server locations and identify the optimal matching between clients and servers. The key contribution of this paper is that the proposed framework optimizes the trade-off between the service delay performance and the deployment cost under the constraints of client location distribution and the computing/storage/bandwidth capacity of each server simultaneously. To evaluate the performance of the proposed framework, a prototype system is developed and deployed in a real-world large-scale Internet. Experimental results demonstrate that 1) NetClust achieves the lower deployment cost and lower delay compared to the traditional server selection method; and 2) NetClust offers a practical and feasible solution for multimedia service providers.

Page generated in 0.0383 seconds