Our goal is to achieve deeper understanding of the limitation of queueing models, on one hand, and of common simulation practice, on the other hand, as tools for predicting performance of bandwidth sharing between competing TCP flows. In particular, we (i) present an overview of simulation problems that are expected to arise due to the very heavy tail of the distribution of the size of TCP flow...

Bandwidth-sharing networks as introduced by Massoulié & Roberts (1998) model the dynamic interaction among an evolving population of elastic flows competing for several links. With policies based on optimization procedures, such models are of interest both from a Queueing Theory and Operations Research perspective. In the present paper, we focus on bandwidth-sharing networks with capacities and...

Image secret sharing is a technique to share a secret image among the group of participants. These individual shares are useless on their own, but when specified numbers of shares are combined together it gives the original secret image. These image shares has size greater than or equal to size of original image, it require high bandwidth while transmission. Because of the excessive bandwidth r...

When designing and configuring an ATM-based B-ISDN, it remains difficult to guarantee the Quality of Service (QoS) for different service classes, while still allowing enough statistical sharing of bandwidth so that the network is efficiently utilized. These two goals are often conflicting. Guaranteeing QoS requires traffic isolation, as well as allocation of enough network resource (e.g. buffer...

Effective edge capacity provisioning is an important architectural component of the emerging Differentiated Service Internet. We propose a set of dynamic provisioning algorithms, which are operational at the edge routers of a differentiated services core network. These edge mechanisms include: i)ingress dynamic link sharing, which augments class based queueing techniques with bandwidth utility ...

A secret sharing scheme is a method to store information securely and reliably. Particularly, in the threshold secret sharing scheme (due to Shamir), a secret is divided into shares, encoded and distributed to parties, such that any large enough collection of parties can decode the secret, and a smaller (then threshold) set of parties cannot collude to deduce any information about the secret. W...

Several schemes for the transport of Internet data traac over ATM are currently being investigated by researchers as well as by standardization bodies. Typically, the main focus of these investigations has been on addressing and switching strategies. Relatively little attention has been given to the eecient allocation, utilization and management of the underlying ATM bandwidth, and to the eecie...

This paper uses hybrid control to model a problem of computer network systems, the dynamic behavior of bandwidth sharing among competing TCP traffic. It has been well known in the computer network community that well-behaved (TCP-friendly) congestion control mechanisms are crucial to the robustness of the Internet. Congestion control determines the transmission rate for each flow. Right now, mo...

in this paper, an interference management for multi-beam satellite network to enhance spectral efficiency is studied. first, a two-satellite for future generation satellite network using cognitive radio technology is provided.this network is composed of a secondary satellite and aprimary satellite where the primary satellite system does not suffer from severe destructive interferences coming fr...

Cognitive radio (CR) increases spectrum efficiency by allowing secondary users (SUs) to dynamically use the idle spectrum owned by primary users (PUs). This paper studies bandwidth allocation of SUs for throughput efficiency. Taking on consideration a scenario of five nodes on which two of them are Primary Users(PUs) and the other three are secondary users (SUs).What amount of bandwidth should ...