Scheduled System Maintenance:
On May 6th, system maintenance will take place from 8:00 AM - 12:00 PM ET (12:00 - 16:00 UTC). During this time, there may be intermittent impact on performance. We apologize for the inconvenience.
By Topic

Computers and Communication, 2003. (ISCC 2003). Proceedings. Eighth IEEE International Symposium on

Date 30 June-3 July 2003

Filter Results

Displaying Results 1 - 25 of 217
  • Towards knowledge management in autonomic systems

    Publication Year: 2003 , Page(s): 789 - 794 vol.2
    Cited by:  Papers (1)  |  Patents (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (292 KB) |  | HTML iconHTML  

    The classical definition of knowledge management promises to get the right knowledge to the right people at the right time so they can make the best decision [G. Petrash, 1996]. Autonomic systems, on the other hand, are expected to find and apply the right knowledge for self-managing purposes without human intervention. This article discusses the components to be built around a system to enable self-healing and managing capabilities. These are defined and described in this article as self-knowledge, self-monitoring, self-learning, problem detection, diagnosis, and search and solution components. Interaction of these system components to make knowledge available for self-healing purposes is also discussed. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • CSMA/IC: a new class of collision-free MAC protocols for ad hoc wireless networks

    Publication Year: 2003 , Page(s): 843 - 848 vol.2
    Cited by:  Papers (3)  |  Patents (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (264 KB) |  | HTML iconHTML  

    In this paper, we present a new collision-free MAC protocol-carrier sense media access with ID countdown (CSMA/IC) for ad hoc wireless networks that can achieve 100% collision-free performance by solving the "hidden terminal" problem and the concurrent sending problem. Compared to CSMA/IC of IEEE 802.11, it also improves the network's performance in decreasing the network's throughput significantly. Furthermore, it can enable different packets with different priority to access the media and thus gain QoS. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Intelligent agents serving based on the society information

    Publication Year: 2003 , Page(s): 763 - 768 vol.2
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (276 KB) |  | HTML iconHTML  

    In this paper, we propose a serving system consisting intelligent agents processing society information in a multi-user domain. The agents use the similarity information on the user preferences for providing services with the best quality. This similarity information is formed by using the clustering techniques. The agents are allowed to interact with others and exchange information based on this information. The agents' beliefs are formed based on the clustering process results and the user feedback for the information gained by the interactions. These beliefs are used to provide a continuous service for the user. The natural division of tasks among the agents reduces the workload for each agent. The cluster structure of the society may be changed according to the satisfaction levels of the users. Some general society parameters of the system are learned by a reinforcement learning method. We designed the agents by using our proposed social interactive agent model. The system model can be used for many of the serving systems by changing the service type. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • IPMA: an interference/power-aware MAC scheme for heterogeneous wireless networks

    Publication Year: 2003 , Page(s): 849 - 854 vol.2
    Cited by:  Papers (6)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (308 KB) |  | HTML iconHTML  

    In this paper, we propose the interference-aware power-engineered multiple access (IPMA) protocol for medium access control (MAC) in ad hoc networks and multihop wireless LANs. IPMA is the first distributed MAC protocol that is interference aware without relying on busy tone or dual transceivers per mobile device. Enabled by its interference awareness, IPMA can naturally support efficient power-controlled variable-radius multichannel transmissions, power engineering, and directional antennas. Our simulation results demonstrate that for the same radio bandwidth, IPMA can achieve considerably higher throughput in ad hoc networks as compared to previous RTS/CTS protocols that are not interference aware. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Dynamic slot allocation to control delay in TDMA wireless base station

    Publication Year: 2003 , Page(s): 1126 - 1131 vol.2
    Cited by:  Papers (1)  |  Patents (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (353 KB) |  | HTML iconHTML  

    A dynamic slot allocation scheme, called as DSA, to control packet delay in TDMA base station is presented in this paper. DSA applies multi-queue architecture and use the queue status of base station, corresponding to each mobile host, as a feedback to determine the required data rate of hosts. Adaptive rate control, dynamics priority and multi-queuing system are three pillars of DSA. In analysis, we illustrate how the proposed DSA controls the target queue dynamics. Then we investigate the relationship between queue dynamics and packet delay. As a result, the packet delay of each host is effectively controlled by the parameters. Simultaneously, the controlled target queue alleviates the buffer management of a base station. The simulation results show the well-controlled queue dynamics and delay of the proposed scheme, even under a condition of high traffic variation. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Analysis of admission control mechanisms using non-linear control theory

    Publication Year: 2003 , Page(s): 1306 - 1311 vol.2
    Cited by:  Papers (8)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (314 KB) |  | HTML iconHTML  

    All service control nodes can be modelled as a server system with one or more servers processing incoming requests. In this paper we show how non-linear control theory may be used when analyzing admission control mechanisms for server systems. Two models are developed, one linear and one non-linear. We show that, due to the non-linearities appearing in a real server system, linear control theory is sufficient when designing controllers for these systems. With non-linear analysis, however, the dynamics of a server system may be analysed and taken care of by choosing the controller parameters appropriately. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • New receiver structures for subcarrier synchronization in OFDM systems over frequency-selective channels

    Publication Year: 2003 , Page(s): 486 - 491 vol.1
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (2148 KB)  

    In this paper, subcarrier synchronization techniques for OFDM systems are studied. These techniques are evaluated for frequency dispersive, frequency nondispersive, time varying, and time invariant channels. DVB-T parameters are taken as reference. It has been observed that one needs an effective subcarrier synchronization measure in order to combat degrading effects of dispersive, time varying channels. Because of this reason, we propose new receiver structures to solve synchronization problems for such channels. In the proposed receiver structure, PLL trackers for subcarriers synchronization are used. The PLL's are operated by using an expectation maximization (EM) based phase offset estimation algorithm. According to the performance evaluations made by computer simulations, the proposed receivers improve the system performance on a large scale. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Pilot pollution interference reduction using multi-carrier interferometry

    Publication Year: 2003 , Page(s): 919 - 924 vol.2
    Cited by:  Patents (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (315 KB) |  | HTML iconHTML  

    Mobile stations, in CDMA systems, have the capability to communicate with multiple base stations whenever it is located in the fringe areas covered by overlapping base station. However, it is not desirable for an overlay area to contain pilot signals from a large number of base stations. As this would create pilot pollution interference and overload the mobile station's RAKE receiver. Therefore, the mobile station's RAKE receiver attempts to separate paths from three or more dominant pilot signals in the time domain to utilize path diversity. In each diversity (path/branch/finger), a large interference component exists due to the finger's own signal and other's signals. We demonstrated the power of using novel multi-carrier chip pilot pollution interference. Simulation studies have been carried out to verify the appropriateness of the proposed approach and we have obtained very promising results. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • SF-Devil: distributed Bluetooth scatternet formation algorithm based on device and link characteristics

    Publication Year: 2003 , Page(s): 646 - 651 vol.1
    Cited by:  Papers (1)  |  Patents (2)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (326 KB) |  | HTML iconHTML  

    Bluetooth has become very popular owing to the fact that it is a promising ad-hoc networking technology for short ranges. Although construction and operation of piconets is well defined in Bluetooth specifications, there is no unique standard for scatternet formation and operation. In this paper, we propose a distributed Bluetooth scatternet formation algorithm based on device and link characteristics (SF-DeviL). SF-DeviL handles energy efficiency using class devices and the received signal strength. SF-DeviL forms scatternets that are robust to position changes and battery depletions. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • VOD services for mobile wireless devices

    Publication Year: 2003 , Page(s): 602 - 607 vol.1
    Cited by:  Papers (2)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (386 KB) |  | HTML iconHTML  

    Wireless devices are becoming very popular and powerful to be commonly adapted to access distributed services. More and more sophisticated applications are being developed and a very promising market is quickly being established where mobile users might access multimedia data while roaming from a cell to another, anytime and everywhere. Such scenario requires a strong infrastructure in order to adequately manage all the different issues related with high-level service provisioning. QoS represents one of the most crucial issues as it involves many different aspects and directly impacts the user satisfaction. In order to achieve this target, we propose an architecture, which allows mobile devices to access advanced services available in the wired part of the network. This architecture, based on mobile agents technology, assumes the presence of a VOD virtual server. The strategy adopted is to hide all the basic mechanisms inside a middleware layer that provides necessary interfaces to allow a simple interaction between the user on the one side and the network and the distributed services on the other. The overall architecture, that is currently being implemented and tested, has been used as an experimental environment to provide mobile users with a new service to access MPEG-4 flows. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Enhancing revenue maximization with adaptive WRR

    Publication Year: 2003 , Page(s): 175 - 180 vol.1
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (427 KB) |  | HTML iconHTML  

    In the future converged wireless and wired networks will be required to provide support to a number of different types of traffic, each with its own particular characteristics and quality of service parameters including e.g. guaranteed bandwidth, jitter, and latency. The customers of different classes pay different prices to the service provider, who must share resources in a plausible way. Differentiation can be implemented by using a multiqueue system, where each queue corresponds to one service class. In this paper, an adaptive weighted round robin (WRR) based algorithm for traffic allocation is presented and studied in the single node case. The weights in the adaptive gradient type WRR algorithm are updated using revenue as a target function. Due to the adaptive nature of the algorithm, it can operate in the nonstationary environments. In addition, it is nonparametric and deterministic in the sense that any assumptions about call density functions or duration distributions are not made. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Distributed network control for establishing reliability-constrained least-cost lightpaths in WDM mesh networks

    Publication Year: 2003 , Page(s): 678 - 683 vol.1
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (321 KB) |  | HTML iconHTML  

    A control scheme which is used to set up and tear down lightpaths, should not only be fast and efficient, must also be scalable, and should try to minimize the number of blocked connections; while satisfying the requested level of fault-tolerance. In this work we propose a distributed control scheme based on preferred link approach for establishing reliability-constrained least-cost lightpaths, by choosing the reliability of a lightpath to denote the level of fault-tolerance required by the connection request. Four heuristics are proposed and their performance is studied through extensive simulation experiments. The simulation results suggest that our heuristics provide better performance compared to other distributed protocols available, in terms of average call acceptance rate, average path cost, average routing distance, and average connection setup time; when the connection requests with different levels of fault-tolerance requirements arrive to and depart from the network randomly. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Balanced batch LKH: new proposal, implementation and performance evaluation

    Publication Year: 2003 , Page(s): 815 - 820 vol.2
    Cited by:  Papers (13)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (587 KB) |  | HTML iconHTML  

    Perfect secrecy can only be achieved in multicast groups by ciphering data sent to the group with a different key every time a member joins or leaves the group. A key server must send the new key to all the remaining members so bandwidth efficiency concerns appear. Logical key tree algorithms reduce the number of messages to be sent, but in many scenarios, rekeying after each membership change has no sense. Batch rekeying algorithms are proposed as a solution to these problems. However such methods need to maintain the logical key tree balanced all the time on order to achieve maximum bandwidth efficiency. This paper presents a new technique for multicast batch rekeying. This technique reallocates the tree nodes in order to keep the tree balanced all the time. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An adaptive approach to WFQ with the revenue criterion

    Publication Year: 2003 , Page(s): 181 - 186 vol.1
    Cited by:  Papers (4)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (267 KB) |  | HTML iconHTML  

    This paper proposes a model to maximize revenue while serving customers with different quality-of-service (QoS) requirements. A providers' goal is to share resources between active customers to ensure all QoS requirements. At the same time, a provider is interested in maximizing the revenue. Since the amount of active users varies a provider functioning can be optimized by allocating different portions of resources. The proposed model is based on the weighted fair queue policy, which is extended so that the usage-based revenue criterion can be used to dynamically adapt weights. The model is flexible in that different services are grouped into service classes and are given different performance characteristics. It guarantees the QoS requirements and maximizes the revenue by manipulating weights of the WFQ model. The simulation of the proposed model considers a single node with several service classes. It is shown that the total revenue can be significantly improved when compared to a non-adaptive approach. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An analytical RED function design guaranteeing stable system behavior

    Publication Year: 2003 , Page(s): 1012 - 1017 vol.2
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (302 KB)  

    This paper introduces the procedure for an analytical derivation of the drop probability function for the random early detection queue management mechanism. The procedure is based on a model of the TCP window system stability with methods of control theory. The term stability refers to the oscillation amplitude of the steady state queue size. The outcome is a polynomial function of the queue size, which can be approximated with a power function of the queue size. Besides the goal of achieving low oscillations for the whole load range, this derived function shows yet other advantages. There are no parameters to adjust, which extends the applicability of RED to a wide range of load situations applying the derived function. Additionally, the under-utilization at low loads, as often experienced with the original RED function, is avoided automatically. Simulations show clear evidence that the derived function outperforms the original linear RED function. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A scalable distributed VoIP conferencing using SIP

    Publication Year: 2003 , Page(s): 608 - 613 vol.1
    Cited by:  Papers (5)  |  Patents (4)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (294 KB) |  | HTML iconHTML  

    Session initiation protocol seems to be proffered standard for voice-over-IP. In this paper, we consider the limitations of existing SIP conferencing methods and propose a distributed architecture using controllers (SIP proxy servers) and conference servers which facilitate the control and media handling of a VoIP conference. The conference servers are designed on the basis of H.323's multipoint processors and handle the audio part of the conference. We provide conferencing messages on SIP that bring these controllers and conference servers together along with the clients for scalable conference on the Internet. The schematic of the proxy server and conference server is presented to aid in implementation. We also explain the mechanism we use to improve the quality of mixed output speech by selecting the streams at the clients. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance of serially concatenated space-time QPSK systems

    Publication Year: 2003 , Page(s): 271 - 276 vol.1
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (351 KB) |  | HTML iconHTML  

    In this paper, error performance of a serially concatenated QPSK space-time system is investigated on quasi-static, block and rapid fading channels. We consider outer nonrecursive convolutional and inner recursive space-time trellis code case and iterative decoding based on the maximum a posteriori (MAP) algorithm. The performance is evaluated by means of computer simulations and it is observed that when the recursive versions of some of the previously known space-time trellis codes are used as the inner codes, the Euclidean distance criterion based spaced-time codes lead to better error performance for both quasi-static and rapid fading channels. We also investigate the effects of various system parameters on the performance. We obtain the error performance for the large number of transmit and/or receive antennas increases the error performance improves. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The degree of participation concept in ad hoc networks

    Publication Year: 2003 , Page(s): 197 - 202 vol.1
    Cited by:  Papers (1)  |  Patents (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (271 KB) |  | HTML iconHTML  

    The paper introduces the novel concept of degree-of-participation (DP) in mobile ad hoc networks. The degree-of-participation concept allows nodes in the ad hoc network to express the level of involvement they are willing to give to the forwarding process. The paper also introduces a DP-based routing scheme for mobile ad hoc networks. Performance evaluations show that the degree-of-participation allows a more resource-aware forwarding process. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Design and analysis of MPLS-based ATM switching system for differentiated services

    Publication Year: 2003 , Page(s): 969 - 974 vol.2
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (2213 KB)  

    MPLS is high lightened as the most promising technology for the integrated IP-over ATM backbone network. Nowadays, one important practical issue in MPLS is how it is capable of providing differentiated services. For integrating IP with ATM capable of scalability, MPLS-based ATM switch network can be available, especially for the fast Internet services by adding a layer 3 routing module to the existing ATM network, and can provide scaleable Internet services to users with various service levels. In this paper, we establish a queuing model for FE (forwarding engine) including service differentiation, which performs IP address lookup in MPLS LER, and evaluate performance of FE with Internet traffic by statistical Internet protocol analysis. Also we take a closer look into our LC (label controlled)-ATM switch on which we implement an MPLS controller that can provide both user and provider with relative proportional differentiated service in a feasible and reliable manner. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Analysis of parallel hierarchical matching schedulers for input-queued switches under different traffic conditions

    Publication Year: 2003 , Page(s): 527 - 534 vol.1
    Cited by:  Papers (2)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (396 KB) |  | HTML iconHTML  

    Input-queued packet switches are more scalable than output-queued ones. However, due to HOL blocking, their throughput is poor. The virtual output queueing (VOQ) switch architecture and several buffer schedulers have been proposed to overcome this problem. Among them, the class of iterative maximal matching algorithms, with the first example being parallel iterative matching (PIM), which uses random selection, and iSLIP that uses round-robin selection, and has become a de facto standard in switching research. iSLIP admit efficient practical implementations, and has several variants with different pointer updating strategies - like FIRM, DRRM and RDSRR - that improve performance. In previous work, we formulated a new scheduler, parallel hierarchical matching (PHM), which compare favorably to iSLIP-like algorithms. PHM can be considered a parallelization of previous high-performance sequential hierarchical matching algorithms, like 2DRR or WWFA. In this paper, we compare their delay performance for same decision response-time, determined from ASIC implementations, and for different traffic models. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Authenticated access for IPv6 supported mobility

    Publication Year: 2003 , Page(s): 569 - 575 vol.1
    Cited by:  Papers (5)  |  Patents (2)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (324 KB) |  | HTML iconHTML  

    Hierarchical mobile IPv6 (HMIPv6) is a protocol that enhances mobile IPv6 (MIPv6) with faster handovers. Neither HMIPv6 nor MIPv6 provides ways to authenticate roaming mobile nodes, although visited networks will need to check if mobile nodes can be authorized access. A solution is required before MIPv6 can be commonly deployed. Mechanisms to integrate mobile IPv4 and the diameter protocol for authentication, authorization and accounting (AAA) have proved to be useful solution for IPv4. However, a similar mechanism does not yet exist for IPv6. We therefore propose a modification for HMIPv6 to allow for authenticated access for IPv6 supported mobility. HMIPv6, as well as diameter protocols, supports transportation of AAA information and extends MIPv6 with mobility anchor points. Our proposed solution shows how different mechanisms for secure and scalable manner. Furthermore, since HMIPv6 is a protocol designed to reduce the delay and signaling overhead of MIPv6, our proposal represents a way to integrate fast handovers with authenticated and authorized access. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • TCP-aware source routing in mobile ad hoc networks

    Publication Year: 2003 , Page(s): 69 - 74 vol.1
    Cited by:  Papers (2)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (1037 KB) |  | HTML iconHTML  

    Temporary link failures and route changes occur frequently in mobile ad hoc networks. Since TCP assumes that all packet looses are due to network congestion, TCP does not show satisfactory performance in ad hoc networks. In this paper, we propose a simple and new mechanism called TSR, TCP-aware source routing, which can improve TCP performance in mobile ad hoc networks. By reducing the number of invalid routes, TSR minimizes TCP's consecutive timeouts. In our simulation study, TSR achieves up to 50% TCP performance improvement without requiring any modification of TCP stack in end systems. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Channel sharing of competing flows in ad hoc networks

    Publication Year: 2003 , Page(s): 189 - 196 vol.1
    Cited by:  Papers (2)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (429 KB) |  | HTML iconHTML  

    This paper studies the fairness with which competing flows share the channel in ad hoc networks using collision avoidance protocols. It is shown that the required multihop coordination makes the backoff-based distributed fair queueing schemes less effective. Using extensive simulations of two competing flows with different underlying network configuration, it is shown that the commonly used flow contention graph is insufficient to model the contention among nodes and that various degrees of unfairness can take place. The fairness problem is more severe in TCP-based flows due to the required acknowledgment traffic, and TCP throughput is also negatively affected. A measurement based fair scheme is analyzed in which nodes estimate their fair share of the channel from overheard traffic and adjust their backoff window accordingly (voluntarily); it is shown that such a scheme achieves much better fairness but sacrifices too much throughput. These results indicate that more explicit information exchange among contending nodes is mandatory to solve the fairness problem conclusively while maintaining reasonable throughput. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A middleware approach for SAINT (secure, automatic, interoperable, and transparent) peer-to-peer content services

    Publication Year: 2003 , Page(s): 1047 - 1052 vol.2
    Cited by:  Patents (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (252 KB) |  | HTML iconHTML  

    Expanded use of the Internet and technological advances are eliciting changes in how individuals manage and share their contents. The Internet has been primarily a client-server-based system, where it is challenging to keep contents up-to-date and consistent among all of the devices. Furthermore, the client-server model has service limitations in heterogeneous computing environments. However, a new peer-to-peer (P2P) model has emerged. In this P2P workplace, each participant (peer) acts as both client and content provider. Compared with services performed by the client-server model, P2P-based content management services have several advantages. In P2P environments, users can manage heterogeneous information resources residing in various platforms perhaps in different policy environments. A P2P-based content management model can provide higher resource availability due to the distributed nature of P2P computing. However, wide-scale application of P2P computing is constrained by limitations associated with the especially sophisticated control mechanisms needed between peers: most current P2P technologies simply focus on sharing services rather than on controls between the peers. In this paper, we introduce a middleware approach to support the underlying mechanisms, providing secure, automatic, interoperable, and transparent (SAINT) services for P2P content management. The underlying mechanisms are based on machine-understandable metadata. Our middleware approach using metadata facilitates the SAINT content management services with rich metadata expression in P2P computing environments. The broad dissemination of our approach allows the application of P2P technology to more reliable and efficient content services within organization or inter-organizations. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A QoS-aware handoff using RSVP in next generation wireless networks

    Publication Year: 2003 , Page(s): 125 - 130 vol.1
    Cited by:  Papers (2)  |  Patents (2)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (273 KB) |  | HTML iconHTML  

    The handoff call blocking probability minimization is an important issue for seamless wireless network operation. Handoff delay minimization is in parallel with this task. Mobile stations with QoS requirements should be able to receive the same service level during and after handoff. This constraint amplifies the handoff latency caused forced termination problem. This research introduces a handoff method, which performs some preparation phase tasks in advance, in wireless networks. With the expected visitor list (EVL) deployment at base stations and RSVP, QoS requirements of an incoming mobile station is obtained and examined, and hence overall handoff latency minimization is achieved. A virtual QoS provisioning method for call admission control of the mobile is presented. Performance evaluation with simulation experiments shows that the proposal can be a promising methodology for QoS provisioning in the nest generation (NG) wireless networks. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.