IOG is a link layer protocol specifically designed for the high speed and bandwidth efficient transmission of IPv4 and IPv6 datagrams over optical fibers. That is, IOG is a simple point-to-point packetization protocol over a bit stream with a low bit error rate. MTU of IOG is 1535, which is long enough for the Internet with IPv6 multicast packets and Ethernet frames. IOG has a framing structure of fixed length (2048 bytes) for synchronization, CRCC (Cyclic Redundancy Check Code) and scrambling. A frame consists of 4 bytes of a frame header, 2040 bytes of a frame payload and 4 bytes of a frame trailer for CRCC. CRCC is also used for scrambling. A frame header consists of a 21 bit flag sequence ("011111111111111111110") and a 11 bit packet boundary pointer. A packet has an 11 bit length field and a 21 bit label field. The label field contains an Ethertype or a link layer label. Packets are packed continuously in frame payload. A packet is at least 20 and at most 1535 bytes long. If there are no packets to send, 20 byte packets of Ethertype 0 are sent, which is ignored by the receiver. A packet may be included in two adjacent frames. The packet boundary pointer in a frame header of a frame points to the first packet boundary of the frame, which means that once a frame synchronization is established, packet synchronization is also established. IOG is designed to allow high-speed implementations to enable 32 or 64 bit parallel processing. CRC polynomial of X32 + X2 + X + 1 is newly designed for high-speed 32 or 64 bit parallel calculation and frame wise SECDED (Single Error Correction, Double Error Detection). IOG is applicable to long haul transmission of IP datagrams in Internet backbone and to inter-chip or inter-module transmission of IP datagrams in parallel IP routers.

This paper proposes a high throughput small latent IP packet delivery architecture using ATM technology in a large scaled internet. Data-link network segments, including ATM network segments, are interconnected through routers. A connection oriented IP packet delivery will be provided by IP (including both IPv4 and IPv6) with a certain resource reservation protocol (e.g. RSVP). When the router attached to ATM network segment has a mapping function between the flow-ID (e.g. in the SIPP header) and the VPI/VCI value, the small latent connection oriented IP forwarding can be provided. Also, when the router has cell-relaying functionality, the small latent connectionless IP forwarding can be provided, even in IPv4. The source router, where the source end-station belongs to, will be able to transfer the connectionless IP packet to the destination router, where the destination end-station belongs to, through the concatenated ATM connections (ATM-VCCs) without any ATM-VCC termination point. When all of the network segments are ATM-LAN, the proposed architecture can accommodate about up to 222 (4106) end-stations with two network layer processing points. And when the network is scaled up hierarchally, we can accommodate larger number of end-stations. For example, we can accommodate 1015 end-stations by a three layered network. Then the maximum number of actual network layer processing points between source and destination end-stations can be ten. Here, 1015 is the maximum number of end-stations in ISDN and also it is the target number of accommodated end-stations for IPv6.

We have developed an automatic network configuration technology for flexible and robust network construction. In this paper, we propose a two-or-more-level hierarchical link-state routing protocol in Hierarchical QoS Link Information Protocol (HQLIP). The hierarchical routing easily scales up the network by combining and stacking configured networks. HQLIP is designed not to recompute shortest-path trees from topology information in order to achieve a high-speed convergence of forwarding information base (FIB), especially when renumbering occurs in the network. In addition, we propose a fixed-midfix renumbering (FMR) method. FMR enables an even faster convergence when HQLIP is synchronized with Hierarchical/Automatic Number Allocation (HANA). Experiments demonstrate that HQLIP incorporating FMR achieves the convergence time within one second in the network where 22 switches and 800 server terminals are placed, and is superior to Open Shortest Path First (OSPF) in terms of a convergence time. This shows that a combination of HQLIP and HANA performs stable renumbering in link-state routing protocol networks.

In this paper an approach to formal specification and verification of ISDN services in LOTOS is presented. As for specification, it is shown that LOTOS can be effectively applied to describe different levels of ISDN service specifications. At the higher level, only the external behaviour of the network is specified. On the other hand, at the lower level, specifications include the behaviour of network components such as switching systems, where each switching system can be specified independently of each other. Such specification style, proves suitable for verification of specifications by using the concepts of the simulation relation.

This paper discusses the development of a design tool which supports a process for constructing PVC-based, ATM networks. Because of mathematical complexities, a heuristic approach has been adopted to find an optimal network configuration. Through a GUI, users define a physical network, and PVC networks which are logically constructed within the physical network. Based on the defined network configurations and user traffic demand, the tool evaluates performance measures. In response to the results of the evaluation, network designers can modify the network configuration to improve the performance. With the aid of this tool, they can repeat this interactive process until the estimated performance measures meet a desired quality. The tool has been applied to the design of several private ATM networks which will be constructed in the near future. The response time of this design tool is so fast that wait time can be negligible.

Limitations are found in the recent Internet because a lot of functions and protocols are patched to the original suite of layered protocols without considering global optimization. This reveals that end-to-end argument in the original Internet was neither sufficient for the current societal network and nor for a sustainable network of the future. In this position paper, we present design guidelines for a future network, which we call the New Generation Network, which provides the inclusion of diverse human requirements, reliable connection between the real-world and virtual network space, and promotion of social potentiality for human emergence. The guidelines consist of the crystal synthesis, the reality connection, and the sustainable & evolutional guidelines.

IP-- is proposed as an Internet Protocol suitable for optical packet networking. As optical routers require much faster control than electric ones and lack of optical buffers other than those by fiber delay lines requires fixed time control, Internet Protocols must be at least as simple as IPv4 and much simpler than IPv6. IP-- also addresses issues of IP address space exhaustion and IP routing table explosion.