Fair bandwidth allocation is one of the most challenging. research issues in the context of assured forwarding (AF) in the Differentiated Services (DiffServ) networks. There exist many works that tried to assure the f...
详细信息
Fair bandwidth allocation is one of the most challenging. research issues in the context of assured forwarding (AF) in the Differentiated Services (DiffServ) networks. There exist many works that tried to assure the fairness of bandwidth allocation. However, these works only focused on studying the simple case, in which multiple AF flows share a single bottleneck link, and they also lacked a solid theoretical analysis to validate themselves. In this paper, we propose a network-assist packet marking (NPM) scheme to offer fair bandwidth allocation among multiple aggregates. By both theoretical analysis and experimental evaluation, we demonstrate that NPM can fairly distribute bandwidth among these aggregates in both single and multiple bottleneck link networks.
The peer-to-peer technology offers many advantages, but at the same time, it poses many novel challenges for the research community. Modern peer-to-peer systems are characterized by large scale, poor reliability, and ...
详细信息
The peer-to-peer technology offers many advantages, but at the same time, it poses many novel challenges for the research community. Modern peer-to-peer systems are characterized by large scale, poor reliability, and extreme dynamism of the participating nodes, with a continuous flow of nodes joining and leaving the systems. Selection of an optimal network requires estimation of its rank using attributes such as storage, average load, cost, reliability etc. There are multiple networks, each vying for users business by providing them novel services. The user in turn has to decide which network best meets its service requirements and accordingly join a network. In this paper, we propose a model with two ranking schemes, one being network-specific and the other user-specific. The schemes use fuzzy logic to rank different networks based on their attributes. The difference between the two ranking schemes lie in the dynamism offered by them. The user-specific ranking criteria is flexible while the network-specific scheme uses a fixed criteria. The network-specific scheme helps in providing a structure to visualize the overall performance index of the networks. The user-specific scheme is adaptive in the sense that it caters to the specific needs of the users. The simulations performed by us show that the two schemes are light-weight, highly accurate and easily implementable
The paper proposes a prioritized traffic recovery model for generalized multiprotocol label switching (GMPLS) networks. The network traffic is differentiated into four classes, with the highest prioritized class achie...
详细信息
The paper proposes a prioritized traffic recovery model for generalized multiprotocol label switching (GMPLS) networks. The network traffic is differentiated into four classes, with the highest prioritized class achieving dedicated protection, the second prioritized class obtaining shared restoration, the third prioritized class attaining on-line restoration, and no recovery for the lowest prioritized class. The QoS performance of such a model is evaluated by extensive simulations. The results show that delay sensitive traffic receives the fastest recovery service, throughput sensitive traffic with light load takes a longer recovery time, and the throughput sensitive traffic with heavy load experiences the lowest recovery service
Ethernet passive optical networks (EPONs) address the first mile of the communication infrastructure between the service provider central offices and the customer sites. As a low-cost, high-speed technology, EPONs are...
详细信息
Ethernet passive optical networks (EPONs) address the first mile of the communication infrastructure between the service provider central offices and the customer sites. As a low-cost, high-speed technology, EPONs are deemed as the solution to the bottleneck problem of the broadband access network. This paper proposes a dynamic bandwidth allocation scheme to control the data delay over the EPON upstream channel. The theoretical analysis of the average delay and the delay reduction, in conjunction with the extensive simulations, demonstrates that our scheme provides effective data delay control over EPONs.
Achieving both high capacity efficiency and fast restoration speed is a primary goal of survivable design in WDM network. The p-cycle method aims to benefit from the fast restoration of ring-like protection and high c...
详细信息
Achieving both high capacity efficiency and fast restoration speed is a primary goal of survivable design in WDM network. The p-cycle method aims to benefit from the fast restoration of ring-like protection and high capacity efficiency of mesh protection. In this paper, we first present a p-cycle based method to deal with dynamic traffic in survivable WDM network design. In this method, we first find an optimal set of p-cycles for the given network topology. Next, we propose three routing strategies for accommodating dynamic requests upon their arrival time. The performance of our p-cycle based design using different routing strategies are compared with that of the shared backup path protection (SBPP). The results show that proposed p-cycle based design method performs better than SBPP in dense networks. Whereas SBPP performs better than the p-cycle based design in sparse networks.
The Radon transform (RT) is a widely studied algorithm used to perform image pattern extraction in fields such as computer graphics, medical imagery, and avionics. Real time implementation of the discrete RT (DRT) is ...
详细信息
The Radon transform (RT) is a widely studied algorithm used to perform image pattern extraction in fields such as computer graphics, medical imagery, and avionics. Real time implementation of the discrete RT (DRT) is extremely difficult due to its use of complex trigonometric functions and O(N/sup 3/) time complexity, making its use in video applications difficult. A O(N/sup 2/lgN) approximate discrete (ADRT) has been presented in literature (Brady, 1998) that allows highly parallel computation. This paper presents an architecture that uses the ADRT to create a computation architecture known as the xADRT. Performance analysis indicates that it can achieve a refresh rate of 10 frames per second for use in real time image processing applications.
Different architectural approaches for saving energy are considered for the ACS unit of a Viterbi decoder. It was found that although providing less throughput improvement than parallelism, pipelining is more energy e...
详细信息
Different architectural approaches for saving energy are considered for the ACS unit of a Viterbi decoder. It was found that although providing less throughput improvement than parallelism, pipelining is more energy efficient. The optimal mix of these two architectures favors more pipelining at lower throughput requirements
In this paper we use game theory to study nodes' behavior in peer-to-peer networks when nodes receive service based on their reputation. Reputation is used as a mechanism to incentivize nodes to share resources an...
详细信息
In this paper we use game theory to study nodes' behavior in peer-to-peer networks when nodes receive service based on their reputation. Reputation is used as a mechanism to incentivize nodes to share resources and provide services to others. The probability of a node obtaining service is directly proportional to its current reputation, and the only way to enhance reputation is by serving others. Thus, the problem of free-riding is minimized. Game theory can be used by individual selfish nodes to determine their optimal strategy for participation level in such a system. Moreover, game theory gives us interesting insight into the overall nature of nodes' interactions and system efficiency, and how system efficiency can be improved.
Internet computing is emerging as an important new paradigm in which resource intensive computing is integrated over Internet-scale networks. Over these large networks, different users and organizations share their co...
详细信息
Internet computing is emerging as an important new paradigm in which resource intensive computing is integrated over Internet-scale networks. Over these large networks, different users and organizations share their computing resources, and computations take place in a distributed fashion. In such an environment, a framework is needed in which the resource providers are given incentives to share their resources. CompuP2P is a light weight architecture for enabling Internet computing. It uses peer-to-peer networks for sharing of computing resources. CompuP2P create dynamic markets of network accessible computing resources, such as processing power, memory storage, disk space, etc., in a completely distributed, scalable, and fault-tolerant manner. This paper discusses the system architecture, functionality, and applications of the proposed CompuP2P architecture. We have implemented a Java based prototype, and our results show that the system is light-weight and can provide almost a perfect speedup for applications that contain several independent compute-intensive tasks
暂无评论