968 resultados para Marshall, Wendy
Resumo:
In the IEEE 802.11 MAC layer protocol, there are different trade-off points between the number of nodes competing for the medium and the network capacity provided to them. There is also a trade-off between the wireless channel condition during the transmission period and the energy consumption of the nodes. Current approaches at modeling energy consumption in 802.11 based networks do not consider the influence of the channel condition on all types of frames (control and data) in the WLAN. Nor do they consider the effect on the different MAC and PHY schemes that can occur in 802.11 networks. In this paper, we investigate energy consumption corresponding to the number of competing nodes in IEEE 802.11's MAC and PHY layers in error-prone wireless channel conditions, and present a new energy consumption model. Analysis of the power consumed by each type of MAC and PHY over different bit error rates shows that the parameters in these layers play a critical role in determining the overall energy consumption of the ad-hoc network. The goal of this research is not only to compare the energy consumption using exact formulae in saturated IEEE 802.11-based DCF networks under varying numbers of competing nodes, but also, as the results show, to demonstrate that channel errors have a significant impact on the energy consumption.
Resumo:
The future convergence of voice, video and data applications on the Internet requires that next generation technology provides bandwidth and delay guarantees. Current technology trends are moving towards scalable aggregate-based systems where applications are grouped together and guarantees are provided at the aggregate level only. This solution alone is not enough for interactive video applications with sub-second delay bounds. This paper introduces a novel packet marking scheme that controls the end-to-end delay of an individual flow as it traverses a network enabled to supply aggregate- granularity Quality of Service (QoS). IPv6 Hop-by-Hop extension header fields are used to track the packet delay encountered at each network node and autonomous decisions are made on the best queuing strategy to employ. The results of network simulations are presented and it is shown that when the proposed mechanism is employed the requested delay bound is met with a 20% reduction in resource reservation and no packet loss in the network.
Resumo:
We present a generic Service Level Agreement (SLA)-driven service provisioning architecture, which enables dynamic and flexible bandwidth reservation schemes on a per-user or a per-application basis. Various session level SLA negotiation schemes involving bandwidth allocation, service start time and service duration parameters are introduced and analysed. The results show that these negotiation schemes can be utilised for the benefits of both end user and network provide such as getting the highest individual SLA optimisation in terms of Quality of Service (QoS) and price. A prototype based on an industrial agent platform has also been built to demonstrate the negotiation scenario and this is presented and discussed.
Resumo:
An equation is presented for calculating the fairness of dynamically adaptive packet schedulers such as dynamic weighted fair queuing (DWFQ). The fairness of static packet schedulers such as weighted fair queue (WFQ) can be found using the widely accepted Worst-case Fair Index. The fairness of DWFQ can be measured using an Adapted Worst-case Fairness Index (AWFI). The AWFI enables a direct comparison of fairness properties of the DWFQ or other dynamically adaptive schedulers with static/non-adaptive schedulers.
Resumo:
The development of wideband network services and the new network infrastructures to support them have placed much more requirements on current network management systems. Issues such as scalability, integrity and interoperability have become more important. Existing management systems are not flexible enough to support the provision of Quality of Service (QoS) in these dynamic environments. The concept of Programmable Networks has been proposed to address these requirements. Within this framework, CORBA is regarded as a middleware technology that can enable interoperation among the distributed entities founds in Programmable Networks. By using the basic CORBA environment in a heterogeneous network environment, a network manager is able to control remote Network Elements (NEs) in the same way it controls its local resources. Using this approach both the flexibility and intelligence of the overall network management can be improved. This paper proposes the use of two advanced features of CORBA to enhance the QoS management in a Programmable Network environment. The Transaction Service can be used to manage a set of tasks, whenever the management of elements in a network is correlated; and the Concurrency Service can be used to coordinate multiple accesses on the same network resources. It is also shown in this paper that proper use of CORBA can largely reduce the development and administration of network management applications.
Resumo:
This paper presents a new packet scheduling scheme called agent-based WFQ to control and maintain QoS parameters in virtual private networks (VPNs) within the confines of adaptive networks. Future networks are expected to be open heterogeneous environments consisting of more than one network operator. In this adaptive environment, agents act on behalf of users or third-party operators to obtain the best service for their clients and maintain those services through the modification of the scheduling scheme in routers and switches spanning the VPN. In agent-based WFQ, an agent on the router monitors the accumulated queuing delay for each service. In order to control and to keep the end-to-end delay within the bounds, the weights for services are adjusted dynamically by agents on the routers spanning the VPN. If there is an increase or decrease in queuing delay of a service, an agent on a downstream router informs the upstream routers to adjust the weights of their queues. This keeps the end-to-end delay of services within the specified bounds and offers better QoS compared to VPNs using static WFQ. This paper also describes the algorithm for agent-based WFQ, and presents simulation results. (C) 2003 Elsevier Science Ltd. All rights reserved.
Resumo:
This paper focuses on two main areas. We first investigate various aspects of subscription and session Service Level Agreement (SLA) issues such as negotiating and setting up network services with Quality of Service (QoS) and pricing preferences. We then introduce an agent-enhanced service architecture that facilitates these services. A prototype system consisting of real-time agents that represent various network stakeholders was developed. A novel approach is presented where the agent system is allowed to communicate with a simulated network. This allows functional and dynamic behaviour of the network to be investigated under various agent-supported scenarios. This paper also highlights the effects of SLA negotiation and dynamic pricing in a competitive multi-operator networks environment.
Resumo:
This paper is concerned with handling uncertainty as part of the analysis of data from a medical study. The study is investigating connections between the birth weight of babies and the dietary intake of their mothers. Bayesian belief networks were used in the analysis. Their perceived benefits include (i) an ability to represent the evidence emerging from the evolving study, dealing effectively with the inherent uncertainty involved; (ii) providing a way of representing evidence graphically to facilitate analysis and communication with clinicians; (iii) helping in the exploration of the data to reveal undiscovered knowledge; and (iv) providing a means of developing an expert system application.
Resumo:
Aims/hypothesis: Diabetic nephropathy, characterised by persistent proteinuria, hypertension and progressive kidney failure, affects a subset of susceptible individuals with diabetes. It is also a leading cause of end-stage renal disease (ESRD). Non-synonymous (ns) single nucleotide polymorphisms (SNPs) have been reported to contribute to genetic susceptibility in both monogenic disorders and common complex diseases. The objective of this study was to investigate whether nsSNPs are involved in susceptibility to diabetic nephropathy using a case-control design.
Methods: White type 1 diabetic patients with (cases) and without (controls) nephropathy from eight centres in the UK and Ireland were genotyped for a selected subset of nsSNPs using Illumina's GoldenGate BeadArray assay. A ? 2 test for trend, stratified by centre, was used to assess differences in genotype distribution between cases and controls. Genomic control was used to adjust for possible inflation of test statistics, and the False Discovery Rate method was used to account for multiple testing.
Results: We assessed 1,111 nsSNPs for association with diabetic nephropathy in 1,711 individuals with type 1 diabetes (894 cases, 817 controls). A number of SNPs demonstrated a significant difference in genotype distribution between groups before but not after correction for multiple testing. Furthermore, neither subgroup analysis (diabetic nephropathy with ESRD or diabetic nephropathy without ESRD) nor stratification by duration of diabetes revealed any significant differences between groups.
Conclusions/interpretation: The nsSNPs investigated in this study do not appear to contribute significantly to the development of diabetic nephropathy in patients with type 1 diabetes.