773 resultados para Testbeds, Denial Of Service
Resumo:
Purpose –This paper explores and expands the roles of customers and companies in creating value by introducing a new a customer-based approach to service. The customer’s logic is examined as being the foundation of a customer-based marketing and business logic. Design/methodology/approach – The authors argue that both goods-dominant logics and service-dominant logics are provider-dominant. Contrasting the customer-dominant logic with provider-dominant logics, the paper examines the creation of service value from the perspectives of value-in-use, the customer’s own context, and the customer’s experience of service. Findings –Moving from a provider-dominant logic to a customer-dominant logic uncovered five major challenges to service marketers: Company involvement, company control in co-creation, visibility of value creation, locus of customer experience, and character of customer experience. Research limitations/implications – The paper is exploratory. It presents and discusses a conceptual model and suggests implications for research and practice. Practical implications –Awareness of the mechanisms of customer logic will provide businesses with new perspectives on the role of the company in their customer’s lives. We propose that understanding the customer’s logic should represent the starting-point for the marketer’s business logic. Originality/value – The paper increases the understanding of how the customer’s logic underpins the customer-dominant business logic. By exploring consequences of applying a customer-dominant logic, we suggest further directions for theoretical and empirical research.
Resumo:
States regularly deploy elements of their armed forces abroad. When that happens, the military personnel concerned largely remain governed by the penal law of the State that they serve. This extraterritorial extension of national criminal law, which has been treated as axiomatic in domestic law and ignored by international law scholarship, is the subject of this dissertation. The first part of the study considers the ambit of national criminal law without any special regard to the armed forces. It explores the historical development of the currently prevailing system of territorial law and looks at the ambit that national legal systems claim today. Turning then to international law, the study debunks the oddly persistent belief that States enjoy a freedom to extend their laws to extraterritorial conduct as they please, and that they are in this respect constrained only by some specific prohibitions in international law. Six arguments historical, empirical, ideological, functional, doctrinal and systemic are advanced to support a contrary view: that States are prohibited from extending the reach of their legal systems abroad, unless they can rely on a permissive principle of international law for doing so. The second part of the study deals specifically with State jurisdiction in a military context, that is to say, as applied to military personnel in the strict sense (service members) and various civilians serving with or accompanying the forces (associated civilians). While the status of armed forces on foreign soil has transformed from one encapsulated in the customary concept of extraterritoriality to a modern regulation of immunities granted by treaties, elements of armed forces located abroad usually do enjoy some degree of insulation from the legal system of the host State. As a corollary, they should generally remain covered by the law of their own State. The extent of this extraterritorial extension of national law is revealed in a comparative review of national legislation, paying particular attention to recent legal reforms in the United States and the United Kingdom two states that have sought to extend the scope of their national law to cover the conduct of military contractor personnel. The principal argument of the dissertation is that applying national criminal law to service members and associated civilians abroad is distinct from other extraterritorial claims of jurisdiction (in particular, the nationality principle or the protective principle of jurisdiction). The service jurisdiction over the armed forces has a distinct aim: ensuring the coherence and indivisibility of the forces and maintaining discipline. Furthermore, the exercise of service jurisdiction seeks to reduce the chances of the State itself becoming internationally liable for the conduct of its service members and associated civilians. Critically, the legal system of the troop-deploying State, by extending its reach abroad, seeks to avoid accountability gaps that might result from immunities from host State law.
Resumo:
The high cost and extraordinary demands made on sophisticated air defence systems, pose hard challenges to the managers and engineers who plan the operation and maintenance of such systems. This paper presents a study aimed at developing simulation and systems analysis techniques for the effective planning and efficient operation of small fleets of aircraft, typical of the air force of a developing country. We consider an important aspect of fleet management: the problem of resource allocation for achieving prescribed operational effectiveness of the fleet. At this stage, we consider a single flying-base, where the operationally ready aircraft are stationed, and a repair-depot, where the planes are overhauled. An important measure of operational effectiveness is ‘ availability ’, which may be defined as the expected fraction of the fleet fit for use at a given instant. The tour of aircraft in a flying-base, repair-depot system through a cycle of ‘ operationally ready ’ and ‘ scheduled overhaul ’ phases is represented first by a deterministic flow process and then by a cyclic queuing process. Initially the steady-state availability at the flying-base is computed under the assumptions of Poisson arrivals, exponential service times and an equivalent singleserver repair-depot. This analysis also brings out the effect of fleet size on availability. It defines a ‘ small ’ fleet essentially in terms of the important ‘ traffic ’ parameter of service rate/maximum arrival rate.A simulation model of the system has been developed using GPSS to study sensitivity to distributional assumptions, to validate the principal assumptions of the analytical model such as the single-server assumption and to obtain confidence intervals for the statistical parameters of interest.
Resumo:
We develop new scheduling algorithms for the IEEE 802.16d OFDMA/TDD based broadband wireless access system, in which radio resources of both time and frequency slots are dynamically shared by all users. Our objective is to provide a fair and efficient allocation to all the users to satisfy their quality of service.
Resumo:
This paper reports new results concerning the capabilities of a family of service disciplines aimed at providing per-connection end-to-end delay (and throughput) guarantees in high-speed networks. This family consists of the class of rate-controlled service disciplines, in which traffic from a connection is reshaped to conform to specific traffic characteristics, at every hop on its path. When used together with a scheduling policy at each node, this reshaping enables the network to provide end-to-end delay guarantees to individual connections. The main advantages of this family of service disciplines are their implementation simplicity and flexibility. On the other hand, because the delay guarantees provided are based on summing worst case delays at each node, it has also been argued that the resulting bounds are very conservative which may more than offset the benefits. In particular, other service disciplines such as those based on Fair Queueing or Generalized Processor Sharing (GPS), have been shown to provide much tighter delay bounds. As a result, these disciplines, although more complex from an implementation point-of-view, have been considered for the purpose of providing end-to-end guarantees in high-speed networks. In this paper, we show that through ''proper'' selection of the reshaping to which we subject the traffic of a connection, the penalty incurred by computing end-to-end delay bounds based on worst cases at each node can be alleviated. Specifically, we show how rate-controlled service disciplines can be designed to outperform the Rate Proportional Processor Sharing (RPPS) service discipline. Based on these findings, we believe that rate-controlled service disciplines provide a very powerful and practical solution to the problem of providing end-to-end guarantees in high-speed networks.
Resumo:
We provide a comparative performance evaluation of packet queuing and link admission strategies for low-speed wide area network Links (e.g. 9600 bps, 64 kbps) that interconnect relatively highspeed, connectionless local area networks (e.g. 10 Mbps). In particular, we are concerned with the problem of providing differential quality of service to interLAN remote terminal and file transfer sessions, and throughput fairness between interLAN file transfer sessions. We use analytical and simulation models to study a variety of strategies. Our work also serves to address the performance comparison of connectionless vs. connection-oriented interconnection of CLNS LANS. When provision of priority at the physical transmission level is not feasible, we show, for low-speed WAN links (e.g. 9600 bps), the superiority of connection-oriented interconnection of connectionless LANs, with segregation of traffic streams with different QoS requirements into different window flow controlled connections. Such an implementation can easily be obtained by transporting IP packets over an X.25 WAN. For 64 kbps WAN links, there is a drop in file transfer throughputs, owing to connection overheads, but the other advantages are retained, The same solution also helps to provide throughput fairness between interLAN file transfer sessions. We also provide a corroboration of some of our modelling results with results from an experimental test-bed.
Resumo:
Service discovery is vital in ubiquitous applications, where a large number of devices and software components collaborate unobtrusively and provide numerous services without user intervention. Existing service discovery schemes use a service matching process in order to offer services of interest to the users. Potentially, the context information of the users and surrounding environment can be used to improve the quality of service matching. To make use of context information in service matching, a service discovery technique needs to address certain challenges. Firstly, it is required that the context information shall have unambiguous representation. Secondly, the devices in the environment shall be able to disseminate high level and low level context information seamlessly in the different networks. And thirdly, dynamic nature of the context information be taken into account. We propose a C-IOB(Context-Information, Observation and Belief) based service discovery model which deals with the above challenges by processing the context information and by formulating the beliefs based on the observations. With these formulated beliefs the required services will be provided to the users. The method has been tested with a typical ubiquitous museum guide application over different cases. The simulation results are time efficient and quite encouraging.
Resumo:
In this paper, we consider the problem of association of wireless stations (STAs) with an access network served by a wireless local area network (WLAN) and a 3G cellular network. There is a set of WLAN Access Points (APs) and a set of 3G Base Stations (BSs) and a number of STAs each of which needs to be associated with one of the APs or one of the BSs. We concentrate on downlink bulk elastic transfers. Each association provides each ST with a certain transfer rate. We evaluate an association on the basis of the sum log utility of the transfer rates and seek the utility maximizing association. We also obtain the optimal time scheduling of service from a 3G BS to the associated STAs. We propose a fast iterative heuristic algorithm to compute an association. Numerical results show that our algorithm converges in a few steps yielding an association that is within 1% (in objective value) of the optimal (obtained through exhaustive search); in most cases the algorithm yields an optimal solution.
Resumo:
In this paper we develop and numerically explore the modeling heuristic of using saturation attempt probabilities as state dependent attempt probabilities in an IEEE 802.11e infrastructure network carrying packet telephone calls and TCP controlled file downloads, using enhanced distributed channel access (EDCA). We build upon the fixed point analysis and performance insights. When there are a certain number of nodes of each class contending for the channel (i.e., have nonempty queues), then their attempt probabilities are taken to be those obtained from saturation analysis for that number of nodes. Then we model the system queue dynamics at the network nodes. With the proposed heuristic, the system evolution at channel slot boundaries becomes a Markov renewal process, and regenerative analysis yields the desired performance measures. The results obtained from this approach match well with ns2 simulations. We find that, with the default IEEE 802.11e EDCA parameters for AC 1 and AC 3, the voice call capacity decreases if even one file download is initiated by some station. Subsequently, reducing the voice calls increases the file download capacity almost linearly (by 1/3 Mbps per voice call for the 11 Mbps PHY)
Resumo:
This paper considers a firm real-time M/M/1 system, where jobs have stochastic deadlines till the end of service. A method for approximately specifying the loss ratio of the earliest-deadline-first scheduling policy along with exit control through the early discarding technique is presented. This approximation uses the arrival rate and the mean relative deadline, normalized with respect to the mean service time, for exponential and uniform distributions of relative deadlines. Simulations show that the maximum approximation error is less than 4% and 2% for the two distributions, respectively, for a wide range of arrival rates and mean relative deadlines. (C) 2013 Elsevier B.V. All rights reserved.
Resumo:
We have developed SmartConnect, a tool that addresses the growing need for the design and deployment of multihop wireless relay networks for connecting sensors to a control center. Given the locations of the sensors, the traffic that each sensor generates, the quality of service (QoS) requirements, and the potential locations at which relays can be placed, SmartConnect helps design and deploy a low-cost wireless multihop relay network. SmartConnect adopts a field interactive, iterative approach, with model based network design, field evaluation and relay augmentation performed iteratively until the desired QoS is met. The design process is based on approximate combinatorial optimization algorithms. In the paper, we provide the design choices made in SmartConnect and describe the experimental work that led to these choices. Finally, we provide results from some experimental deployments.
Resumo:
In this article, we present an exact theoretical analysis of an system, with arbitrary distribution of relative deadline for the end of service, operated under the first come first served scheduling policy with exact admission control. We provide an explicit solution to the functional equation that must be satisfied by the workload distribution, when the system reaches steady state. We use this solution to derive explicit expressions for the loss ratio and the sojourn time distribution. Finally, we compare this loss ratio with that of a similar system operating without admission control, in the cases of some common distributions of the relative deadline.
Resumo:
In this paper optical code-division multiple-access (O-CDMA) packet network is considered, which offers inherent security in the access networks. The application of O-CDMA to multimedia transmission (voice, data, and video) is investigated. The simultaneous transmission of various services is achieved by assigning to each user unique multiple code signatures. Thus, by applying a parallel mapping technique, we achieve multi-rate services. A random access protocol is proposed, here, where all distinct codes are used, for packet transmission. The codes, Optical Orthogonal Code (OOC), or 1D codes and Wavelength/Time Single-Pulse-per-Row (W/T SPR), or 2D codes, are analyzed. These 1D and 2D codes with varied weight are used to differentiate the Quality of Service (QoS). The theoretical bit error probability corresponding to the quality of each service is established using 1D and 2D codes in the receiver noiseless case and compared. The results show that, using 2D codes QoS in multimedia transmission is better than using 1D codes.
Resumo:
In the process of service provisioning, providing required service to the user without user intervention, with reduction of the cognitive over loading is a real challenge. In this paper we propose a user centred context aware collaborative service provisioning system, which make use of context along with collaboration to provide the required service to the user dynamically. The system uses a novel approach of query expansion along with interactive and rating matrix based collaboration. Performance of the system is evaluated in Mobile-Commerce environment. The results show that the system is time efficient and perform with better precision and recall in comparison with context aware system.
Resumo:
The mechanical behaviour of composite materials differs from that of conventional structural materials owing to their heterogeneous and anisotropic nature. Different types of defects and anomalies get induced in these materials during the fabrication process. Further, during their service life, the components made of composite materials develop different types of damage. The performance and life of such components is governed by the combined effect of all these defects and damage. While porosity, voids, inclusions etc., are some defects those can get induced during the fabrication of composites, matrix cracks, interface debonds, delaminations and fiber breakage are major types of service induced damage which are of concern. During the service life of components made of composites, one type of damage can grow and initiate another type of damage. For example, matrix cracks can gradually grow to the interface and initiate debonds. Interface debonds in a particular plane can lead to delaminations. Consequently, the combined effect of different types of distributed damage causes the failure of the component. A set of non-destructive evaluation (NDE) methods is well established for testing conventional metallic materials. Some of them can also be utilized for composite materials as they are, and in some cases with a little different approach or modification. Ultrasonics, Radiography, Thermography, Fiber Optics, Acoustic Emision Techniques etc., to name a few. Detection, evaluation and characterization of different types of defects and damage encountered in composite materials and structures using different NDE tools is discussed briefly in this paper.