The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
In Service-oriented Architectures, business processes are realized by composing loosely coupled services. With the ongoing success of Web services technologies, the invocation of Web services goes beyond enterprises' borders. So, besides implementing required services within one enterprise, services can be purchased from external service providers. With a growing number and variety of services, enterprises...
The traditional formulation of the total value of information transfer is a multi-commodity flow problem. Here, each data source is seen as generating a commodity along a fixed route, and the objective is to maximize the total system throughput under some concept of fairness, subject to capacity constraints of the links used. This problem is well studied under the framework of network utility maximization...
We propose an admission control method at edge nodes. This method aims at maximizing network throughput and calculates an input traffic limitation ratio at each edge node, which is used for admission control. Since the proposed method only uses input traffic volume information, it does not need to take into account the traffic matrix among edge nodes. Therefore, this method can be easily applied to...
An analytical model has been developed to determine the suitable value of the fold k of a k-fold multicast network with different traffic loads under Poisson traffic with finite queue. We have derived stationary probability distribution for the network states and then derived expressions for the throughput, blocking probability and the probability of delayed service of the network. It has been found...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.