The anycast communication protocol is to select the best server and the best route for a particular client from a group of replicated servers with the same contents. As users have come to demand contents with high QoS, the necessity to support the anycast communications in QoS networks has grown. In this paper, we propose a server and route selection method with application-level QoS-based anycast protocol. The protocol we propose has the following advantages. 1) The latest server and route information can be constantly acquired through distributed resource management by E-BB. 2) The server and route selection algorithm enable us to consider both the server load and network load simultaneously. 3) High reliability can be guaranteed by decentralized control.
In this paper. n e study allocation problems of multimedia files in distributed iietwork sgsterns. In these systems, the files are shared by users connect,ed with different, servers through high-speed communication networks. It is one of the most, important, problems in distributed systems how t,o assign the files to servers in view oi costs aiid delays. In these systems. it, is obvious that t,liere is a trading-off relat,ionship between costs and delays. Our objective is to find tlie optimal file allocation such that the t,otal cost is minimized subject t,o the tot,al dela,?. In order t o evaluate the optimization. we present a systein model that, can covers a wide range of inultiiiiedia network a,pplicat,ions such as VoD (Video on Demand), corporatioii inforinat,ion nelworks; and so on. We int,roduce a, 0-1 integer programming formulation for the optiinizat,iori problem. We find the optimal file allocat,iorr by solving these formulae. and quantify the general t~n d e n c y in distribut,ed systems. Moreover. we make a cornprison between t h e exhaustive search and the a.pproxiinate niet,hod that, we usr for opt,iniization. IntroductionRecently, varions inforniat,ioii and communication services have been provided to homes and individuals as well as businesses, 11) tlie developments of inult,iiiiedia network tecliiiology and the wide usage of workst,ations and personal compiit,ers. There has been a great, t,reiid bo shift, from ceiitralized systems t,o distributed systems. We mag' easily imagine that, it, will be preferable to allocat,e iniportant, and popiilar files in several servers duplicatelp in view of (,lie cost,. the delay. syst,eni scalability. reliabilil,y. and so 011. In distrihut,ed net.works. it is one of the most, i m portant problems how t,o allocat,e mult,iniedia files in t.he sysklns.These dist,ribut,cd t,eiiis consist of seseral servers. with niult,iuicdia databases, that separa.te to each other geographically. and rach server has a subnetwork with a nuniber of users. Each server is coil- Fig.1: A Distributed Informatioil Net,work Syst,eni nected t,o oiie another through a high-speed coninnnica.t,ion n?t,work, aud t,he mhole syst,ein works as a, distributed database s)-steiii (Fig.1). In t,hese dist,rihuted dat,ahase syst,ems. files must, be stored in at, least, oiie of servers, and are s h r e d by several users coniiected with different servers. Users can access any files stored in any servers. When tlie files are accessed frequently. copies of them should be stored in several servers. Each server should st,ore the files requested freyuently by its locd user to reduce &he communca,tion cost, and dela>-. Howrvcr. t,he cluplicat,ed st,ora,ge of [,he sa,nie file& ill t.he sgateni cause to iiicreasing in the st,ora.ge rost, t,o st,ore them. Also. there is necessity to keep tlie d a h consistency, and t,hen the rewriting cost is increasing. Moreover, we should t,ake account, of the difference between tlie local coniniunicat,ion costs aiid t,lie global coiiiinunicat~ioii costs described al~ove, which...
In this paper, we propose a distributed broadcasting algorithm with optimal time complexity and without message redundancy for one-toall broadcasting in the one-port communication model on arrangement graph interconnection networks. The algorithm exploits the hierarchical property of the arrangement graph to construct different-sized broadcasting trees for different-sized subgraphs. These different-sized broadcasting trees constitute a spanning tree on the arrangement graph. Every processor individually performs its broadcasting procedure based on the spanning tree. It is shown that a message can be broadcast to all the other n! (n−k)! − 1 processors in at most O(k lg n) steps on the (n, k)-arrangement graph interconnection network. The algorithm can also guarantee that each of processors on the arrangement graph interconnection network receives the message exactly once.The star graph [1] is one of the widely studied interconnection network topologies. It has been proposed as an attractive alternative to the hypercube with many superior characteristics. A major practical difficulty with the star graph is related to its number of nodes: n! for the n−star graph. Recently, a new interconnection network topology called the (n, k)-arrangement graph has been proposed in [5]. This topology is a generalized class of star graphs in the sense that a star graph is a special arrangement graph, and presents a cure for the design drawback of the star graph. It brings a solution to the problem of growth of the number n! of nodes in the n−star graph with respect to the dimension n. Namely, the (n, k)-arrangement graph has more flexibility in selecting the design parameters: size, diameter, and degree than the star graph. It also keeps all the desirable topological qualities of the star graph topology such as hierarchical structure, vertex and edge symmetry, simple routing and many fault tolerance properties.Broadcasting is one of the fundamental communication problems for distributed memory interconnection networks. In broadcasting, one processor (or node) has a message which needs to be communicated to everyone; such a processor is called the source of broadcasting and every other node to which the message needs to be sent is called the destination of broadcasting. Broadcasting is a very important operation used in various linear algebra algorithms, database queries, transitive closure algorithms, and linear programming algorithms. The interconnection network must facilitate efficient broadcasting so as to achieve high performance during execution of jobs.The efficiency of the broadcasting algorithms is characterized by the time complexity, the number of steps required, and the message complexity, the total number of messages exchanged, to complete the broadcasting. Hence, it is desirable to develop a broadcasting algorithm that optimizes both the time complexity and the message complexity. The broadcasting problems on the hypercube and the star graph have been investigated in recent years. In [8], Johnsson and Ho presented thr...
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.