We represent a data network as a set of links shared by a dynamic number of competing flows. These flows are generated within sessions and correspond to the transfer of a random volume of data on a pre-defined network route. The evolution of the stochastic process describing the number of flows on all routes, which determines the performance of the data transfers, depends on how link capacity i...

An ad hoc network is a rapidly deployable wireless network that has no centralized control mechanism. Mobile devices in an ad hoc network request a variety of data types, including text and multimedia data. Different types of data need to be treated with different qualities of service. The implementation of service differentiation in wireless networks is very difficult because of device mobilit...

For solving problems of TCP in a long-fat network, a transport-layer protocol called XCP (eXplicit Control Protocol) has been proposed. XCP aims at realizing efficient congestion control by sending explicit feedback information from a router to source hosts. In the literature, there have been several simulation experiments for evaluating performance of XCP. However, stability of XCP in a genera...

Although intuitively clear, implementing the principle of postponement is challenging in business practice since it involves configuring a complete supply chain thereby hindering business implementation. An alternative approach to timing product supplies from a single firm perspectiveembedded in value network context is proposed based on more recent studies on the principles of postponement and...

In this paper, we demonstrate how a new network performance/efficiency measure, which captures demands, flows, costs, and behavior on networks, can be used to assess the importance of network components and their rankings. We provide new results regarding the measure, which we refer to as the Nagurney-Qiang measure, or, simply, the N-Q measure, and a previously proposed one, which did not expli...

We propose a traffic confirmation attack on lowlatency anonymous communication protocols based on computing robust real-time binary hashes of network traffic flows. Firstly, we adapt the Coskun-Memon Algorithm to construct hashes that can withstand network impairments to allow fast matching of network flows. The resulting attack has a low startup cost and achieves a true positive match rate of ...

Admission Control (AC) is an efficient way of dealing with congestion situations in a network. Using AC, when network resources in a path are not enough for all flows (i.e., during congestion), some of the flows receive the requested service and the rest do not. Congestion situations can be reduced by increasing network resources or by optimizing their use through better routing techniques, but...

In traffic engineering to effectively distribute traffic flows over multiple network paths, taking into account traffic characteristics for individual flows is vital in appropriately assigning flows to network paths for achieving better delay performance of the total traffic. All flows assigned to a path, in which some flows are heavily bursty, equally experience a significant queuing delay whe...

Today network security, uptime and performance of network are important and serious issue in computer network. Anomaly is deviation from normal behavior which is factor that affects on network security. So Anomaly Extraction which detects and extracts anomalous flow from network is requirement of network operator. Anomaly extraction refers to automatically finding in a large set of flows observ...

Abstract— The differentiated services architecture is receiving wide attention as a framework for providing different levels of service according to a service profile in the Internet. The current architecture allows aggregated flows sharing a service profile. This paper looks at the problem of achieving specific QoS goals of individual flows by flexibly managing resources available to an aggreg...