By Topic

Information Networking, 1998. (ICOIN-12) Proceedings., Twelfth International Conference on

Date 21-23 Jan. 1998

Filter Results

Displaying Results 1 - 25 of 141
  • Proceedings Twelfth International Conference on Information Networking (ICOIN-12)

    Save to Project icon | Request Permissions | PDF file iconPDF (524 KB)  
    Freely Available from IEEE
  • Index of authors

    Page(s): 730 - 733
    Save to Project icon | Request Permissions | PDF file iconPDF (179 KB)  
    Freely Available from IEEE
  • Augmented trigger mechanisms for groupwork environment

    Page(s): 568 - 573
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (108 KB)  

    In a virtual office environment, it is difficult for users to know the state of other users. As mechanisms to solve such difficulties, the trigger mechanisms for groupwork environment are discussed. These mechanisms detect occurrence of events in the system and invoke the corresponding predefined processes, where both the events and the processes can include users' actions. Specification of events, condition and actions for groupwork is discussed together with examples View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An advanced system architecture of CSCW for collaborative education system and its experimental results

    Page(s): 574 - 580
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (752 KB)  

    In this paper, we propose a methodology for distance learning lessons with the aim of stimulating pupil's desire to learn while enhancing their creative abilities. Based on this concept, we constructed the educational system hiring the modern technologies of CSCW (Computer Supported Cooperative Work) and multimedia communication, and conducted the verification experiments in some elementary schools in Japan with a result of confirming the efficacy of the proposed methodology View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A proposal of an evaluation method IPL for effects of individual quantity of domain knowledge on an intuitive classification in a distributed and cooperative KJ method and its application

    Page(s): 581 - 586
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (72 KB)  

    We propose a new evaluation method IPL (Island formation using Pseudo Label), and show its efficiency. In IPL method, the effects of domain knowledge of each participant can be evaluated based on an intuitive classification task in a distributed and cooperative KJ method. Experiments using IPL method show the influences upon the island formation caused by the distribution of knowledge quantitatively. There exists a similar method called LCR method which provides an evaluation method for the logical classification tasks. However the proposed IPL method provides an evaluation method for the intuitive classification tasks by which the creation of new idea can be done easily and effectively View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An ATM traffic shaper for delay-sensitive delay-insensitive VBR services

    Page(s): 588 - 593
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (500 KB)  

    We propose an ATM traffic shaper for shaping multiple delay-sensitive and delay-insensitive VBR cell streams simultaneously, with a shaping mechanism following the definition of GCRA algorithm. By using a feedback mechanism between the regulator and the scheduler, the output streams are strictly conforming. In order to achieve best performance, we employ the Earliest-Due-Date (EDD) discipline to resolve cell emission conflicts. The call admission control condition and the cell delay bound for both classes of VBR traffic are derived. Simulation results demonstrate that the proposed traffic shaper can provide different bevels of QoS (delay bound) guarantees for delay-sensitive and delay-insensitive traffic View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the notion of adaptability to the environments in autonomous mechanism

    Page(s): 705 - 708
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (520 KB)  

    The focused paradigm of communication for the distributed computing systems may be common global memory and message passing. We think of the common memory space as a field for reflecting the work space for control objects. We intend to examine the coordination mechanism based on this idea for applying to the basic functional model for the control systems. We observed the behavior of autonomous and collaborative mechanism built in the applications. And we evaluated the communication cost between a coordination member and the control object View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A pseudonymous joint signature scheme

    Page(s): 95 - 98
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (36 KB)  

    The result of a joint signature is frequently used to evaluate whether the issuing matter should be decided further by a more formal decisive method like voting. Compared with the voting, the joint signature can be regarded as a less formal but simpler method to reflect the intention of people. In this paper, we propose a network-based pseudonymous joint signature scheme that can be practically operated over information networks. The scheme ensures the signer privacy which is critical in most political affairs View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A continual tree algorithm for integrated voice/data wireless networks

    Page(s): 488 - 493
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (48 KB)  

    This paper proposes a continual tree algorithm for integrated voice/data wireless networks. The continual tree algorithm (CTA) is a new kind of reservation scheme and uses an improved continual tree algorithm to reserve slots of a channel. And based on a CTA a multimedia wireless multiple access (MWMA) is discussed. In addition to pretty good channel efficiency of a reservation scheme due to CTA, MWMA has the following three futures. 1. A tree algorithm is stable, but the contention period to reserve slots of a channel is variable in length. So they are not suitable to transmit real-time data. Improving a tree algorithm and applying it to a fixed length frame of a channel, MWMA can transmit both real-time data and non-real-time data using a common channel. 2. A fixed length frame suffers from a large average delay under low traffic. MWMA divides a frame into small frames so that real-time data is communicated with short delays. 3. The center station controls reservations centrally using verbose slots. By this centralized scheme, MWMA mitigates energy limitations of user's mobile terminals, a problem of coming and going of many terminals not given to the network, and a hidden terminal problem View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Tandem-Banyan multicast ATM switch

    Page(s): 594 - 597
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (144 KB)  

    The multicast function, required in the ATM switching architectures, is applied to a Tandem-Banyan network. The internal blocking condition, characteristic of every banyan is analyzed and a new solution is proposed, according to the kind of conflict. Also the delay in the overall network is analyzed and compared with similar designs View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An adaptive rate-based congestion control scheme for ATM networks

    Page(s): 14 - 19
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (84 KB)  

    The ATM Forum has chosen a rate-based scheme as an approach to congestion control for Available Bit Rate (ABR) services. So far many rate-based schemes, such as Forward Explicit Congestion Notification (FECN), Backward Explicit Congestion Notification (BECN), and Proportional Rate Control Algorithm (PRCA), has been proposed. In FECN and BECN, which use negative feedback rate control, the overall network congestion collapse may occur, if all notification cells in backward direction experience extreme congestion. The PRCA use positive feedback to solve the drawbacks of the FECN and BECN, but unfair distribution of available bandwidth among Virtual Connections (VCs) may occur. To resolve the problems of the existing rate-based schemes, in this paper, we propose a new adaptive congestion control scheme called the self detective congestion control (SDCC) scheme. We show that the SDCC scheme can achieve good fairness performance among connection classes existing in the network. In transient behavior, the SDCC scheme offers fast access to available bandwidth, which is a sensible requirement, particularly in LAN and MAN environments. Furthermore, by allocating control cells based on networks scales, the scheme is able to control a number of greedy sources with moderate size buffers View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Management of databases using SNMP: a framework for a unified database MIB

    Page(s): 29 - 32
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (20 KB)  

    Simple Network Management Protocol (SNMP) is now an industry standard for management of devices, systems and software in a distributed computing environment. A variety of Management information Bases (MIB) have been developed for managing various kinds of elements including databases. This paper attempts to define a framework for a Unified Database MIB, for uniform management of a variety of databases including relational, object oriented and proprietary databases in a client-server environment View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Remote joint application design process using package software

    Page(s): 495 - 500
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (644 KB)  

    Corporate information systems, aiming at reduction of cycle times from order receipt to shipment are increasingly based on integrated package software. In development of such a system, joint application design (JAD) in which users and developers reach agreements based on an understanding of the package functions and on prototyping to determine how those functions will be applied to business operations plays an important role. In JAD, the key personnel making specification decisions must participate, but because these persons are not always in the same location JAD activities with remote sites often become necessary. In this paper we propose a model of processes for the development of corporate information systems using integrated software packages, and also propose a method of CSCW to support determination of specifications. In this model development tasks are divided into a number of stages, in each of which JAD activities are conducted with members located at remote sites. This methodology was actually applied to development processes, and evaluation results confirmed the usefulness of the method View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Action view mechanisms for cooperative work environments

    Page(s): 501 - 504
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (120 KB)  

    In this paper a new view mechanism, called action view, is presented. It is developed for the VIEW Office, a system which can be used to realize a distributed virtual office environment. The mechanism supports coordination of users by means of the database technology. For security/privacy and other reasons it is not desirable to show all contents of a user's screen to other users. The action view mechanism makes it possible to select exported screen objects. Histories of actions shown on a screen are recorded, thus coordination among users working at different time is supported. The recording uses a symbolic form and histories' elements are marked by timestamps. Redundant operations can be removed from a record View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • User management in an educational computer system: personal information management

    Page(s): 627 - 632
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (52 KB)  

    Recently, almost all universities and colleges have introduced educational computer systems designed to process their information. These systems are used not only for lectures but also for campus life. All students should be registered in the systems, which means an enormous number of users would have to be registered. This paper characterizes these registration methods, and introduces a personal information management system for supporting management within the educational systems. A prototype Whoswho system has been developed for managing personal information. An experiment in the Educational Center for Information Processing at Kyushu University is reported. The results show that the Whoswho system is useful for retrieving personal information and for publishing personal information by users world-wide View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Design of self-healing algorithm for ATM networks

    Page(s): 2 - 7
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (584 KB)  

    Automatic and rapid network service restoration (self-healing) when failures occur is of increasing importance for network operations and management as network speed and bandwidth increase. In this paper, we study the self-healing problem of an ATM network at the virtual path (VP) configuration level. We analyze the design issues of self-healing algorithms, and develop a state transition and bandwidth division model of individual VPs and links. On top of the model, we design a restoration algorithm that searches and activates alternate VPs for the failed VPs by combining a preplan method and a double search method. The preplan method activates preassigned backup VPs dynamically, while the double search method searches for alternate VPs from both the source and destination nodes of failed VPs. The double search method is also applied to reconstruction of the backup VP plan. Simulations demonstrate that our new algorithms outperform existing preplanned and dynamic self-healing algorithms in both restoration time and restoration ratio View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance evaluation of end-to-end QoS using prototyped VOD system

    Page(s): 175 - 178
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (356 KB)  

    In order to realize multimedia applications such as VOD (Video-on-Demand) on highspeed networks, a client-agent-server video system which provides continuous media data such as audio and video to users has to guarantee suitable QoS (Quality of Service) in accordance with users' requirements, and available computing and network resources during providing media data to users. Therefore the client-agent-server system must include functions which guarantee end-to-end QoS between client and server from the application through network layers. In this paper, we define a Media Coordinate System which has QoS functions, specify QoS negotiation protocols, implement the media coordinate system as a prototyped Video-on-Demand and evaluate its performance View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Mobile agent network for supporting personal mobility

    Page(s): 131 - 136
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (88 KB)  

    Needs and interests of the personal mobility have been increasing, because of the rapid development of wireless communication technologies and computer networks. Telecommunication sectors have made a lot of efforts to provide the personal mobility resulting in the development of PCN (Personal Communication Networks) or UPT (Universal Personal Telecommunications) services. However, the mobility service in the Internet has been mainly focused on the host mobility such as Mobile IF, while the personal mobility has been neglected relatively. In this paper, the agent network, the virtual network mapped onto physical networks, is proposed to support the personal mobility on the Internet. Mobile agent technology is adopted to build the agent network. The agent engine is designed and implemented with Java, and the Agent/Servant architecture is suggested to complement restrictions of Java applets View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Design and implementation of selective RTP translator

    Page(s): 298 - 303
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (132 KB)  

    RTP (Real-time Transport Protocol) is a protocol for multimedia transport and works over the Network layer protocol, such as Internet Protocol. Multimedia transport by RTP is restricted among the networks which are routed. RTP Translator translates multimedia data from one network to the other network which are not routed directly. Translator defined in RTP specification translates multimedia data by unit of transport address. The unit of transport address is very large and the transportation by smaller unit is better for many applications. And the rule of modification of header in specification of RTP is vague and the application must modify the header voluntarily when the translation is necessary between private and global network. In this paper, Selective RTP Translator is proposed for solving these problems. Selective RTP Translator translates by small unit with modifying media quality and defines the rule of modification of header clearly View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Virtual socket interfaces for wireless network

    Page(s): 381 - 384
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (32 KB)  

    The explosive popularity of wireless data networking has been continued over the years. Furthermore, the strong requirement to access the Internet while on the move via mobile devices is growing more and more, since lots of useful resources are residing in the wired net, Internet. DataTAC manufactured by Motorola Inc. provides an infrastructure bridging Internet and mobile devices. On top of it, we built a middleware to make it possible for existing network software to surf on the Internet with a mobile device. The middleware provides such high application transparency that it does not need to be recompiled to adapt the middleware. We call that system Brown (Bridge over wireless net to Internet). In this paper, we introduce Brown, and then addresses the core technology, Vision (Virtual socket interfaces over wireless net), a communication layer to support multiple TCP/IP socket-based communication channels View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Extending commitment protocol with binary domain to partially ordered domain

    Page(s): 617 - 620
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (76 KB)  

    A group of processes have to commit to realize distributed applications. The processes exchange values with the other processes to make the commitment. The processes commit if every process takes one value. In the traditional commitment protocols, only two values, i.e. commit or abort can be taken. In this paper we discuss a more general domain including multiple values. In addition, the domain is partially ordered by a dominant relation which shows what values the processes can take after taking a value. Each process decides what value to be taken after taking one value by rising the dominant relation. In this paper we discuss how to reach commitment in a group of multiple processes by using the dominant relation View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Interworking between ATM and TDM networks

    Page(s): 451 - 454
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (36 KB)  

    In this paper we present the interworking standards based on ITU-T and ATM Forum specifications and we propose an ATM node architecture for network interworking with TDM networks, focusing on hardware module and unit architecture. It is expected that the proposed interworking architecture can be utilized for various existing TDM-based applications in an ATM node View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Distributed multimedia presentation system based on the MHEG

    Page(s): 403 - 406
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (92 KB)  

    This paper presents a method to interchange the multimedia information objects between heterogeneous systems in a network environment, and to interactively provide the information to users by interpreting the multimedia synchronization relation and the hypermedia link relation. The MHEG standard has been adopted to improve the reusability and the interchangeability of multimedia information, and to synchronize various media in time and space. The MHEG Presentation System has been implemented to interpret and present the multimedia information objects based on the MHEG specification. The MHEG Presentation System with client/server architecture allows the low-cost PCs to present the multimedia information by separately performing the interpretation and the presentation of information objects View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • WWW browser and server with guaranteed QoS support over native ATM API

    Page(s): 212 - 217
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (64 KB)  

    In this paper, we present WWW browser and server that can utilize guaranteed QoS over ATM network using native ATM API. Native ATM API is the API for native ATM services, i.e., ATM-specific services. It can provide native ATM's benefits directly to its applications, without producing such drawbacks as stack overhead and functional limitations which can be found in IP over ATM, LAN emulation over ATM, and Multiprotocol over ATM mechanisms. We explain these advantages, standardization works and development trend of native ATM API. And then we describe our system architecture and environment for Web browsing with guaranteed QoS support, operation procedure of HTTP over ATM API, and the ways to specify QoS and traffic characteristics for our WWW system View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Test case generation of a protocol by a fault coverage analysis

    Page(s): 690 - 695
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (76 KB)  

    In this paper we generate conformance test cases for a communication protocol modeled in an EFSM(Extended Finite State Machine) by a fault coverage analysis. For the analysis model, we choose the expanded EFSM to resolve the inter-dependency problem between control and data flows within an EFSM. An expanded EFSM has several useful properties and makes it easy to generate test cases. For test case generation, at first we define data elements in the expanded EFSM. With the definition, we define some probable fault models in edges of the expanded EFSM and discuss what test cases to be needed for satisfying each fault model. The analysis shows that control flow test cases with full fault coverage and data flow test cases satisfying `all-du-paths' criterion are needed to guarantee high fault coverage in the expanded EFSM. A mass of generated test cases by high fault coverage is optimized through some steps. The result of a simple protocol shows the efficacy of this method View full abstract»

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