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.
Guaranteeing quality of service is a key problem to multimedia stream in mobile Ad Hoc networks. The related works study the channel delay and bandwidth based on the MAC layer; however, there is little focus on queue delay. In a mobile environment, the changing of queue is quite different from those in static conditions. How to calculate the queue delay is a challenging question in mobile Ad Hoc networks...
We consider the problem of optimizing the performance of a network coding router with two stochastic flows. We develop a queueing model which accounts for the fact that coding is not performed when packets are transmitted, but is done by a separate program or hardware which operates independently of the hardware that sends packets out over links. We formulate and solve a constrained optimization problem...
In this paper, we present a queuing theoretic approach to a general class of healthcare systems. We derived new expressions to assess the effect of service outages and use the resulting model to approximate patient flow times. We study the harmful impact of service interruptions on patient flow times. In addition, we present an optimization model to determine the optimum number of doctors/service...
In the Internet, premium services require to keep a very small delay tail probability with respect to some delay threshold. Such a small probability is difficult to measure in real time due to the large measurement variability. Practical approaches measure the traffic statistics instead and derive the tail probability by queueing analysis. In this paper, we show that an accurate estimator based on...
In dynamic wireless networks, effective modeling on link behavior would lead the network protocol design towards a predictive and reasonable way. Emerging mobile ad hoc network (MANET), however, is of self-organizing and infrastructureless paradigm, where topology dynamics are highly related to many complicated parameters, such as node density, mobility model, and transmission range etc, which make...
The diverse types of service beared on the large-scale IP network makes bandwidth allocation a research focus. This paper proposes a dynamic and fine-grained bandwidth allocation method which is suitable for large-scale network. We extends Norros' Fractional Brownian Motion (FBM) model to make it fit for the allocation of service bandwidth in IP network. Through identifying and analyzing different...
The extension scale of port is analyzed in the perspective of quantitative analysis. The optimization model for increasing the number of berths is built and then solved by using the queuing theory. The optimal extension scale of port is resulted. This model is applied to the study on the extension scale of Chongqing Cuntan Port.
A new network-worm-control technology is proposed after having fully analyzed the differences between worm and normal connection requests. Considering the worm characteristic of attacking unique port and dispersing IP addresses, the method uses multiple data sets according to the different ports to avoid the influence among the ports. Aiming at the normal connection characteristic of ephemeral bursting...
Peer-to-peer (P2P) live streaming applications are very popular in recent years and a Markov open queueing network model was developed to study the population dynamics in P2P live streaming. Based on the model, we deduce an optimization problem, called population transition problem, with the objective of maximizing the probability of universal streaming by manipulating population transition probability...
According to different priority based services, IEEE 802.16e WiMAX standard classifies packets as UGS, RTPS, eRTPS, nRTPS, BE. The standard treats all packets generated while browsing the internet as delay tolerant packets and classifies them as Best Effort (BE) packets. This includes BE packets generated while browsing secure websites. However, secure transactions are governed by time constraints...
To address the problems of network congestion, Active queue management (AQM) is advocated to improve the quality of services (QoS) for Internet. Random early detective (RED) algorithm is one of notably AQM mechanism, because it could reduce the high drop rate of bursty flows, avoid global synchronization among flows and reduces network latency (“ping time”). However, RED requires careful tuning of...
Wireless mesh networks with multi-beam capability at each node through the use of multi-antenna beamforming are becoming practical and attracting increased research attention. Increased capacity due to spatial reuse and increased transmission range are potential benefits in using multiple directional beams in each node. In this paper, we are interested in low-complexity scheduling algorithms in such...
Queue scheduling algorithm achieves the assignment of the network resource through scheduling strategy, the reserved bandwidth and delaytime can be guaranteed, then the router select the next packet waiting for forwarding from one or more queues based on some rules, All input network services can share the output bandwidth according to reserved way, to have corresponding resource, and to meet service...
Heterogeneous Wireless Networks are considered nowadays as one of the potential areas in research and development. The traffic management schemes that have been used at the fusion points between the different wireless networks are classical and conventional. This paper is focused on developing a novel scheme to overcome the problem of traffic congestion in the fusion point router interconnected the...
In this paper, two different architectures of the iSLIP scheduling algorithm are implemented by hardware, and the delay limitation of this algorithm is indicated by comparing their performances. Then a matrix model is proposed for analyzing the reason of delay limitation, and the conclusion is that the pointer conflict causes the large area and delay in essence. Finally, the non-conflict RR scheduling...
In this paper, queueing systems with impatient customers is surveyed in accordance with various dimensions. First, we introduce the impatient behaviors (balking and reneging) and their various rules proposed in literature. Second, analytic solutions, numerical solutions and simulation modeling of the queue with impatient customers are investigated. Third, we propose the optimization both from the...
As the number of requiring multimedia streaming and broadcasting such as IPTV through wireless access network, to provide efficient mobility in access network can be important issue. Proxy Mobile Internet Protocol (PMIP) is aimed for network side mobility support without Mobile Node side processing. In this paper, we extended our previous work by developing mathematical analysis which contains 2 state...
Aimed at the problem of multi-objective optimization, solution on the oversaturated signalized intersection by using fuzzy logic control (FLC) is presented. The essential and characteristics of multi-objective optimization in urban traffic signal control are analysed. The performance measures of minimizing average delay, stop times and average queue length are established, according to the initial...
High-speed routers rely on well-designed packet buffers that support multiple queuing, large capacity and short response times. Some researchers suggested a combined SRAM/DRAM hierarchical buffer architecture to meet these challenges. However, both the SRAM and DRAM need to maintain a large number of dynamic queues which is a real challenge in practice and limits the scalability of these approaches...
This paper analyzes the loss process distribution of a finite buffer queue. In contrast to the previous work that assumed the buffer can merely store finite number of packets, our model adopts the bounded delay policy where only the packet arrival finding its delay not exceeding a preset value is admitted into the buffer. The quantity of interest is the probability distribution of the number of lost...
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.