Добірка наукової літератури з теми "Client-server topology"
Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями
Ознайомтеся зі списками актуальних статей, книг, дисертацій, тез та інших наукових джерел на тему "Client-server topology".
Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.
Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.
Статті в журналах з теми "Client-server topology"
1
Pan, Sen, and Bin Hu. "Design and Implementation of EPON Network Management System Based on RIA." Applied Mechanics and Materials 268-270 (December 2012): 1718–22. http://dx.doi.org/10.4028/www.scientific.net/amm.268-270.1718.
Повний текст джерелаАнотація:
Based on analyzing EPON Network architectures and EPON Network Management functional requirements, this paper designed an EPON Network management System according to configuration management, performance management, fault management, topology management, security management and log management, and achieved a system based on RIA technology and B/S mode. The client was written based on Flex framework and the server was written by JAVA. A middleware technology was used between client and server for communicating. Through the B/S mode and SNMP, the system has achieved a series of management functions of EPON network.
2
ZADOROZHNY, VLADIMIR, LOUIQA RASCHID, and AVIGDOR GAL. "SCALABLE CATALOG INFRASTRUCTURE FOR MANAGING ACCESS COSTS AND SOURCE SELECTION IN WIDE AREA NETWORKS." International Journal of Cooperative Information Systems 17, no. 01 (March 2008): 77–109. http://dx.doi.org/10.1142/s0218843008001786.
Повний текст джерелаАнотація:
A WAN environment, such as the Internet, connects a federation of hundreds of servers with tens of thousands of clients, which poses a substantial scalability challenge. Clients may choose among sources that vary in both their content and quality as well as in their access latencies. At the same time, Internet accessible data sources exhibit transient behavior; the unpredictable behavior of a dynamic WAN results in a wide variability in access cost (end-to-end latency). This motivates a need for a source selection strategy that requires maintaining access cost distributions (latency profiles) for each client/server pair. However, in the presence of hundreds of servers and thousands of clients, managing latency profiles cannot scale. We present a scalable methodology to manage latency profiles that use non-random associations between client/server pairs. Such non-random associations may be identified by topology-independent measures such as correlation and mutual information. We propose a Catalog infrastructure that implements our methodology and utilize non-randomly associated latency profiles to estimate access cost distribution for client/server pairs. We perform an extensive experimental study demonstrating feasibility and efficiency of our approach.
3
Syafrinal, Syafrinal. "Implementasi VoIP Sebagai Media Komunikasi pada Dinas Perhubungan Komunikasi Informasi dan Telematika Aceh." Jurnal JTIK (Jurnal Teknologi Informasi dan Komunikasi) 3, no. 2 (October 13, 2019): 64. http://dx.doi.org/10.35870/jtik.v3i2.88.
Повний текст джерелаАнотація:
The purpose of this study is to design and build voice communication over IP networks using the Briker operating system. The use of VoIP Server to make calls from VoIP clients to fellow VoIP clients, and from people's VoIP numbers to one of the VoIP clients, and also looking for a comparison of public IP client and local IP voice delay at Dishubkomintel Aceh. The research method consisted of several stages namely; 1) System Design, 2) Network Topology, 3) Server-Side Design, 4) Client-Side Design, 5) Operating System and Application Installation, 6) Configuration, 7) VoIP Network Connectivity Testing, and 8) VoIP Work Observation. From the test results, several conclusions can be drawn namely; 1) VoIP Server Briker has a role in handling SIP calls from all registered clients into the Briker Server, 2) Between VoIP clients can communicate two ways with each other when registered into the Briker Server, 3) Calls to public VoIP are made by pressing '9' which used as Outbound routes then continued by pressing the destination number, and 4) Calls from VoIP of the people to VoIP are made by pressing the VoIP phone number of the people connected to the VoIP Server and then received by VRR (Voice Response Response) which will be directed to the extension number headed.Keywords:Voice Communication, IP Network, VoIP, Briker
4
Xiao, Peng, Samuel Cheng, Vladimir Stankovic, and Dejan Vukobratovic. "Averaging Is Probably Not the Optimum Way of Aggregating Parameters in Federated Learning." Entropy 22, no. 3 (March 11, 2020): 314. http://dx.doi.org/10.3390/e22030314.
Повний текст джерелаАнотація:
Federated learning is a decentralized topology of deep learning, that trains a shared model through data distributed among each client (like mobile phones, wearable devices), in order to ensure data privacy by avoiding raw data exposed in data center (server). After each client computes a new model parameter by stochastic gradient descent (SGD) based on their own local data, these locally-computed parameters will be aggregated to generate an updated global model. Many current state-of-the-art studies aggregate different client-computed parameters by averaging them, but none theoretically explains why averaging parameters is a good approach. In this paper, we treat each client computed parameter as a random vector because of the stochastic properties of SGD, and estimate mutual information between two client computed parameters at different training phases using two methods in two learning tasks. The results confirm the correlation between different clients and show an increasing trend of mutual information with training iteration. However, when we further compute the distance between client computed parameters, we find that parameters are getting more correlated while not getting closer. This phenomenon suggests that averaging parameters may not be the optimum way of aggregating trained parameters.
5
Xiao, Mengbai, Hao Wang, Liang Geng, Rubao Lee, and Xiaodong Zhang. "An RDMA-enabled In-memory Computing Platform for R-tree on Clusters." ACM Transactions on Spatial Algorithms and Systems 8, no. 2 (June 30, 2022): 1–26. http://dx.doi.org/10.1145/3503513.
Повний текст джерелаАнотація:
R-tree is a foundational data structure used in spatial databases and scientific databases. With the advancement of networks and computer architectures, in-memory data processing for R-tree in distributed systems has become a common platform. We have observed new performance challenges to process R-tree as the amount of multidimensional datasets become increasingly high. Specifically, an R-tree server can be heavily overloaded while the network and client CPU are lightly loaded, and vice versa. In this article, we present the design and implementation of Catfish, an RDMA-enabled R-tree for low latency and high throughput by adaptively utilizing the available network bandwidth and computing resources to balance the workloads between clients and servers. We design and implement two basic mechanisms of using RDMA for a client-server R-tree data processing system. First, in the fast messaging design, we use RDMA writes to send R-tree requests to the server and let server threads process R-tree requests to achieve low query latency. Second, in the RDMA offloading design, we use RDMA reads to offload tree traversal from the server to the client, which rescues the server as it is overloaded. We further develop an adaptive scheme to effectively switch an R-tree search between fast messaging and RDMA offloading, maximizing the overall performance. Our experiments show that the adaptive solution of Catfish on InfiniBand significantly outperforms R-tree that uses only fast messaging or only RDMA offloading in both latency and throughput. Catfish can also deliver up to one order of magnitude performance over the traditional schemes using TCP/IP on 1 and 40 Gbps Ethernet. We make a strong case to use RDMA to effectively balance workloads in distributed systems for low latency and high throughput.
6
Mykyjchuk, Mykola, and Nataliya Zihanshyn. "MODELING A NETWORK OF UNMANNED AERIAL VEHICLES." Measuring Equipment and Metrology 82, no. 3 (2021): 42–48. http://dx.doi.org/10.23939/istcmtm2021.03.042.
Повний текст джерелаАнотація:
The research concerns the methods of UAV group control in networks with duplex communication between nodes built on the "client-server" architecture. Such systems belong to self-organized networks with variable topology. It is important to study the allowable parameters of deviation from the task in the management of a group of UAVs and analysis of the network topology for the group flighting. The network was optimized according to the Ant Colony algorithm ACO. The application of different types of algorithms prevents routing problems in networks, such as ANTMANET, AntNet, ACODV and others. Methods of coordination of group joint actions are considered. A method is proposed by which the optimal number of UAVs operated by one operator can be determined and the traffic intensity of the communication channel is calculated, as well as the bandwidth and packet transmission delay are estimated.
7
Akmal, Sulthan Kharisma, Aji Gautama Putrada, and Febri Dawani. "A NETWORK PERFORMANCE COMPARISON OF WEBRTC AND SIP AUDIO AND VIDEO COMMUNICA TIONS." Journal of Information Technology and Its Utilization 4, no. 1 (June 30, 2021): 8. http://dx.doi.org/10.30818/jitu.4.1.3939.
Повний текст джерелаАнотація:
Multimedia services are one of the internet needs with high data traffic network count since 2019. Two of the multimedia services, Web Real-Time Communications (WebRTC) and Session Initiation Protocol (SIP), have been widely used in applications for conducting video conferencing. The main objective of this research is to analyze network performance by an application with a client-server for audio and video communications developed with WebRTC and SIP protocols. The SIP system uses the FreePBX server, and the softphone application uses Bria. Whereas WebRTC uses JavaScript with servers on Ubuntu using Node.js. The analysis application uses a star topology and runs on a local network using Wi-Fi. After testing, the results show that the throughput, jitter, and packet loss of WebRTC are better than SIP. This result is caused by several factors including the type of codec, the type of platform, and the way of signaling and routing of each protocol.
8
Hajaje, Hamid, Mouhcine Guennoun, and Zine El Abidine Guennoun. "Constraint-Based Privacy Preserving-Path Computation Element." International Journal of Smart Security Technologies 6, no. 2 (July 2019): 1–32. http://dx.doi.org/10.4018/ijsst.2019070101.
Повний текст джерелаАнотація:
Information privacy and protection is fundamental in the context of path computation. When a path computation client (PCC) requests the shortest path between two nodes from a path computation element (PCE), it desires to do so while protecting the sensitive information carried by the query as well as the overall topology of the network. The authors provide a novel framework to compute the shortest path, between a source and a destination, subject to a constraint, represented in the case by a required minimum bandwidth, while preserving the privacy of both client and server. By employing a secure homomorphic encryption scheme, the PCE can blindly compute the path while being oblivious to the content of the encrypted queries. The output of the PCE computation is an encrypted path that is only decipherable by its original secret key. The implementation using the homomorphic scheme over the integers from Van Dijk, Gentry, Halevi, and Vaikuntanathan (DGHV) shows promising results that the authors analyze in detail throughout this paper.
9
Afriansyah, Muhammad Faizal, Adian Fatchur Rochim, and Eko Didik Widianto. "Rancang Bangun Layanan Cloud Computing Berbasis IaaS Menggunakan Virtualbox." Jurnal Teknologi dan Sistem Komputer 3, no. 1 (January 30, 2015): 87–94. http://dx.doi.org/10.14710/jtsiskom.3.1.2015.87-94.
Повний текст джерелаАнотація:
Today, the growth of technology is very fast and a lot of technology that can facilitate users in helping their activity is made. A technology need a server to store both systems and users data. More users needed more servers to store user data. The server room became full and needed the extra space so that it required high cost to build the server and the server space itself. The purpose of this research is to create an IaaS based server virtualization that is connected to a router, switch, virtual client and administrator with VirtualBox application. The purpose of this research can be achieved by designing an appropriate research’s methodology. There are 5 stages of implementation/methodology in building virtualization server at this research which are the system definition, requirements specification, system configuration, system testing, and system analysis. First, phase of the definition system is by describing a system of early identification, system requirements and network topology on the implemented system. The second phase is the specification requirements to determine specifications hardware and software. The hardware consists of a computer with resources 8GB RAM and AMD Phenom II X6 as a processor. The software consists of VirtualBox and operating systems. The third stage is the system configuration to declare the source code in application on each server, routers and switches to perform the function of each device. The final stage is system testing and system analysis by checking the system is ready to use and works the best. Results in this research show IaaS-based server virtualization can be connected to display a web page on all clients through virtual switches and routers on a computer.
10
Tran, Duc Trong. "Spatial analysis in WebGIS." Science and Technology Development Journal 19, no. 2 (June 30, 2016): 75–81. http://dx.doi.org/10.32508/stdj.v19i2.671.
Повний текст джерелаАнотація:
In most of WebGIS applications, user interactions mainly concentrate on map data editing or data querying. Another aspect with paying less attention is to allow user doing spatial analysis. Spatial analysis can be implemented on server side, by using WPS (Web Processing Service), or on client side, by using JSTS (JavaScript Topology Suite). As an contribution to this aspect, this paper shows how to use to use WPS service of Geoserver and JSTS JavaScript library to carry on spatial analysis activities. A WebGIS system - based on the open source Geoserver and OpenLayers - has been developed and used to perform spatial analysis, searching for spatial features that have spatial relationships with other spatial features. Experiment result shows that the use of WPS and JSTS to perform spatial processing over the internet is practically doable.
Дисертації з теми "Client-server topology"
1
Баглай, Іванна Юріївна. "Онлайн-гра клієнт-серверної архітектури". Bachelor's thesis, КПІ ім. Ігоря Сікорського, 2020. https://ela.kpi.ua/handle/123456789/34948.
Повний текст джерелаАнотація:
Кваліфікаційна робота включає пояснювальну записку (58 с., 21 рис., 3 табл., список використаної літератури з 18 найменувань, 3 додатки).
Метою бакалаврського дипломного проєкту є дослідження та структуризація теоретичних відомостей, необхідних для розробки та реалізації онлайн-гри, і на основі отриманих даних розробити власну онлайн-гру клієнт-серверної архітектури.
Для досягнення поставленої мети проведено аналіз існуючих топологій з’єднання вузлів у мережі, шаблони проектів, призначених для синхронізації процесів, алгоритмів оптимізації кількості синхронізуючої інформації.
В результаті роботи було програмно реалізовано онлайн-гру, в якій було використано оптимальні та спеціалізовані під певну задачу алгоритми. Перевагою даного проєкту є абстрактність розробленої архітектури, що реалізує синхронізацію.
Результати дипломної роботи можуть бути використанні для вивчення основних концепцій онлайн-гри. А розроблена архітектура синхронізації може бути використана для розробки мережевих ігор.
При розробці онлайн-гри було використано ресурси: мова програмування С++, програма імітації умов мережі clumsy, програма візуалізації роботи потоків в реальному часі Tracy Profiler.Qualification work includes an explanatory note (56 pages, 21 figures, 3 tables, list of references from 18 items, 3 appendices). The purpose of the bachelor's thesis project is to study and structure the theoretical information needed to develop and implement an online game, and on the basis of the data to develop their own online game client-server architecture. To achieve this goal, the analysis of existing topologies of connection of nodes in the network, project templates designed to synchronize processes, algorithms for optimizing the amount of synchronizing information. As a result of the work, an online game was implemented in software, in which optimal and specialized algorithms for a certain task were used. The advantage of this project is the abstractness of the developed architecture that implements synchronization. The results of the thesis can be used to study the basic concepts of online gaming. And the developed synchronization architecture can be used for development of network games. Resources were used in the development of the online game: C ++ programming language, a program for simulating the conditions of the clumsy network, a program for visualizing the work of streams in real time Tracy Profiler.
2
Igugu, Onajite Johnson. "LAPSync : a Location-Aware Protocol for Remote File Synchronization." Thesis, Högskolan Väst, Institutionen för ingenjörsvetenskap, 2012. http://urn.kb.se/resolve?urn=urn:nbn:se:hv:diva-4460.
Повний текст джерелаАнотація:
Commercial provisioning of file synchronization services (FSS) relies entirely on protocols that utilize a remote central server that is often located in the cloud to host important files. Updates at user computers are propagated to the central server and from the central server to other sources in need of such updates. Therefore, a synchronization operation between two computers located on the same network often results in file data transmission to and from this local network at least twice. This introduces an unnecessary bandwidth usage on a user’s local network and has become an issue, especially since there is an increase in the demands for internet resources. This thesis work presents a new file synchronization protocol towards FSS known as LAPSync (location-aware protocol for remote file synchronization). This paper also proposes a hierarchical synchronization mechanism by utilizing LAPSync. Our proposed solution relies on the ability of LAPSync clients to acquire knowledge about the location of clients participating in the synchronization operation to construct a hierarchical synchronization path. Finally, we implement our protocol into a prototype and conduct experiments to compare with drop-box (a popular file synchronization service). The results obtained show that LAPSync offers a reduction in bandwidth usage when the files to be synchronized exist on the same local network
Частини книг з теми "Client-server topology"
1
Andrés, Mirian, Vico Pascual, Ana Romero, and Julio Rubio. "Remote Access to a Symbolic Computation System for Algebraic Topology: A Client-Server Approach." In Lecture Notes in Computer Science, 635–42. Berlin, Heidelberg: Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11428862_86.
Повний текст джерела
2
Adogbeji, Oghenevwogaga Benson, and Esharenana E. Adomi. "Computer Networking of Cybercafés in Delta State, Nigeria." In Database Technologies, 1454–61. IGI Global, 2009. http://dx.doi.org/10.4018/978-1-60566-058-5.ch087.
Повний текст джерелаАнотація:
The convergence of information and communication technology as embodied in the Internet has transformed the present day society into a knowledge society. Earlier, information and knowledge were passed by word of mouth or through manuscripts, and communication was a slow process, but today information is passed from one individual to an infinite number of other users through a number of media and formats which makes rapid and widespread dissemination of information possible (Preeti, 2006). This information dissemination has been so easy today due to the advent of computer network. Computer network is the interconnection of two or more computers for the purpose of sharing resources; this may involve the sharing of common database, software, printer etc. In networking, one may use peer-to-peer model or the client/server model. The peer-to-peer model is a decentralized networking model, which means all account administration is local to each machine and each machine maintains its own account database. In this model, each computer is equal or “peer” of the others. None of the members has total control over the others. This networking may involve the use of hub if the systems are more than two but none of the workstation has total control of the others. However, client/server type of network model is the type of network model, which is defined by the presence of server on the network that provides security and administration of the network. The server enables centralized database security and backup (Adogbeji & Adomi, 2005). In order for the cyber cafés in Nigeria to be able to have access to the entire world and give access to users, there comes the need to network their computers. This they do using client/server model and star topology. This chapter investigates networking patterns in cybercafes in Delta state. It explores the types of network adopted locally, types of networking model adopted in the cafes, reasons for adopting the models, types of networking topology adopted and problems inherited in the networking pattern adopted. Recommendations for improvement are also set forth.
Тези доповідей конференцій з теми "Client-server topology"
1
Iyer, Natraj, Yagnanarayanan Kalyanaraman, Kuiyang Lou, Subramaniam Jayanti, and Karthik Ramani. "A Reconfigurable 3D Engineering Shape Search System: Part I — Shape Representation." In ASME 2003 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. ASMEDC, 2003. http://dx.doi.org/10.1115/detc2003/cie-48180.
Повний текст джерелаАнотація:
This paper presents an approach for a reconfigurable shape search system for 3D engineering models using a client-serverdatabase architecture. The current paper focuses on the server functionality, while a subsequent paper will focus on the database issues. The server takes the shape query as input from the client and converts it into feature vectors and a new skeletal graph representation which we have developed. The algorithms such as voxelization, skeletonization, and skeletal graph extraction for accomplishing these are described in detail. The principal advantages of the skeletal graph representation are that (i) it preserves the geometry and topology of the query model, (ii) it is considerably smaller than the B-Rep graph, and (iii) it is insensitive to minor perturbations in shape, while sensitive enough to capture the major features of a shape. Our representation is also synergistic with the human cognitive representation of shape. The results indicate that the skeletal graph is considerably smaller than the B-Rep graph even for complicated shapes.