By Topic

Network Protocols, 1995. Proceedings., 1995 International Conference on

Date 7-10 Nov. 1995

Filter Results

Displaying Results 1 - 25 of 43
  • Proceedings of International Conference on Network Protocols

    Publication Year: 1995
    Save to Project icon | Request Permissions | PDF file iconPDF (482 KB)  
    Freely Available from IEEE
  • Author index

    Publication Year: 1995
    Save to Project icon | Request Permissions | PDF file iconPDF (85 KB)  
    Freely Available from IEEE
  • Buffer insertion/self-token (BIST) protocol for multimedia LANs

    Publication Year: 1995 , Page(s): 350 - 355
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (476 KB)  

    This paper describes a new multimedia LAN protocol, referred to as the buffer insertion/self-token (BIST) protocol, combining buffer insertion and the multiple-self-token ring protocols. The basic buffer insertion ring has the maximum spatial reuse on a ring by allowing stations to transmit packets concurrently. However, it is well known that the buffer insertion method suffers from the possibility of starvation. BIST prevents starvation and maintain fairness by assigning each station individual tokens, called self-tokens. Then a station is allowed to send packets only if it holds its own tokens, that is, each packet transmitted by the station is attached a self-token belonging to the station. That is why packet flow on a ring is regulated, and fairness is adjustable. Asynchronous and synchronous transmissions are supported by using two kinds of self-token, one is for asynchronous transmission and the other is for synchronous transmission. The effectiveness of the proposed protocol is demonstrated via simulation View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • ATM admission models of stochastic high level Petri nets based on hierarchical modeling

    Publication Year: 1995 , Page(s): 144 - 151
    Cited by:  Papers (2)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (660 KB)  

    This paper presents a framework for modeling and analyzing ATM admission control using Stochastic High Level Petri Net (SHLPN). SHLPN is chosen because it is a powerful graphical and mathematical modeling tool that is able to handle concurrent, asynchronous, nondeterministic and stochastic events. In addition, there exists a set of well-developed performance analysis techniques for SHLPN. This paper uses a hierarchical modeling technique to specify complex ATM network mechanisms using a top-down approach. However, in analyzing the performance of the network, a bottom-up approach is adopted. To tackle the state space explosion problem, a SHLPN model is decomposed into submodels. These subnets are independently evaluated with all possible population which are then substituted by transitions with approximate equivalent performance in the original model. The technique is illustrated by modeling and evaluating a specific connection admission control policy View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Implementation method of high speed protocol as transport library

    Publication Year: 1995 , Page(s): 172 - 179
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (760 KB)  

    Along with the rapid progress of optical technologies, the transmission speed of LANs and public networks has been increased significantly. As a result, it has become possible for computers distributed geographically to communicate with each other with high throughput. However, the current protocols such as TCP/IP have some problems, especially the performance through long distance and wide bandwidth networks. Therefore, new protocols with new data transfer algorithms are required. In this paper, we describe an implementation of a high speed transport protocol by a user level library which interfaces to UDP/IP. This method uses only functions commonly provided by UNIX operating systems, and therefore, allows a new protocol to be developed easily and to be ported to other UNIX workstations easily. Our library called the transport library realizes the coordination of buffer managements in the application and the library, and low overhead and prompt handling of receive and timer interrupts in order to achieve high performance. Our implementation results show 32 Mbits/sec over an ATM network whose effective transmission speed is 36 Mbits/sec, regardless of the propagation delay from 0 to 200 msec. These values of throughput are better than those of the in-kernel TCP programs View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A dynamic bandwidth allocation scheme for multimedia data over ATM networks

    Publication Year: 1995 , Page(s): 32 - 39
    Cited by:  Patents (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (472 KB)  

    In this paper, a new dynamic bandwidth allocation scheme called Minimum Overflow Traffic Algorithm (MOTA) is proposed to assign the bandwidth for each traffic class in the hierarchical admission control structure in ATM network. The traffic types can be video, image, voice and so on. An Overflow traffic function Q is used to adjust the bandwidth assignment each time when a new connection is required. This paper uses mean virtual cell loss probability (MCLP) as the quality of service (QoS) for the performance measurement of the system. This novel approach can minimize the mean virtual cell loss probability of the system by optimizing Q when the delay constraint is satisfied and provide high throughput in multi-class traffic environment View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Internetworking between OSI and TCP/IP network managements with security features

    Publication Year: 1995 , Page(s): 278 - 285
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (568 KB)  

    To integrate both the OSI network and the TCP/IP internet the application gateway with powerful and flexible paradigms has been used, but micro-managements of the gateway produces high communication costs and long delays in responding to critical situations. The mechanism that maps the access control policy is needed between two domains using different security policies. These problems are caused by managing each domain with different standards. In this paper, we propose an application gateway that delegates powerful and complex services of the CMIP as well as management functions sent to an agent by a manager in order to reduce network management costs and delays. We also suggest a security mechanism converting the security policy in order to guarantee safe communication between two domains View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Using traffic regulation to meet end-to-end deadlines in ATM LANs

    Publication Year: 1995 , Page(s): 152 - 159
    Cited by:  Papers (3)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (776 KB)  

    This paper considers the support of hard real-time connections in ATM networks. In an ATM network, a set of hard real-time connections can be admitted only if the worst case end-to-end delays of cells belonging to individual connections are less than their deadlines. Although there are several approaches to manage the network resources in order to meet the delay requirements of connections, we focus on the use of traffic regulation to achieve this objective. Leaky buckets provide simple and user-programmable means of traffic regulation. We design and analyse an efficient optimal algorithm for selecting the burst parameters of leaky buckets to meet connections' deadlines. Our algorithm is optimal in the sense that it always selects burst parameters to meet the delay requirements of hard real-time connections whenever some such assignment exists. The exponential size of the search space makes this problem a challenging one. Our algorithm is efficient and we observe a dramatic improvement in the system performance in terms of the connection admission probability when traffic is regulated using our algorithm View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Protocol synthesis from timed and structured specifications

    Publication Year: 1995 , Page(s): 74 - 81
    Cited by:  Papers (2)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (704 KB)  

    In this paper, we propose a method to synthesize protocol specifications automatically from service specifications written in a time-extended LOTOS called LOTOS/T+. In LOTOS/T+, structured descriptions, such as parallelism and interruption are allowed to describe service specifications, and time-constraints among non-adjacent actions can be described using Presburger formulas. Here we assume that there is a reliable communication channel between any two nodes and the maximum communication delay for each channel is bounded by a constant. Moreover we assume service specifications have no deadlocks. Under our simulation policy, a specification S' is derived from a given service specification S and a given maximum communication delay of each channel. In S', time-constraints necessary for exchanging synchronization messages are added. If S and S' can carry out the same behaviour, i.e., if S and S' are bisimulation equivalent when time is ignored, then a correct protocol specification for simulating S is derived from S' automatically View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Design of ATM switch using hypercube with distributed shared input buffers and dedicated output buffers

    Publication Year: 1995 , Page(s): 92 - 99
    Cited by:  Patents (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (740 KB)  

    We investigate a dynamic packet routing approach to ATM switch design using a hypercube. An (n+1)-dimensional hypercube is used to implement an N×N switch, where N=2n. Cells arriving at input ports are routed towards their destinations in store-and-forward (SAF) manner. In addition to the SAF buffer, each input/output port has a dedicated buffer. A distributed deflection routing algorithm where the routing priority is based on the age of the cells is developed. An interesting feature of the routing algorithm is that the store-and-forward buffers and the input buffers behave as distributed shared-buffer which effectively smooth out uneven traffic. In addition, our routing algorithm does not suffer from the HOL blocking problem as in the conventional input-output buffered switch architecture. The processing power of each node in the hypercube scales up by a factor of Q(log N) as the network size N is increased. Hence, our approach is suitable for implementing large scale ATM switches. Performance of our design is studied via simulation and found to be better than the conventional input-output buffered nonblocking switch architecture View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A call model for multimedia multiuser communication platform

    Publication Year: 1995 , Page(s): 305 - 312
    Cited by:  Papers (1)  |  Patents (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (928 KB)  

    Multimedia multiuser applications such as computer supported cooperative working, desktop multimedia conferencing, and distance education require more complex and structured communication services from the underlying communication platform than conventional applications. The call model of the communication platform defines how the underlying basic data transport objects can be structured to support more complex communication services, and how the structured objects can be managed in a consistent manner by the applications. In this paper, we present a new call model for multimedia multiuser communication platform, based on the analysis of communication requirements for diverse applications. Our call model provides better structuring capability than the existing call models, and the communication platform based on the call model will support present and future complex multimedia multiuser applications more efficiently. Detailed call control operations are also presented in this paper View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On guaranteed bandwidth channels

    Publication Year: 1995 , Page(s): 47 - 55
    Cited by:  Papers (2)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (872 KB)  

    This paper introduces a new scheme and design of a protocol for guaranteed bandwidth channels. Given traffic characteristics of media streams, it is possible to bound delays experienced through each node in the network, using appropriate discretion at channel establishment time. Once a channel with such bounded delays is established, our scheme uses feedback techniques to match the flow of media units at each node with that of the playback rate at the client site. The feedback is triggered by preset marks in the buffers at each node called water marks. The receipt of a feedback by a node changes the rate of flow at that node, thus matching the rate of playback at the client. Jitter is implicitly controlled in such a scheme, as buffering absorbs the different delays experienced by media units. The scheme also provides continuity of playback for multimedia streams, removing this responsibility from the higher software layers at the client. We present analytical proofs that our scheme provides guaranteed bandwidth and prove the protocol safe. Further, simulation results are provided to validate the protocol View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Protocol synthesis using basic Lotos and global variables

    Publication Year: 1995 , Page(s): 126 - 133
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (816 KB)  

    In Kant et al. (1992), a method of protocol synthesis, using basic LOTOS (BL) as a specification language, is proposed. In the present paper, we generalize this method. We propose an extended basic LOTOS (EBL) to specify the service and the protocol. With EBL, events are associated with enabling conditions and transformation functions that depend on global variables. Next, we propose a method to synthesize protocols using EBL as a specification language. This method is inspired by the concept of transactions View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Generalized fair reachability analysis for cyclic protocols with nondeterministic and internal transitions

    Publication Year: 1995 , Page(s): 6 - 13
    Cited by:  Papers (3)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (712 KB)  

    In this paper, we extend the generalized fair reachability notion to cyclic protocols with nondeterministic and internal transitions. By properly incorporating internal transitions into the formulation of fair progress vectors, we prove that with only a few modifications, all the results established for cyclic protocols without nondeterministic and internal transitions still hold even if nondeterministic and internal transitions are allowed. We identify indefiniteness as a new type of logical error resulting from reachable internal execution cycles and show that it can also be detected for the class of cyclic protocols with finite fair reachable state spaces with finite extension View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Networking abstractions and protocols under variable length messages

    Publication Year: 1995 , Page(s): 286 - 293
    Cited by:  Papers (2)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (784 KB)  

    The size of data shipped over networks of distributed databases has increased substantially with the introduction of multimedia and high performance systems. Therefore, there is a need to understand the behavior and the trade-offs of available data communication abstractions in such settings. In this paper, we consider parameters associated with the abstractions, the impact of their implementation on throughput, and we compare the performance of BSD sockets (TCP, UDP), System V TLI (TCP), and SunOS RPCs (TCP) in the presence of large messages. In such environments, segmentation overhead of UDP messages at the user level outweighs other considerations such as optimal mbuf allocation and full ethernet bandwidth usage. In addition, it is found that the size of buffer areas allocated to TCP sockets gains further impedance when sending large messages. We also find that communication induced paging significantly deteriorates the data transmission throughput and suggest a policy to avoid this problem View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Verification and diagnosis of testing equivalence and reduction relation

    Publication Year: 1995 , Page(s): 14 - 21
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (564 KB)  

    In protocol engineering, a common approach for system design and implementation is to verify if an implementation specification (or any lower level specification) satisfies its service specification. If an implementation specification does not satisfy its service specification, it is necessary to find out the faults and correct them. In this paper, we present an efficient algorithm for verifying whether an implementation satisfies its service specification related by the testing equivalence and the reduction relation, and generating diagnostic information if an implementation does not satisfy its service specification, based on the transformation of the service specification into a special deterministic machine, called refusal graph, and the coupled product of the refusal graph and the implementation View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A wireless link protocol: design by refinement

    Publication Year: 1995 , Page(s): 192 - 200
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (596 KB)  

    We develop an asymmetric protocol for wireless communication in a step-by-step manner. We start with a very simple protocol and prove its correctness. Then we relax the assumptions of the simple protocol one by one, verifying the correctness of the protocol at each step as we relax the assumptions. This process is continued in a systematic manner until no assumptions are left. The novelty of the paper lies in the way the assumptions are relaxed without violating the correctness properties of the protocol while at the same time making the protocol efficient. The final result is a provably correct protocol which is also efficient for wireless channels View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Nonpreemptive scheduling algorithms for multimedia communication in local area networks

    Publication Year: 1995 , Page(s): 356 - 364
    Cited by:  Patents (6)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (836 KB)  

    We consider a LAN-based multimedia information system like a Video On Demand (VOD) system that supports the retrieval of continuous media like motion video and sound. In the system, the server transmits the streams of continuous media on a shared communication channel while the continuity of multiple streams should be preserved. Several scheduling algorithms have been studied to guarantee the temporal constraints of time-critical messages, but there has been no study to schedule periodic transmission requests with variable bit rates (VBR), which results from the compression algorithms for motion video and sound. We suggest real-time scheduling algorithms that one is static and the other is dynamic, and an admission control algorithm to guarantee the delivery of continuous media. The characteristics of our algorithms are that it is nonpreemptive to save the overheads of preemption, and the static scheduling algorithm is proved to be optimal. It is shown through simulations that the performance of our dynamic scheduling algorithm is better than that of nonpreemptive Earliest Deadline First (EDF) algorithm, especially, under the assumption of variable bit rates View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A synchronization and compensation protocol for multimedia communication systems

    Publication Year: 1995 , Page(s): 252 - 259
    Cited by:  Papers (1)  |  Patents (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (720 KB)  

    Media synchronization and freedom from starvation at destination devices are the two most important problems in a multimedia communication system. In order to solve these problems at the same time, this paper presents a protocol combining the scheduling scheme and the buffering scheme with underflow threshold (SBUF). In this protocol, by controlling the buffer sizes and modifying transmission schedule of the synchronizer synchronization can be achieved without synchronizing clocks during a connection. In this paper the algorithm of the protocol is described. The setting of the system parameters and network QOS to support the proposed protocol are also given in this paper. A simulation is performed for comparison of four synchronization schemes: scheduling schemes (with and without clock synchronization), marker scheme, and the proposed SBUF protocol. The results confirm that the proposed protocol guarantees satisfaction of QOS requirements and also performs better than the other schemes in terms of media synchronization and freedom from starvation at destination devices View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A robust transport protocol for run-time fault detection

    Publication Year: 1995 , Page(s): 164 - 171
    Cited by:  Papers (3)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (760 KB)  

    Run-time fault detection in communication protocols is essential to detect faults that cannot be detected during the testing phase. We propose a signature-based method to detect run-time faults. A polynomial using the state and event information as coefficients is used to transform a sequence of states and events into a number (signature). The static signature corresponding to the correct execution of the protocol is compared with the run-time signature. This technique is more reliable, faster, and efficient compared to existing techniques. The states and events are assigned values such that multiple paths leading to the same state result in a unique signature. This reduces the number of comparisons required to verify the correct execution of the protocol. In this paper, we present eXTP4, an extended transport layer protocol that facilitate run-time fault detection View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multimedia synchronization for live presentation using the N-buffer approach

    Publication Year: 1995 , Page(s): 244 - 251
    Cited by:  Patents (3)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (708 KB)  

    The demand of bringing multimedia information systems into distributed environments makes multimedia synchronization more difficult. In order to eliminate the side effects which result from delay jitters, we propose a bounded buffer allocation scheme, in which the audio stream adopts the blocking synchronization scheme and the video stream adopts the non-blocking synchronization scheme, for live audio and video presentations in this paper. The forward synchronization schemes are performed to overcome the asynchrony anomalies. Once some anomalies of presentations are detected, a forward re-synchronization scheme is triggered to eliminate the asynchrony anomalies. Neither a global clock nor a feedback mechanism is needed using the proposed method. Based on the proposed method, trade-offs between the presentation qualities and networking resources are mathematically calculated. According to these calculable trade-offs, users can derive their own (acceptable) presentation qualities of live video and live audio media based on their available networking resources View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Service and connection management architecture for distributed multimedia applications

    Publication Year: 1995 , Page(s): 296 - 304
    Cited by:  Patents (4)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (944 KB)  

    This paper addresses a novel networking architecture model on DPE for various multimedia services suitable to high speed networks and for the flexible and rapid introduction of services. In this model, applications are assembled from software “building blocks” which cope with information service and network providers. Each building block provides a layered view, enabling the effective management of multimedia network resources and services according to the concept of TMN and TINA. In this paper, we also propose the use of a directory system and its naming structure for the management of user profiles and session profiles, and a control model of effective multimedia logical device objects that uses a stream process approach. Our model is implemented on a DPE platform that provides various transparencies. For the purpose of flexible service provision to users, this architecture presents ad hoc service building blocks such as a video on demand building block and a CSCW building block View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Design and implementation of a multicast-buffer ATM switch

    Publication Year: 1995 , Page(s): 84 - 91
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (672 KB)  

    We propose a multicast-buffer ATM switch, where a dedicated buffer is allocated to store all multicast cells in an ATM switch. We describe the design of the dedicated multicast buffer in an output-buffer ATM switch and in a shared-buffer ATM switch. No additional copy circuit or complicated control circuit is needed to implement the multicast-buffer ATM switch. Our performance evaluation shows that the proposed switch has a low cell-loss ratio. We are implementing an eight-by-eight output buffer ATM switch with the multicast buffer. We also present a window control mechanism to further improve the utilization of the multicast buffer. Therefore, we believe the multicast-buffer ATM switch is a good candidate to support the multicast function for future broadband ISDN applications View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Simulation study of a run-time bandwidth assignment technique for delay sensitive traffic in high-speed network

    Publication Year: 1995 , Page(s): 40 - 46
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (680 KB)  

    This paper proposes a run-time monitor and bandwidth assignment scheme for delay-sensitive traffic in ATM (asynchronous transfer mode) network. The traffic monitor function is thought to be indispensable to support the QoS (quality of services) of the accepted calls and carry out the network resource management efficiently at the same time. The proposed scheme monitors user data cells by its counter which is driven by system clocks and makes a report on the monitor results to the upper plane such as control plane or network management plane. This feature makes it possible to do the run-time bandwidth assignment and can moderately reduce the size of cell buffers which is inevitable to observe input cell rates in existing traffic controls. Furthermore, any processing delays resulting from usage parameter controls can also be eliminated. The proposed scheme is conformed to efficiently manage the calls and reliably improve the overall system performances without a drop in QoS by computer simulations View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A reliable ordered delivery protocol for interconnected local area networks

    Publication Year: 1995 , Page(s): 365 - 374
    Cited by:  Papers (5)  |  Patents (6)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (1080 KB)  

    We present-the Totem multiple-ring protocol, a novel reliable ordered multicast protocol for multiple interconnected local-area networks. The protocol exhibits excellent performance and maintains a consistent network-wide total order of messages despite network partitioning and remerging, or processor failure and recovery with stable storage intact. The Totem protocol is designed for fault-tolerant distributed systems, which replicate data to guard against failures and must ensure that replicated data remain consistent despite failures. The network-wide total order of messages provided by Totem simplifies the maintenance of consistency of replicated data, and, thus, eases the development of fault-tolerant distributed systems View full abstract»

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