• Journal of KIISE:Computing Practices and Letters
• /
• v.5 no.4
• /
• pp.449-456
• /
• 1999

본 논문은 C++에 분산 객체 프로그래밍 기능을 추가한 D++ 언어를 제안한다. 대등관계 복제객체 모델을 지원하는 D++는 분산 클래스의 정의, 멤버 함수의 일치성 제어 정의 기능, 그리고 영구 객체 이름에 기반한 분산 객체를 정의할 수 있는 언어 구조를 제공한다. D++ 프로그램에서 새로이 생성되는 분산 객체는 생성 시에 제공되는 객체의 영구 이름과 동일한 영구 이름을 갖는 분산 객체가 존재할 경우 해당 객체들과 복제 관계를 유지함으로써 정보를 공유한다. 각 복제 객체들은 서로 간에 대등한 관계를 가지며, 멤버 함수 정의 시에 기술되는 특성에 따라 일치성이 유지된다. 이 같은 D++의 분산 객체 모델은 실시간 그룹웨어의 기본 요구 사항인 분산 환경에서의 정보 공유 및 사건 공지 기능을 자연스럽게 해결해 주기 때문에 실시간 그룹웨어의 개발을 효율적으로 지원할 수 있을 것으로 기대한다. Abstract This paper proposes D++ programming language that is an extension of C++ for distributed object oriented programming. The D++, which supports peer-to-peer object model, provides new language constructs for the definition of distributed classes, the definition of the consistency control of the member function and the definition of distributed object variables with the persistent name. In D++, when the persistent name of a newly created distributed object is same as that of an existing distributed object, the new distributed object replicates object state of the existing distributed object and thus they share the object state. The replicas have peer relation and the consistency among them is maintained according to the characteristic described on the definition of designated member functions. It is expected that D++ language increases efficiency in development of real-time groupware because the distributed object model of D++ naturally supports the information sharing and event notification that are the basic functions required when building real-time groupware.

• Journal of Internet Computing and Services
• /
• v.11 no.1
• /
• pp.15-20
• /
• 2010

In this paper, we propose a novel approach to reduce spatial query access latency and energy consumption by leveraging results from nearby peers in wireless broadcast environments. We propose a three-tier Hierarchical Location-Based Sequential access index, called HLBS, which provides selective tuning (pruning and searching entries) without pointers using a linear accessing structure based on the location of each data object. The HLBS saves search cost and index overhead, since the small index size with a sequential index structure results in low access latency overhead and facilitates efficient searches for sequential-access media (wireless channels with data broadcast). Comprehensive experiments illustrate that the proposed scheme is more efficient than the previous techniques in terms of energy consumption.

• Journal of Internet Computing and Services
• /
• v.10 no.6
• /
• pp.1-6
• /
• 2009

In this paper, we propose an energy efficient index scheme for Nearest Neighbor queries, specially designed for mobile P2P environments. we propose a PMBR (P2P Minimum Boundary Rectangle) index that provides the client with the ability of selective contacting and tuning from other nodes. The mobile client is able to identify whether or not the neighbor nodes have the desired information by accessing PMBR. Thus, the client immediately switches to change to another node's broadcast channel if the index does not contain the desired information. Furthermore, the client is able to predict the arrival time of the desired data items and only needs to tune into the broadcast channel when the requested data items arrives, by first accessing PMBR. Thus, the mobile client can stay in power save mode most of time, and tune into the broadcast channel only when the requested data items arrive. Experiments are conducted to evaluate the performance of the proposed scheme. Comprehensive experiments illustrate that the proposed scheme is more efficient than the previous techniques in terms of energy consumption.