Kanada's papers

Yasusi Kanada, Nicograph International 2024, 2024-6.

[ Japanese page ]
[ Poster paper PDF file (in Japanese) ]
[ Poster PDF file (in Japanese) ]
[ Slide PDF file (in Japanese) ]

[ Full paper PDF ファイル (rejected, in Japanese) ]

Abstract: Image generation AI can produce images even when given invented or unrelated words that it hasn’t been specifically trained on. Using personal names or coined pen names functioning as artist names, I provided short prompts of about 2-3 words to Stable Diffusion XL to create painting-like images. The choice of pen name helps define the generated image’s character, giving personality to the artist name. Since Stable Diffusion allows for negative prompts, even greater image variety can be achieved. By adjusting random seeds to generate a wide range of images, I could select those where the AI’s “artistic talent” was particularly evident. The exhibition will focus on about ten especially interesting pieces, with others included for reference.

Introduction to this research theme: Bring out the artistic talent of AI and have it create AI artworks

Yasusi Kanada, Unpublished, October 2024 (in Japanese).

[ Slide PDF file ]

Yasusi Kanada, Nicograph International 2024, 2024-6.

[ 日本語ページ ]
[ Paper PDF file ]
[ Poster PDF file ]
[ Slide PDF file ]

[ Full paper PDF file (rejected) ]
[ Full paper (in Japanese) PDF file ]

Abstract: Text-to-image generation models such as Stable Diffusion (SD) and DALL-E can produce a wide variety of images from text prompts. While so-called AI artists often use long prompts to generate desired images, this poster proposes a method for generating diverse painterly images emergently by SD with short prompts of 1-2 words. The reason for such attempts is that the author believes that AI, drawing from learned image data, extracts representations of color, shape, and other aspects, as well as the underlying intentions and motivations of the original images’ authors, and reflects them in the generated images, and that he also believes that the process of the AI user encountering and selecting the generated images is a creative one.

Introduction to this research theme: Bring out the artistic talent of AI and have it create AI artworks

• My current major research area is 3D printing. A position paper on this R&D was recently published. Several other papers are also being published.
  


• My master thesis titled "Toward Programming Linguistics" and my Ph.D thesis titled "Vector-processing Methods of Symbol-processing Programs and Its Application to Logic Language Programs" have been published as Kindle books. The latter contains appendices that were dropped from the PDF version.
  

Kanada, Y., Design Symposium 2021, 2021-7 (in Japanese).

[ 日本語のページ ]
[ Paper PDF file ]
[ Slides Keynote file (for Mac) with video ]
[ Slides PowerPoint file with video ]

Abstract: (no English abstract)

Introduction to this research theme: 3D shape formation technologies

Yasusi Kanada, Plastics (Japanese Magazine), March 2019, pp. 45-50.

[ 日本語ページ ]
[ Paper PDF file (draft) ]

Abstract:
Spiral (helical) 3D printing is a 3D printing method in which a single spiral winding of a filament can create a variety of shapes and apply fine textures and patterns to the surface. He describes what can be made by spiral 3D printing, its principles, how to make it, what kind of software to use, and the development and future of products other than products.
(Google translation)

Introduction to this research theme:
3D shape formation technologies

Kanada, Y., not yet published.

[ 日本語のページ ]
[ Paper PDF file ]

Abstract: This poster proposes a method for generating fine asperity by helical 3D printing using three types of waves, especially for generating complex Moiré patterns. The printing process can be modulated by three types of sine waves while printing.

Introduction to this research theme: 3D shape formation technologies

Kanada, Y., IPSJ Magazine, Vol. 58, No. 6, pp. 17–23, June 2017.

[ 日本語ページ ]
[ Paper PDF file (to be published in June) ]

Abstract: The current mainstream 3D design and printing methods are versatile but not versatile, so other methods may be needed. In some cases, simply specifying the surface shape is not enough, and there are some shapes that cannot be printed well by the mainstream method. In such a case, a field-oriented object model that can specify the direction (printing direction) at each point on the model, a design method using a procedural program, and a printing method that is not limited to the horizontal direction are effective. Although these methods do not have the versatility of the mainstream methods, they are effective for the purpose for which they are suitable, for example, for the formation of hollow solids. The outline of this method and the library to use draw3dp are described in another paper, but this article introduces the background, related trends, and applications. (Google translation)

Introduction to this research theme:
3D shape formation technologies

Kanada, Y., Journal of Information Processing, Vol. 24, No. 6, pp. 908–916, November 2016.

[ 日本語のページ ]
[ Paper PDF file ]
[ Paper PDF file (Japanese version (refereed) -- not published) ]

Abstract: When manufacturing or 3D-printing a product using a computer, a program that procedurally controls manufacturing machines or 3D printers is required. G-code is widely used for this purpose. G-code was developed for controlling subtractive manufacturing (cutting work), and designers have historically written programs in G-code, but, in recently developed environments, the designer describes a declarative model by using computer-aided design (CAD), and the computer converts it to a G-code program. However, because the process of additive manufacturing, of which FDM-type 3D-printing is a prominent example, is more intuitive than subtractive manufacturing, it is some- times advantageous for the designer to describe an abstract procedural program for this purpose. This paper therefore proposes a method for generating G-code by describing a Python program using a library for procedural 3D design and for printing by a 3D printer, and it presents use cases. Although shapes printable by the method are restricted, this method can eliminate layers and layer seams as well as support, which is necessary for conventional methods when an overhang exists, and it enables seamless and aesthetic printing.

Introduction to this research theme: 3D shape formation technologies

Kanada, Y., IPSJ Transactions on Programming, Vol. 9, No. 4, pp. 1–9, 2016-9.

[ 日本語のページ ]
[ Paper PDF official version ]
[ Paper PDF file (prelimimary version) ]
[ Paper PDF file (Japanese version (refereed) -- not published) ]

Abstract: When manufacturing or 3D-printing a product using a computer, a program that procedurally controls manufacturing machines or 3D printers is required. G-code is widely used for this purpose. G-code was developed for controlling subtractive manufacturing (cutting work), and designers have historically written programs in G-code, but, in recently developed environments, the designer describes a declarative model by using computer-aided design (CAD), and the computer converts it to a G-code program. However, because the process of additive manufacturing, of which FDM-type 3D-printing is a prominent example, is more intuitive than subtractive manufacturing, it is some- times advantageous for the designer to describe an abstract procedural program for this purpose. This paper therefore proposes a method for generating G-code by describing a Python program using a library for procedural 3D design and for printing by a 3D printer, and it presents use cases. Although shapes printable by the method are restricted, this method can eliminate layers and layer seams as well as support, which is necessary for conventional methods when an overhang exists, and it enables seamless and aesthetic printing.

Introduction to this research theme: 3D shape formation technologies

Kanada, Y., 2016 International Joint Conference on Neural Networks (IJCNN 2016), July 2016.
[ 日本語のページ ]
[ Paper PDF file ]
[ Slides PDF file ]

abstract:
Recently, performance of deep neural networks, especially convolutional neural networks (CNNs), has been drastically increased by elaborate network architectures, by new learning methods, and by GPU-based high-performance compu- tation. However, there are still several difficult problems concerning back propagation, which include scheduling of learning rate and controlling locality of search (i.e., avoidance of bad local minima). A learning method, called “learning-rate- optimizing genetic back-propagation” (LOG-BP), which com- bines back propagation with a genetic algorithm by a new manner, is proposed. This method solves the above-mentioned two problems by optimizing the learning process, especially learning rate, by genetic mutations and by locality-controlled parallel search. Initial experimental results shows that LOG-BP performs better; that is, when required, learning rate decreases exponentially and the distances between chromosomes, which indicate the locality of a search, also decrease exponentially.

Kanada, Y., Rapid Prototyping Journal, Vol. 22, No. 4, 2016.

[ 日本語のページ ]
[ Paper PDF file ]
[ Manuscript PDF file ]

Summarized abstract:

A methodology for designing and printing 3D objects with specified printing-direction using fused deposition modelling (FDM), which was proposed by a previous paper, enables the expression of natural directions, such as hairs, fabric, or other directed textures, in modelled objects. This paper aims to enhance this methodology for creating various shapes of generative visual objects with several specialized attributes.


The proposed enhancement consists of two new methods and a new technique. The first is a method for “deformation.” It enables deforming simple 3D models to create varieties of shapes much more easily in generative design processes. The second is the spiral/helical printing method. The print direction (filament direction) of each part of a printed object is made consistent by this method, and it also enables seamless printing results and enables low-angle overhang. The third, i.e., the light-reflection control technique, controls the properties of filament while printing with transparent PLA. It enables the printed objects to reflect light brilliantly.


...

Introduction to this research theme:
3D shape formation technologies

Kanada, Y., IPSJ SIG on Programming, 2015 5th Meeting, 2016-2 (in Japanese).

[ 日本語のページ ]
[ Paper PDF file ]
[ Slides Keynote file (for Mac) with video ]
[ Slides PowerPoint file with video ]

Abstract: When manufacturing or 3D-printing a product using a computer, a program that procedurally controls manufacturing machines or 3D-printers is required. G-code is widely used for this purpose. G-code was developed for controlling of subtractive manufacturing, and a designer historically wrote programs in G-code; however, in recent development environments, the designer describes a declarative model by using CAD, and the computer converts it to a G-code program. However, because the process of additive man- ufacturing, such as 3D printing, is more intuitive than subtractive manufacturing, it sometimes seems to be advantageous to describe an abstract procedural program by the designer for this purpose. This paper, thus, proposes a method for generating G-code by describing an abstract Python program using a library for procedural 3D-design and for printing by a 3D printer, and shows use cases. Although shapes printable by this method are restricted, this method can eliminate layers and layer seams and eliminate support material, which is necessary for conventional methods when an overhang exists, and it enables seamless and artistic printing.

Introduction to this research theme: 3D shape formation technologies

Kanada, Y., in Y. Suzuki and M. Hagiya, ed., Recent Advances in Natural Computing, 2016.
[ 日本語のページ ]
[ Springer.com page ]
[ Amazon.co.jp page ]

Abstract:
3D printers are usually used for printing objects designed by 3D CAD exactly, i.e., deterministically.However, 3Dprinting process contains stochastic selforganization process that generate emergent patterns. A method for generating fully self-organized patterns using a fused depositionmodeling (FDM) 3D printer has been developed. Melted plastic filament is extruded constantly in this method; however, by using thismethod, various patterns, such as stripes, splitting and/or merging patterns, and meshes can be generated. A cellular-automata-based computational model that can simulate such patterns have also been developed.

Introduction to this research theme: 3D shape formation technologies

Kanada, Y., XIIIV Generative Art Conference (GA 2015), 2015-12.

[ 日本語のページ ]
[ Paper PDF file ]
[ Slides PDF file ]

Abstract: 3D models are usually designed by 3D modelling tools, which are not suited for generative art. This presentation proposes two methods for designing and printing generative 3D objects. First, by using a turtle-graphics-based method, the designer decides self-motion (self-centered motion) of a turtle and print a trajectory of the turtle as a 3D object (Fig. A). The trajectory is printed using a fused-deposition-modelling (FDM) 3D printer, which is the most popular type of 3D printer. Second, by using the assembly-and-deformation method, the designer assembles parts in a palette, each of which represents stacked filaments, applies deformations to the assembled model, and prints the resulting object by an FDM 3D printer. The designer can also map textures, characters, or pictures on the surface of the object. Various shapes can be generated by using the assembly-and-deformation method. If the initial model is a thin helix with a very low cylinder (i.e., an empty cylinder with a bottom), shapes like cups, dishes, or pods with attractive brilliance can be generated, and a globe and other shapes can be generated from a helix (Fig. B).

Introduction to this research theme: 3D shape formation technologies

Kanada, Y., 8th International Conference on Leading Edge Manufacturing in 21st Century (LEM 21), 2015-10.
[ 日本語のページ ]
[ Paper PDF file ]

Abstract: Instead of printing layer by layer, thin 3D objects can be printed in better quality (without seams between layers) by printing helically or spirally by fused deposition modeling (FDM). When printing helically or spirally, the amount of extruded filament can be modulated using a bitmap; that is, “zero” in bitmap means “thin” and “one” means “thick” (or vice versa). This process generates a thin object, such as a sphere, pod, or dish, with a bitmapped picture or characters. A typical example is a globe, which is printed using a bitmapped world map.

Introduction to this research theme: 3D shape formation technologies

Kanada, Y., 2015 JSME Annual Meeting, S044 Next Generation 3D Printing, 2015-9 (in Japanese).

[ 日本語のページ ]
[ Paper PDF file ]

Abstract: In 3D printing methods such as FDM, the direction of printing dominates the appearance and the nature of the printed objects. However, the direction cannot be specified in conventional 3D-printing methods. In this presentation, methods for designing and printing direction-specified 3D objects and the advantages of these methods are described.

Introduction to this research theme: 3D shape formation technologies

Kanada, Y., 2015 JSME Annual Meeting, G120 General Session in Design Engineering and Systems, 2015-9 (in Japanese).
[ 日本語のページ ]
[ Paper PDF file ]

Abstract: As well as in computer programming, both declarative and procedural methods should be available in industrial product design. However, design for 3D printing is mostly based on declarative CAD as well as other areas of product design. This presentation reports a method for generative (procedural) design.

Introduction to this research theme: 3D shape formation technologies

Kanada, Y., International Journal of Computer, Control, Quantum and Information Engineering, WASET, Vol. 9, No. 5, pp. 568-574, 2015.

[ 日本語のページ ]
[ Paper PDF file (Publisher site) ]
[ Paper PDF file (local site) ]

Abstract: When printing a plate (or dish) by an FDM 3D printer, the process normally requires support material, which causes several problems. This paper proposes a method for forming thin plates without using wasteful support material. This method requires several extraordinary parameter values when slicing plates. The experiments show that the plates can, for the most part, be successfully formed using a conventional slicer and a 3D printer; however, seams between layers spoil them and the quality of printed objects strongly depends on the slicer.

Introduction to this research theme: 3D shape formation technologies

Kanada, Y., International SFF Symposium 2015, August 2015.

[ 日本語のページ ]
[ Preliminary paper PDF file ]
[ Slide PDF file ]

Abstract: Material is stacked vertically and layer-by-layer in conventional additive manufacturing (AM) methods. An object with overhang or skewed stacking structure, such as a plain dish or an empty sphere, is difficult to be created by these methods without support material. This paper proposes a layer-less fused-deposition-modeling (FDM) method that enables mostly horizontal stacking of filament without support material. Such filament-stacking is enabled by increasing the height of the print head gradually, i.e., without layer transitions that make horizontal stacking difficult. The proposed method also allows controlling printing directions and various printing-direction-dependent expressions, such as fiber-like textures or brilliance, which make AM products attractive as final products for consumers or as some kinds of industrial products. Objects to be printed can be modeled as directed solid models designed by a component-based method (i.e., a new CAD based method) or a generative method, which are completely different from conventional CAD based methods.

Introduction to this research theme: 3D shape formation technologies

Kanada, Y., I/O 2015-8 (in Japanese).

[ 日本語のページ ]

Abstract: 3D printers usually prints artificially-designed objects; however, certain unexpected patters are often generated. Let's enjoy such "naturally designed" patterns!

Introduction to this research theme: 3D shape formation technologies

Kanada, Y., International Journal of Computer, Control, Quantum and Information Engineering, WASET, Vol. 9, No. 4, pp. 689-693, 2015.
[ 日本語のページ ]
[ Paper PDF file (Publisher site) ]
[ Paper PDF file (local site) ]

Abstract: Objects are usually horizontally sliced when printed by 3D printers. Therefore, if an object to be printed, such as a collection of fibers, originally has natural direction in shape, the printed direction contradicts with the natural direction. By using proper tools, such as field-oriented 3D paint software, field-oriented solid modelers, field-based tool-path generation software, and non-horizontal FDM 3D printers, the natural direction can be modeled and objects can be printed in a direction that is consistent with the natural direction. This consistence results in embodiment of momentum or force in expressions of the printed object. To achieve this goal, several design and manufacturing problems, but not all, have been solved. An application of this method is (Japanese) 3D calligraphy.

Note: This is the on-line journal version of a poster for SFF 2013

Introduction to this research theme: 3D shape formation technologies

Tarui, T., Kanada, Y., Hayashi, M., Nakao, A., IFIP/IEEE International Symposium on
Integrated Network Management (IM 2015), 2015-5.
[ 日本語のページ ]
[ Paper ]
[ Paper (local copy) ]

Abstract: An architecture called the slice-exchange-point (SEP) has been designed for federating heterogeneous net-work-virtualization platforms by creating and managing slices (virtual networks). SEP enables whole inter-domain resources to be managed by the network manager of any single domain. Slice-operation commands are propagated to other domains through SEP by using a common API. SEP introduces the following four features: infrastructure neutrality, single interface federation, abstract and clean federation, and extensibility of capabilities. SEP's functions to achieve these features are discussed. SEP was partially implemented on two VNode domains and one ProtoGENI domain and was verified to function effectively.

Introduction to this research theme: Network virtualization

Kanada, Y., Int. Journal of Engineering Research and Applications (IJERA), Vol. 5, No 4, Part-5, April 2015, pp.70-77.
[ 日本語のページ ]
[ Paper PDF file (IJERA) ]
[ Paper PDF file (local) ]

この論文の日本語版 (IPSJ)

Abstract: When creating shapes by using a 3D printer, usually, a static (declarative) model designed by using a 3D CAD system is translated to a CAM program and it is sent to the printer. However, widely-used FDM-type 3D printers input a dynamical (procedural) program that describes control of motions of the print head and extrusion of the filament. If the program is expressed by using a programming language or a library in a straight manner, solids can be created by a method similar to turtle graphics. An open-source library that enables “turtle 3D printing” method was described by Python and tested. Although this method currently has a problem that it cannot print in the air; however, if this problem is solved by an appropriate method, shapes drawn by 3D turtle graphics freely can be embodied by this method.

Introduction to this research theme: 3D shape formation technologies

Kanada, Y., I/O 2015-4 (in Japanese).

[ 日本語のページ ]

Abstract: When printing a plate (dish) using a 3D printer, normally, so-called “support” material, which is disposed after printing, is required to be printed and to support the plate. However, try to create thin plates without using such superfluous material! Some devices are required to print them, but it is not so difficult.

This article was revised and published as an English paper: 3D-Printing Plates without “Support”

Introduction to this research theme: 3D shape formation technologies

Kanada, Y., 13th SIG Meeting on Network Virtualization, March 2015.
[ 日本語ページ ]
[ Poster photo ]

Summary: In IP/Ethernet-based networks, redundant addresses, both IP and MAC addresses, are used. Problems caused by this redundancy can be solved by replacing IP/Ethernet by IP/null (IPON) protocol. It was implemented using VNodes.

Introduction to this research theme: Network virtualization

Kanada, Y., Communications and Network, Vol. 7, pp. 55-69, http://dx.doi.org/10.4236/cn.2015.71006
[ Japanese page ]
[ paper PDF file ]

Abstract – Network processors (NPs) are widely used for programmable and high-performance networks; however, the programs for NPs are less portable, the number of NP program developers is small, and the development cost is high. To solve these problems, this paper proposes an open, high-level, and portable programming language called “Phonepl”, which is independent from vendor-specific proprietary hardware and software but can be translated into an NP program with high perfor- mance especially in the memory use. A common NP hardware feature is that a whole packet is stored in DRAM, but the header is cached in SRAM. Phonepl has a hardware-independent abstrac- tion of this feature so that it allows programmers mostly unconscious of this hardware feature. To implement the abstraction, four representations of packet data type that cover all the packet op- erations (including substring, concatenation, input, and output) are introduced. Phonepl have been implemented on Octeon NPs used in plug-ins for a network-virtualization environment called the VNode Infrastructure, and several packet-handling programs were evaluated. As for the eval- uation result, the conversion throughput is close to the wire rate, i.e., 10 Gbps, and no packet loss (by cache miss) occurs when the packet size is 256 bytes or larger.

Kanada, Y., 29th edition of the International Conference on Information Networking (ICOIN 2015), January 2015, http://dx.doi.org/10.1109/ICOIN.2015.7057953.
[ 日本語のページ ]
[ Paper PDF file ]
[ Poster PDF file ]
[ Simulator program ]

Abstract – Many commercial and open-source network simulators are available; however, most of them are not suited for novices in college and school education or learning. Moreover, although Ethernet has recently become much more important, simulators that can be used for this purpose is rare because most simulators suited for education and learning are designed for IP communication. The author developed a simple CLI-based Ethernet simulator that can display contents of Ethernet packets to send or to receive in terminals and contents of MAC address tables in switches in “real time”, and used the simulator in a university class for learning computer networks. The simulator, which is in public domain, is written in Python and, thus, runs on Windows, Macintosh, Linux, and other operating systems. The use of this simulator was evaluated based on a report assignment. The evaluation result shows that the average score of the reports written by using the simulator was much better, although it is not statistically significant because the number of students is small. The simulator seems to be effective to learn behaviors of Ethernet-based networks.

Poster display photo

Kanada, Y. and Tarui, T., 29th edition of the International Conference on Information Networking (ICOIN 2015), January 2015, http://dx.doi.org/10.1109/ICOIN.2015.7057895.
[ 日本語のページ ]
[ Paper PDF file ]
[ Slides PDF file ]

(This paper accepted a BEST PAPER AWARD).

Abstract – Our previous work enabled “federation-less federation”, which means a federation of multiple network-virtualization platforms that do not support federation functions, and applied this method to a homogeneous federation of platforms called the “VNode” infrastructures. In this study, this method was applied to a heterogeneous federation of the ProtoGENI and the “VNode”. We intended to federate these platforms through a single management interface. However, the federation architec- ture of GENI, which is called the slice-based federation architecture (SFA), cannot be used for single-interface federation but we could not modify the ProtoGENI platform to enable it. Therefore, a method for applying federation-less-federation to ProtoGENI was developed. It enabled federation of these platforms by adding several nodes but without modifying preexisting platforms. This method was applied to federation of the ProtoGENI platform at the University of Utah and two VNode infrastructures in Japan, the slice creation and deletion time was measured and evaluated to be acceptable. Although this federation-less-federation imple- mentation still has several minor problems, it was proved to be useful for experiments and demonstrations.

Introduction to this research theme: Network virtualization

Kanada, Y., Artificial Life and Robotics, Vol. 19, No. 4, pp. 311-316, November 2014, http://dx.doi.org/10.1007/s10015-014-0182-9
[ 日本語のページ ]
[ Springer's page (preprint) ]
[ Paper (draft) ]
[ Original paper (ISAROB 2014) ]
[ Printing process (YouTube) ]

Abstract: 3D printing technology usually aims at reproducing objects deterministically designed by 3D CAD tools; however, the author has discovered that 3D printing can also generate self-organizing patterns similar to stochastic (or randomized) 1D cellular automata (CA). A method for generating patterns similar to randomized 1D or 2D CA by using a fused deposition modeling 3D printer is thus proposed. With constant head motion and constant filament extrusion and without explicit randomness, this method generates very fine emergent patterns with natural fluctuation. By means of this method, each time a different pattern is generated. In addition, a computational CA model that simulates the above process is also proposed. The proposed method will open a new horizon of 3D printing applications.

Introduction to this research theme: 3D shape formation technologies

Kanada, Y., 4th International Conference on Additive Manufacturing and Bio-Manufacturing
(ICAM-BM 2014, Beijing), 2014-11.
[ 日本語のページ ]
[ Slides PDF file (w/o video) to be uploaded ]
[ Slides (Keynote file with video, for Macintosh) ]
[ Paper PDF file - not presented at the conference ]

[ "Generative art" shop (Japan only) ]

Abstract: Direction-specified 3D modeling and FDM-based printing methods enable expression of natural directions, such as hairs, fabric, or other directed textures, in modeled objects. This paper describes a method for creating various shapes of generative artistic objects with several specialized attributes by applying three new techniques to the direction-specified methods for better artistic expressions. The most important technique is “deformation”, which enables deforming simple 3D models to create varieties of shapes much more easily in generative design processes. The second technique is called the spiral/helical printing method, which enables consistent print-direction vector field, i.e., filament directions, of the surface consistent with those of the interior portion and enables seamless or less-seam printing results. The third technique controls light reflection while printing by using the spiral/helical printing method with transparent PLA. It enables the printed objects reflect light brilliantly. The proposed method with these three techniques was implemented as a Python library and evaluated by printing various shapes, and it is confirmed that this method works well and objects with attractive attributes can be created.

Introduction to this research theme: 3D shape formation technologies

Kanada, Y., IPSJ Summer Programming Symposium 2014 (in Japanese), 2014-8
[ 日本語のページ ]
[ Slides (Japanese PDF version, no movie) ]
[ Slides (Japanese Keynote version, with movie, for Macintosh) ]
[ Slides (English PDF version, no movie) ]
[ Slides (English Keynote version, with movie, for Macintosh) ]
[ Paper PDF file (in Japanese) ]
[ Printing process (YouTube) ]

[ “3D turtle graphics ” Python library and usage example ]

English version of this paper (IJERA)

Abstract: When creating forms by using a 3D printer, usually, a static (declarative) model designed by using a 3D CAD system is translated and sent to the printer. However, widely-used FDM-type 3D printers inputs a dynamical (procedural) program that describes control of motions of the print head and extrusion of the filament. If the program is expressed by a programming language or a library in a straight manner, 3D objects can be created by a method similar to turtle graphics. Such a library, “turtle 3D printing” library, which is open-source, was described by Python and used (tried). Although this problem has a problem that it cannot print in the air; however, if this problem is solved by an appropriate method, shapes drawn by 3D turtle graphics can be embodied by this method.

Introduction to this research theme: 3D shape formation technologies

Kanada, Y., 22nd International Conference on Software, Telecommunications and Computer Networks (SoftCom 2014), September 2014, http://dx.doi.org/10.1109/softcom.2014.7039092
[ 日本語のページ ]
[ Paper PDF file ]
[ Slides PDF file ]

Abstract: A previously developed plug-in architecture for network-virtualization nodes allows network operators to introduce new types of virtual nodes and links and slice developers to use them in slices (i.e., virtual networks). In this paper, a method for extending network-virtualization infrastructures by introducing plug-ins to nodes in the infrastructure and a freely-designed plug-in-specific packet header, which enable sharing part of packet contents among the same type of plug-ins distributed in the infrastructure, is proposed. The header is inserted into every data packet handled by the nodes, but it is hidden from slices in a “clean virtualization” infrastructure. This method was applied to creation of a new type of virtual links with network-delay measurement function using a hidden timestamp in each packet. The timestamps do not affect slices; that is, conventional programs can be used in the slice for the measurement without modification. The method was evaluated by edge-to-edge delay measurements and the evaluation results show that it is suitable for developing new functions, including functions requiring wire- rate performance, in shared/public networks.

Introduction to this research theme: Network virtualization

Kanada, Y., Procedia Computer Science, Vol. 34, pp. 661-667, 2014.
Kanada, Y., Workshop on Software Defined Networks for a New Generation of Applications and Services (SDN-NGAS 2014), August 2014, http://dx.doi.org/10.1016/j.procs.2014.07.094
[ 日本語のページ ]
[ Paper PDF file (Science Direct) ]
[ Paper PDF file (in this site) ]
[ Slides PDF file ]

Abstract: Although nodes in a network-virtualization infrastructure, which is called a virtualization node, usually contain a switch or a router with sophisticated and high-performance functions such as Ethernet switching, VLAN, and IP routing, most of such infrastructure functions cannot be reused as program components by slices. Accordingly, a method for providing such functions to slices on a virtualization node (VNode) infrastructure, by applying the previously proposed plug-in architecture, is proposed. This architecture defines two types of plug-ins, i.e., control plug-ins and data plug-ins, and interfaces for them. As for the proposed method, the switch or router in the VNode is regarded as a data plug-in, and a control plug-in that allocates and isolates the switch/router resources was developed. The data plug-in interface was customized to handle a data plug-in, i.e., a layer-3 switch in a VNode, and a control plug-in and the interfaces for providing layer-3/VLAN switch functions to slices were designed, implemented, and evaluated. The evaluation result shows that instead of specifying a routing/switching program or method, specifying only an additional 8 to 25 lines in a slice definition enables slice developers to use routing and switching functions.

Introduction to this research theme: Network virtualization

Kanada, Y., and Tarui, T., Poster, Network Virtualization Symposium 2014, July 2014. Network Virtualization Symposium 2013, September 2013.
[ 日本語のページ ]
[ Poster PDF file ]

Summary: A method for providing functions of VNode infrastructure switches, such as switching or routing, to slices is proposed. The plug-in interfaces and the interfaces for providing layer-3/VLAN switch functions to slices were designed, implemented, and evaluated.

Introduction to this research theme: Network virtualization

Kanada, Y., 2014 International Symposium on Flexible Automation (ISFA 2014), 2014-7.
[ 日本語のページ ]
[ Paper PDF file ]
[ Slides PDF file (w/o video) ]
[ Slides (Keynote file with video, for Macintosh) ]
[ Printing process 1 (YouTube) ]
[ Printing process 2 (YouTube) ]

Abstract: Although 3D objects to be printed may have “natural direction” or intended direction for printing, most 3D printing methods slice and print them horizontally. This causes staircase effect on the surface and prevents expression of the natural or intended direction; that is, the natural direction and the printing direction contradict. This paper proposes a methodology for direction-specified 3D printing and methods for designing, partitioning, and printing 3D objects with specified printing direction using a fused deposition modeling (FDM) printer. By using these methods, printed objects do not only have unnatural steps but also enables to express the direction explicitly. By developing and evaluating a set of methods based on this methodology, chained rings of an Olympic symbol are designed, partitioned, and printed by a delta-type 3D printer, which is cheaper but can move quick vertically. The rings were well designed and printed rings look well. Although there are still several unsolved problems including difficulty in deciding part partition points and weakness in the partition points, this methodology will probably enable new applications of 3D printing, such as 3D calligraphy.

Introduction to this research theme: 3D shape formation technologies

Kanada, Y., 20th International Workshop on Cellular Automata and Discrete Complex Systems (Automata 2014), July 2014.
[ 日本語のページ ]
[ Paper PDF file ]
[ Paper PDF file (extended ver. for IWNC8 book) ]
[ Slides (reduced size) ]
[ Slides (with a movie, Keynote) ]
[ Printing process (YouTube) ]

Abstract: 3D printers are usually used for printing objects designed by 3D CAD exactly, i.e., deterministically. However, 3D printing process contains stochastic self-organization process that generate emergent patterns. A method for generating fully self-organized patterns using a fused deposition modeling (FDM) 3D printer has been developed. Melted plastic filament is extruded constantly in this method; however, by using this method, various patterns, such as stripes, splitting and/or merging patterns, and meshes can be generated. A cellular-automata-based computational model that can simulate such patterns have also been developed.

Introduction to this research theme: 3D shape formation technologies

Kanada, Y., BIT’s 1st Annual International Congress of 3D Printing, Dalian, China, June 27-29, 2014.

[ 日本語のページ ]
[ Slides w/o movies (PDF) (old ver) ]
[ Full-set slides (for Keynote, 65 MB) (old ver) ]
[ Printing process 1 (YouTube) ]
[ Printing process 2 (YouTube) ]

Abstract – Conventional 3D design methods design only the surface of 3D objects and conventional 3D printing methods only slice and print 3D objects horizontally. We in Dasyn.com develop new 3D design methods that enable designing real 3D objects including the internal structures and textures, and develop new 3D printing methods that enable printing patterns with non horizontal directions. The “real 3D design method” makes transparent objects and objects with holes much more realistic, and the non-horizontal 3D printing method enables naturally-directed objects such as 3D calligraphies. We also develops a naturally randomized or fluctuated 3D printing method. We seek partners who will develop applications of these methods.

Introduction to this research theme: 3D shape formation technologies

Yasusi Kanada, ACM SIGPLAN Workshop on Memory Systems Performance and Correctness (MSPC 2014), poster, June 2014.
[ 日本語のページ ]
[ Poster photo ]
[ Draft poster ]

Introduction to this research theme: Network virtualization

Kanada, Y., 2nd International Workshop on Network Management and Monitoring (NetMM 2014), May 2014, http://dx.doi.org/10.1109/waina.2014.112
[ 日本語のページ ]
[ Paper PDF file ]
[ Slides PDF file ]

Abstract – A network processor (NP) usually contains multiple packet processing cores (PPCs) and a control processing core (CPC), and the synchronization and communication between CPC and PPCs, which is required for controlling an NP, is very complex. To reduce the complexity, a method for controlling packet processing in NPs by using PPCs is proposed. By means of this method, complex control messages are partially processed and divided into simplified control packets by a CPU outside the NP chip, and these packets are sent to a control-processing PPC. The control-processing PPC controls data-processing PPCs by using data-exchange mechanisms, such as a shared memory or an on-chip network, which are more uniform and simpler than those between a CPC and PPCs. This control method is applied to a virtual-link controlprocessing task and packet-processing tasks in a network node with a virtualization function. Both tasks are described by a hardware-independent high-level language called “Phonpl,” and communication between the PPCs is programmed following normal and uniform shared-memory semantics. As a result, programming the control-processing task and porting the program become much easier.

Introduction to this research theme: Network virtualization

Kanada, Y., 1st IEEE/IFIP International Workshop on SDN Management and Orchestration (SDNMO 2014), May 2014, http://dx.doi.org/10.1109/noms.2014.6838417
[ 日本語のページ ]
[ Paper PDF file ]
[ Slides ]

Abstract – Network virtualization introduces two concepts: slice (i.e., virtual network), which consists of virtual nodes and links, and slice developer, which is the third role in networks. Slice developers can introduce new network services by using slices. A method for introducing new types of virtual nodes and links for new services into the slicedefinition language and the virtualization infrastructure by evolving physical nodes (i.e., “virtualization nodes” or VNodes) is proposed. This evolution consists of two stages: the experimental stage and the operational stage. In the experimental stage, data and control plug-ins are developed and tested by the operator or vendor by using experimental sliver definitions. In the operational stage, which is focused on in this study, the plug-ins are integrated into original components in the infrastructure and are available for slice development by using normal sliver definitions. By mapping type names to plug-in identifiers and parameters, the proposed method enables abstract and simple definitions of slices by slice developers and authorization of plug-ins by the operator, but it remains the loose integration of the new function, i.e., the plug-in architecture used in the experimental stage. Prototyping and evaluation demonstrates that this method greatly simplifies both slice developers’ tasks and operators’ tasks.

Introduction to this research theme: Network virtualization

Kanada, Y., 8th International Workshop on Natural Computing (IWNC 2014), 2014-3.
[ 日本語のページ ]
[ Slides ]
[ Book ]
[ Printing process (YouTube) ]

Abstract: Fused deposition modeling (FDM) is a 3D-printing method that shapes 3D objects by layering melted plastic filament. The process of this type of 3D printing can be regarded as asynchronous cellular-automata because it generates 1D on-off pattern per a head motion. Especially, by a constant head-motion at reduced constant extrusion-velocity, a 3D printer can generate self-organized grids or similar structures, which is much finer than artificial (i.e., program-controlled) patterns. Depending on the parameter values, i.e., layer depth, extrusion velocity, and so on, the generated pattern varies among regular stripes, stripes with crossing waves, and splitting and merging patterns. Some of the patterns can be simulated by a computational model, i.e., asynchronous cellular automata.

Introduction to this research theme: 3D shape formation technologies

Kanada, Y., 19th International Symposium on Artificial Life and Robotics (AROB 2014), 2014-1.
[ 日本語のページ ]
[ Paper (updated after the symposium) ]
[ Slides ]
[ Printing process (YouTube) ]

Abstract: 3D printing technology usually aims reproducing objects deterministically designed by 3D CAD tools. However, 3D printing can generate patterns similar to randomized (non-deterministic) 1D or 2D cellular automata (CA). Cheap fused deposition modeling (FDM) 3D printers can be used for this purpose. By using an FDM 3D printer, melted plastic filament is extruded by a hot nozzle to shape a 3D object. They can generate CA-like patterns with constant head motion and constant filament extrusion and with unintended fluctuation but no explicit randomness. Because of fluctuation, every time the printer generates a different emergent pattern. This paper proposes a method for printing seaweed-like patterns of 1D and 2D CA using FDM, and computational CA models. This method will open a new horizon of 3D printing applications.

Introduction to this research theme: 3D shape formation technologies

Kanada, Y., 2013 Workshop on
Software Defined Networks for Future Networks and Services (SDN4FNS 2013), November 2013, http://dx.doi.org/10.1109/sdn4fns.2013.6702531
[ 日本語のページ ]
[ Paper PDF file ]
[ Slides ]

Abstract: Virtualization nodes, i.e., physical nodes with network virtualization functions, contain computational and networking components. Virtualization nodes called “VNodes” enabled mutually independent evolution of computational component called programmer and networking component called redirector. However, no methodology for this evolution has been available. Accordingly, a method for evolving programmer and redirector and developing new types of virtualized networking and/or computational functions in two steps is proposed. The first step is to develop a new function without updating the original VNode, which continues services to existing slices, using a proposed plug-in architecture. This architecture defines predefined interfaces called open VNode plug-in interfaces (OVPIs), which connect a data and a control plug-ins to a VNode. The second step is to merge the completed plug-ins into the original programmer or redirector. A prototype implementation of the above plug-in architecture was developed, tested, and evaluated. The prototype extends the redirector by adding new types of virtual links and new types of network accommodation. Estimated throughputs of a VLAN-based network accommodation and a VLAN-based virtual link using network processors are close to a wire rate of 10 Gbps.

Introduction to this research theme: Network virtualization

Kanada, Y., and Tarui, T., Network Virtualization Symposium 2013, September 2013.
[ 日本語のページ ]
[ Poster PDF file ]

Summary: VNode enabled mutually independent evolution of programmers and redirectors. In this presentation, a method for evolving VNodes and developing new species of virtual links by using both control and data plug-ins and a publicly available testbed is proposed.

Introduction to this research theme: Network virtualization

Kanada, Y., International SFF Symposium 2013, August 2013.
[ 日本語のページ ]
[ Poster content + explanation ]
[ Updated poster PDF file ]
[ Poster photo ]

Abstract: Usually, objects are horizontally sliced when printed by 3D printers. Therefore, if an object to be printed, such as a collection of fibers, originally have natural direction in shape, the printed direction contradicts with the natural direction. By using proper tools, such as field-oriented 3D paint software, field-oriented solid modelers, field-based slicing algorithms, and non-horizontal FDM 3D printers, the natural direction can be modeled and objects can be printed in a direction that is consistent with the natural direction. This consistence results in embodiment of momentum or force in expressions of the printed object. To achieve this goal, several manufacturing problems, but not all, have been solved. An application of this method is (Japanese) 3D calligraphy.

An online-journal version is available.

Introduction to this research theme: 3D shape formation technologies

Kanada, Y., IEICE 7th Network Virtualization SIG, July 2013.
[ 日本語ページ ]
[ Paper PDF file ]
[ Slides ]

Abstract: Network processors are used for high-performance programmable networks. However, programs for net- work processors are limited in portability and number of developers, so the development cost is high. To solve this problem, open, high-level, and portable programming language called “CSP” and a development environment called “+Net” have been developed. In this environment, high throughput can be obtained without programmers’ signifi- cant awareness of SRAM/DRAM distinction. A prototype using Cavium Octeon, a network processor, has been de- veloped, and it performs 7.5 Gbps or more in simple programs in an evaluation using part of the network virtualization platform.

Introduction to this research theme: Network virtualization

Kanada, Y., Tarui, T., and Shiraishi, K., IFIP/IEEE International Symposium on
Integrated Network Management (IM 2013), 2013-5.
[ 日本語のページ ]
[ Paper PDF file ]
[ Slides ]

Abstract: A method for federating multiple network-virtualization platforms by creating and managing slices (virtual networks) is proposed. A cross-domain slice can be created, deleted, or modified by sending a slice specification to the domain controller (network manager) of one domain. The specification is then propagated to other domains. Two chal­lenges were addressed while this method was developed. The first challenge is to enable federation among multiple domains that do not support federation functions by only adding a few components without modification of the existing network-virtualization-platform architecture. A domain-dependent specification of a slice, containing a pseudo virtual node that encloses a part of the slice specification in the other domains, is used, and this part is handled by a proxy node that represents another domain and a control component that implements a federation API to create a cross-domain slice. The second challenge is to enable manageable non-IP (arbitrary-format) data communication on a cross-domain slice. For an inter-domain communication, underlay VLAN parameters including MAC addresses are negotiated in advance and data packets on a slice are tunneled between gateways in these domains. The proposed federation method was implemented on two network-virtualization platforms, federation between two homogeneous domains was successfully demonstrated, federation perfor­mance was measured, and several issues on functional restrictions and implementation difficulty were found.

Introduction to this research theme: Network virtualization

Kanada, Y., Shiraishi, K., and Nakao, A., IEICE Trans. Commun., Vol. E96-B, No. 1, pp. 20-30, 2013, http://dx.doi.org/10.1587/transcom.e96.b.20
[ 日本語のページ ]
[ Paper PDF file ]

Abstract: One key requirement for achieving network virtualization is resource isolation among slices (virtual networks), that is, to avoid interferences between slices of resources. This paper proposes two methods, per-slice shaping and per-link policing for network-resource isolation (NRI) in terms of bandwidth and delay. These methods use traffic shaping and traffic policing, which are widely-used traffic control methods for guaranteeing QoS. Per-slice shaping utilizes weighted fair queuing (WFQ) usually applied to a fine-grained flow such as a flow from a specific server application to a user. Since the WFQ for fine-grained flows requires many queues, it may not scale to a large number of slices with a large number of virtual nodes. Considering that the purpose of NRI is not thoroughly guaranteeing QoS but avoiding interferences between slices, we believe per-slice (not per virtual link) shaping satisfies our objective. In contrast, per-link policing uses traffic policing per virtual link. It requires less resource and achieves less-strict but more-scalable isolation between hundreds of slices (500 to 700 slices in estimation). Our results show that both methods perform NRI well but the performance of the former is better in terms of delay. Accordingly, per-slice shaping (with/without policing) is effective for delay-sensitive services while per-link policing may be sufficiently used for the other types of services.

Introduction to this research theme: Network virtualization

Kanada, Y., Shiraishi, K., and Nakao, A., 13th IEEE International Conference on Communication Systems (ICCS 2012), November 2012, http://dx.doi.org/10.1109/iccs.2012.6406171
[ 日本語のページ ]
[ Paper PDF file ]
[ Slides PDF file (1 slide per page) ]

Abstract: “Virtualization nodes” (VNodes) for programma­ble network-virtualization platforms are being developed. Criteria for “clean” network-virtualization are devised and applied to this platform and slices (virtual networks). These criteria meet one of the challenges targeted by the Virtualization Node Project, that is, to enable mutually independent development and evolution of compo­nents (namely, computational compo­nents called programmers and networking compo­nents called redirectors) in VNodes. To meet this challenge, the redirector plays the central role in implementing the following two functions of VNodes. The first function is creation of mapping between virtual links to external physical paths and mapping between virtual links to internal physical paths, which makes it possible to hide various alterna­tive computa­tional components in the VNode from the external network and to hide these external-network representa­tions from the internal compo­nents. The second function is imple­mentation of high-performance data conversion, which connects the exter­nal and internal data formats or mappings, by using an add-on card with a network processor. Two results are obtained from the performance evaluation of these functions. First, the overhead caused by mapping creation can be hidden by other tasks under normal conditions, but the overhead caused by mapping deletion must be reduced. Second, the data-conversion rate is half the wire rate, which should be increased in future work.

Introduction to this research theme: Network virtualization

Kanada, Y., Shiraishi, K., and Nakao, A., IARIA Infocomp 2012, 2012-10-24.
[ 日本語のページ ]
[ Paper PDF file ]
[ ThinkMind Paper page ]
[ Slides PDF file ]

Abstract: The architecture for programmable networkvirtualization platforms, i.e., the VNode architecture, has been developed in a project called the Virtualization Node Project. This paper introduces a type of physical node called Network ACcommodation Equipment (NACE) to the VNode architecture. NACE has dual roles in this architecture. The first role is as a network-slice gateway between an external network (Ethernet/VLAN) and a slice (virtual network). NACE can accommodate a data center or another testbed in a slice with high-performance (up to 10 Gbps) data-format conversion. The second role is as a special type of virtualization node that implements intra-slice virtual switch by using Ethernet hardware, which can replace software-based switching using a VM or a network processor. These roles are modeled as a node sliver (virtual node) with a gateway function and a node sliver with a switching function (i.e., a switch node-sliver), and these node slivers are specified by using XML. These functions were evaluated by using two testbeds, and the evaluation results confirm that both functions work correctly and perform well in terms of delay and packet loss.

Introduction to this research theme: Network virtualization

Kanada, Y., Shiraishi, K., and Nakao, A., IEICE SIG on Information Networks, 2012-3-5.
[ 日本語のページ ]
[ Paper PDF file (in Japanese) ]
[ Slides PDF file (in Japanese) ]

Abstract: On the network virtualization platform that consists of multiple virtualization nodes (VNodes), multiple slices (virtual networks) can be operated simultaneously while isolated from other slices. Virtual nodes (node slivers) can be connected freely by using virtual links (link slivers) at up to 10-Gbps, and arbitrary protocol, which is not constrained by Ethernet or IP, can be used on the slice. VNodes implement virtual links on IP networks by using GRE tunnels. In addition, by using a network accommodation equipment (NACE, NC) that translates the packet data format to an external format, slices can be connected to external VLAN networks at up to 10-Gbps. This paper describes how such connections are referenced and defined by slice developers and how they are translated and physical communication is realized.

Introduction to this research theme: Network virtualization

Kanada, Y., Shiraishi, K., and Nakao, A., 17th IEEE Symposium on Computers and Communication (ISCC 2012), 2012-7-4, http://dx.doi.org/10.1109/iscc.2012.6249393
[ 日本語のページ ]
[ Paper PDF file ]
[ Slides PDF file ]

[ IEEExplore Paper page ]

Abstract: One key requirement for achieving network virtualization is resource isolation among slices (virtual networks), that is, to avoid interferences between slices of resources. This paper proposes two methods, per-slice shaping and per-link policing for network-resource isolation (NRI) in terms of bandwidth and delay. These methods use traffic shaping and traffic policing, which are widely-used traffic control methods for guaranteeing QoS. Per-slice shaping utilizes weighted fair queuing (WFQ) usually applied to a finegrained flow such as a flow from a specific server application to a user. Since the WFQ for fine-grained flows requires many queues, it may not scale to a large number of slices with a large number of virtual nodes. Considering that the purpose of NRI is not thoroughly guaranteeing QoS but avoiding interferences between slices, we believe per-slice shaping suffices our objective. In contrast, per-link policing uses traffic policing per virtual link. It requires less resource and achieves less strict isolation between hundreds of slices. Our results show that both methods perform NRI well but the performance of the former is better in terms of delay. Accordingly, per-slice shaping is effective for delay-sensitive services while per-link policing may be sufficiently used for the other types of services.

Introduction to this research theme: Network virtualization

Kanada, Y. and Nakao, A., World Telecommunication Congress 2012 (WTC 2012), 2012-3-5.
[ 日本語のページ ]
[ Paper PDF file ]
[ IEEExplore Paper page ]
[ Slides PDF file ]

Abstract: We have developed an experimental non-IP/non-Ethernet protocol called IPEC (IP Ether Chimera). IPEC switches learn IPEC addresses that are structured hierarchically, similar to IP addresses, using an algorithm that extends the learning algorithm of Ethernet switches. IPEC is a simple non-IP network-layer protocol that has features of both Ethernet and IP. Unlike IP, IPEC introduces an address group to manage multiple terminals as a group to make learning of mobile terminals more scalable and more efficient than Ethernet. Because an address group is the unit of learning in IPEC, it is more scalable than Ethernet, and mobile groups can be learned more efficiently. In addition, IPEC tolerates loops in a network as long as a limited number of duplicate packets are allowed, and thus, enable an alternative route against link failures. We have implemented IPEC both on an IPEC-capable switches using LAN cards and on a virtual network using virtualization nodes (VNodes), which have been developed to experiment with non-IP protocols such as IPEC. We show evaluations that the group learning function of IPEC is viable especially for multiple terminals moving together concurrently.

Introduction to this research theme: Network virtualization

Kanada, Y., and Nakao, A., 3nd IEICE SIG on Network Virtualization, 2012-3-2.
[ 日本語のページ ]
[ Slide PDF file (in Japanese) ]

(No paper is available.)

Abstract: In a collaboration project, the virtualization node (VNode) and the virtualization platform are developed. A feature of VNode is architecture that supports independent component-evolution. In this presentation, we propose clean-virtualization concept, and show that VNode realizes this concept, and that this concept is important to implement architecture that supports independent component evolution. In addition, we show the method of implementing the architecture and realizing the condept in VNode, especially the implementation of the architecture in the redirector, a part of VNode.

Introduction to this research theme: Network virtualization

Yasusi Kanada, Kei Shiraishi, and Akihiro Nakao, COMSNETS 2012, January 2012, http://dx.doi.org/10.1109/comsnets.2012.6151366
[ 日本語のページ ]
[ Paper PDF file ]
[ Poster PDF file ]
[ IEEExplore Paper page ]

Abstract: In network virtualization [Nak 10a], it is important to avoid resource interference, e.g., concerning communication bandwidth and delay, so that a single slice (virtual network) may not disrupt the whole infrastructure. To avoid this type of interference, a method for network-resource isolation (NRI) must be developed. Two types of traffic-control mechanisms, i.e., traffic shaping and traffic policing, can be used for NRI. To more effectively implement NRI using these mechanisms, two methods are proposed in this study: the “per-slice shaping” using weighted fair queuing (WFQ) and the “per-link policing” (per-virtual-link policing).

Introduction to this research theme: Network virtualization

Yasusi Kanada and Toshiaki Tarui, 2nd IEICE SIG on Network Virtualization, 2011-11-10.
[ 日本語のページ ]
[ Slide PDF file (in Japanese) ]

(No paper is available.)

Abstract: In collaboration projects funded by NICT, we develop a mechanism of federation among the virtualization platform developed by the Virtualization Node Project and G-lambda, ProtoGENI, and other platforms. This mechanism enables generation and management of slices extending through the virtualization platforms. We presents a method for enabling federation without recreating the virtualization platform without federation function, but only by adding additional functions.

Introduction to this research theme: Network virtualization

Kanada, Y., and Tarui, T., 25th International Conference on Information Networking (ICOIN 2011), January 2011, http://dx.doi.org/10.1109/icoin.2011.5723191
[ 日本語のページ ]
[ Paper PDF file ]
[ IEEExplore Paper page ]

Abstract: In cloud-computing environments, migration of virtual machines (VMs) between data centers can solve many problems such as load balancing and power saving. One of the difficulties in wide-area migration, however, is the “address-warping” problem, in which the address of the VM warps from the source server to the destination server. This confuses or complicates the status of the WAN, and the LANs connected to the WAN. We propose two solutions to this problem. One is to switch an address-translation rule, and the other is to switch multiple virtual networks. The former is analogous to paging in memory virtualization, and the latter is analogous to segmentation. The “network-paging” based method is described and our evaluation results are shown. It took less than 100 ms in average to switch from the source to the destination server using this method.

Introduction to this research theme: Policy-based Networking

Kanada, Y., and Tarui, T., 10th International Conference on Networks (ICN 2011), 2011-1-24.

[ 日本語のページ ]
[ Paper PDF file (C) IARIA ]
[ ThinkMind Paper page ]
[ Slides PDF file ]

Abstract: Two network-virtualization architectures, namely, network segmentation and network paging, were investigated. They are analogical to two memory-virtualization architectures: segmentation and paging. Network paging, which is relatively new and is based on a type of network-address translation (NAT), is focused on. This architecture requires smaller packet size and has several more advantages over the conventional architecture (i.e., network segmentation). Intranet- and extranet- type communication methods based on this architecture are described. An address translators is placed at each edge router in the WAN and used to evaluate client-server communication under wide-area virtual-machine (VM) live migration as a case of extranet-type communication.

Introduction to this research theme: Policy-based Networking

Kanada, Y., and Nakao, A., IEICE Technical Committee on Internet Architecture (IA), 2010-12-17.

[ 日本語のページ ]
[ Paper PDF file (C) IEICE (in Japanese) ]
[ Slides PDF file (in Japanese) ]

Abstract: The virtualization-node project at the National Institute of Information and Communications Technology (NICT) is developing 10-Gbps-class virtualization nodes (VNodes) that enables implementing non-IP protocols with any frame format using network-virtualization technology. In this project, because the VNodes have been introduced into the R & D test-bed network called JGN2plus, an important challenge is to improve usability for developers (JGN2plus users). There-fore, we developed and tested a non-IP protocol called IPEC (IP-Ether-Chimera) on the experimental network using the VNodes, described the procedure and experiments, and extracted the problems and knowhow concerning usability. A problem to solve is to develop methods for avoiding careless mistakes by developers, and an obtained knowledge is that a combination of a small-scale experiment using connected several Linux PCs and a scaled-up experiment on wide-area network reduced the complexity of the development. This experiment did not need wide bandwidth, but this method will enable scaling up the experiment utilizing 10-Gbps bandwidth relatively easier.

Introduction to this research theme: Policy-based Networking

Kanada, Y., and Nakao, A., IEICE Technical Committee on Information Networks (IN), 2010-9-2.

[ 日本語のページ ]
[ Paper PDF file (C) IEICE (in Japanese) ]
[ Slides PDF file (in Japanese) ]

Abstract: In the National Institute of Information and Communications Technology (NICT), 10-Gbps-class virtualization nodes (VNodes) that enables implementing non-IP protocols with any frame format are developed using network-virtualization technology. We have developed an experimental non-IP protocol called IPEC (IP Ether Chimera) on a virtual network us-ing the VNodes. In IPEC, the nodes learn addresses that can be hierarchical such as IP addresses using an algorithm that extends Ethernet switch learning algorithm. IPEC has the following features. First, IPEC realizes a simple single-layer non-IP protocol that has features of both Ethernet and IP. Second, because a group is the unit of learning in IPEC, it is more scalable than Ethernet, and mobile groups can be more efficiently learned. Third, this forwarding algorithm can be used in networks with loops and it can forward packets during failure using an alternative route. Group IDs can be used as locators, so IPEC can be regarded to realize an architecture that extends ID/Locator separation architecture. We implemented IPEC on VNodes, and confirmed that it enabled group learning and group mobility by experiments.

Introduction to this research theme: Policy-based Networking

Yasusi Kanada, Not yet published, 1998.

[ Paper PDF file ]
[ Paper PostScript file ]

Abstract: Most conventional text retrieval methods are designed to search for documents. However, users often do not require documents themselves, but are searching for spe-cific information that may come from a large collection of texts quickly. To satisfy this need, we have developed a model and two methods for fine-grained searching. The unit of search in this model is called an atom, and it can be a sentence or smaller syntactic unit. A score, i.e., a relevance value, is defined for each atom and for each query, and the score is propagated between atoms. By using the two methods, excerpts from texts surrounding the search-result items and/or hyperlinks to the document parts that include the items are displayed. Multiple topics in a document can be separately listed in a search result. Evaluation of two prototypes, using a conventional full-text search engine as is or with only a small modification, has demonstrated that these methods are feasible and can decrease the search cost in terms of time and effort for users.

Introduction to the research theme: Axis-Specified Search (Thematic Search)

Kanada, Y., IEICE Technical Committee on Information Networks (IN), 2009-5-21.

[ 日本語のページ ]
[ Paper PDF file (C) IEICE ]

Abstract: A mechanism for users to input a request on quality of experience (QoE) and for the network to satisfy the request. A QoE request is mapped to QoS, and it is satisfied by using admission control and network node configurations. By using a soft-state protocol for the request, service initiation, extension, and termination are handled in a unified method. Part of this mechanism has been built into a prototype, and tested using a network node with so-called hierarchical shaper and using video streaming, the mechanism has been confirmed to work in a designed way.

Introduction to this research theme: Policy-based Networking

Kanada, Y., 5th Advanced International Conference on Telecommunications (AICT 2009), May 2009, http://dx.doi.org/10.1109/aict.2009.16 [The presentation was canceled because of the new type of influenza.]

[ 日本語のページ ]
[ Paper PDF file ]
[ IEEExplore Paper page ]

Abstract: A method of admission control based on both resource requests by applications and class-based traffic mea-surement results was developed. In this method, a wide range of admission-control policy can be realized by adjusting three parameters, , , and . A policy-server prototype using this method and simulated voice traffic was used in traffic measurements. The measurements results show that the proposed method improves bandwidth usage and decreases call-blocking ratio while incurring low measurement load. Interesting but possibly harmful dynamics (i.e., system behavior) were observed by the simulations using traffic generated by an on/off model. That is, this admission-control method may cause oscillation or long-term evolution that lasts for 100 to 150 minutes, and it may also cause bandwidth “overshooting”. The range of parameters with which such effects can be properly suppressed and the admission control correctly works was experimentally obtained.

Introduction to this research theme: Policy-based Networking

Kanada, Y., IEICE Technical Committee on Network Systems (NS), 2009-4-16.

[ 日本語のページ ]
[ Paper PDF file ]

Abstract: A method of admission control based on both resource requests by applications and traffic measurement results per DiffServ class using NetFlow was developed. Several experiments using a newly-developed policy-server prototype using this method and simulated voice traffic showed that bandwidth usage can be improved and call blocking ratio was decreased with low measurement load by using this method. Interesting but possibly harmful dynamics were observed by simulations using simulated traffic that follows an on/off model; i.e., this admission control method may cause oscillation or long-term development that lasts for 100 to 150 minutes, and it may also cause bandwidth overshooting. The range of parameters, with which such phenomena can be properly suppressed and the admission control correctly works, was experimentally obtained.

Introduction to this research theme: Policy-based Networking

Kanada, Y., The International Conference on Information Networking 2008 (ICOIN 2008), I-1, January 2008, http://dx.doi.org/10.1109/icoin.2008.4472753
[ 日本語のページ ]
[ Paper PDF file ]
[ IEEExplore Paper page ]

Abstract: Real-time and multimedia applications require an end-to-end QoS guarantee, and various types of applications require various QoS conditions. A DiffServ network should guarantee different QoS conditions for different types of communications. In this paper, the effect of traffic control in a DiffServ core network is experimentally evaluated using bursty traffic generated by an MMPP (Markov-Modulated Poisson Process) model. The situation to be simulated is that there are hundreds of conversational video streams that are delay-sensitive and hundreds of streaming videos that are loss-sensitive. If there are bandwidth-sharing queues such as those follow WFQ (Weighted Fair Queuing) in the core no-des and the two types of video traffic are assigned to two of the queues, the requirements of both types of traffic can be satisfied in a better way (a more efficient way) by assigning a larger weight to the queue for the conversational video. In our experiment, the optimum ratio of the weights was ap-proximately 1.3 when the traffic rates were the same. The optimum weight shares depend on the nature of the traffic, especially the burstiness.

Introduction to this research theme: Policy-based Networking

Kanada, Y., not yet published (April 2008).

[ 日本語のページ ]
[ 論文 PDF ファイル ]

Abstract: Real-time and multimedia applications require an end-to-end QoS guarantee, and various types of applications require various QoS conditions. A DiffServ network should guarantee different QoS conditions for different types of communications. In this paper, the effect of traffic control in a DiffServ core network is experimentally evaluated using bursty traffic generated by an MMPP (Markov-Modulated Poisson Process) model. The situation to be simulated is that there are hundreds of conversational video streams that are delay-sensitive and hundreds of streaming videos that are loss-sensitive. If there are bandwidth-sharing queues such as those follow WFQ (Weighted Fair Queuing) in the core no-des and the two types of video traffic are assigned to two of the queues, the requirements of both types of traffic can be satisfied in a better way (a more efficient way) by assigning a larger weight to the queue for the conversational video. In our experiment, the optimum ratio of the weights was ap-proximately 1.3 when the traffic rates were the same. The optimum weight shares depend on the nature of the traffic, especially the burstiness.

Kanada, Y., IEICE Communication Society Convention, 2007.

[ 日本語のページ ]
[ Paper PDF file (in Japanese) ]

Currently no abstract is available.

Introduction to this research theme: Policy-based Networking

Kanada, Y., Technical Committee on Electrical Acoustics (EA), Information and Communication Engineers (IEICE), EA2007-42, August 2007.

[ 日本語のページ ]
[ Paper PDF file (updated after the SIG) (in Japanese) ]
[ Paper PDF file (draft) (in Japanese) ]

Abstract: Voiscape is a communication medium by which people can talk each other while moving within virtual sound space freely. By using a prototype of voiscape called VPIIQ (Voiscape Prototype II Q), the effect of difference of QoS caused by network policies was evaluated subjectively. The result showed unexpectedly that the percentage of correct answers was higher in the case in which QoS is lower in the localization test. In the sound localization tests, the percentage of correct answers was higher when subjects performed operations to move or to turn than not to do so. However, in the speaker recognition tests, opposite results were observed.

Introduction to this research theme: voiscape

Kanada, Y., IEICE Technical Committee on Communication Quality (CQ), Technical Reports, July 2007.

[ 日本語のページ ]
[ Paper PDF file (in Japanese) ]

Abstract: A method for scalable QoS guarantee, in which QoS requirements are signaled by using a protocol similar to RSVP or NSLP and are aggregated in backbones, has been developed and prototyped. The requirements are propagated to the policy server by using policy-based routing and a policy outsourcing protocol. The policy server estimates the amount of traffic and controls the bandwidth sharing among the queues (WFQs) of the backbone routers. The effect of core traffic control has been evaluated by using an L3-switch GS4000 and bursty traffic generated by the MMPP model. The results showed that, if there are many conversational video and streaming traffics, the QoS requirements of both types of traffic can be satisfied by relatively increasing the weight of the former than that of the latter in some cases.

Introduction to this research theme: Policy-based Networking

Kanada, Y., 13th ACM International Conference on Multimedia, pp. 794-795, November 2005, http://dx.doi.org/10.1145/1101149.1101319

[ 日本語のページ ]
[ Paper PDF file ] [ Poster PDF File ]

Abstract: We are developing a new voice communication medium called voiscape. Voiscape enables natural and seamless bi-directional voice communication by using sound to create a virtual sound room. In a sound room, people can feel others' direction and dis-tance expressed by spatial sounds with reverberations, and they can move freely by using a map of the room. Voiscape enables multi-voice-conversations. In a virtual market place that will be realized by voiscape, people can not only buy goods or information but also enjoy talking with merchants and people there. In this demo, a vois-cape prototype called VPII is used for realizing such an environ-ment. Unfortunately, because prerecorded voices are used in this demo, the participants cannot talk with merchants. However, the participants can talk each other with small end-to-end latency (less than 200 ms) and will feel the atmosphere of the virtual market place. Prerecorded people and merchants talk each other in English, Japanese and Chinese in parallel and with crossovers, and partici-pants can virtually walk among them and can selectively listen one voice or hear multiple voices at once.

Introduction to this research theme: voiscape

Kanada, Y., Asia-Pacific Network Operations and Management Symposium 2005 (APNOMS 2005), September 2005.

[ 日本語のページ ]
[ Short paper PDF paper ] [ Poster PDF paper ] [ Unpublished full paper PDF v ]

Abstract: A method for conference-room management for an auditory-virtual-space-based voice-communication medium called voiscape and a voice-communication system prototype called VPII, which used this method, were developed. With this method, conference rooms (called sound rooms) are managed through SIP and SIMPLE (a presence-related event-notification mechanism). A user can not only obtain a room list and enter (select) or exit from a room, but can also create, modify, or delete rooms by SIMPLE messaging. Rooms, users, and objects are managed by their "soft state"; i.e., they are deleted when a time out occurs. Users are informed of room membership, presence of a user, e.g., location and direction in the room, and presence of an object in the room by SIMPLE messaging, i.e., by SUBSCRIBE, NOIFY, and PUBLISH requests. To reduce the messaging overhead, the partial notification mechanism of SIMPLE is used in VPII.

Introduction to this research theme: voiscape

Kanada, Y., Technical Committee on Electrical Acoustics (EA), Information and Communication Engineers (IEICE), June 2005.

[ 日本語のページ ]
[ Paper PDF file ] [ OHP PDF file ]

Abstract: We are developing a communication medium called voiscape, which enables taking to people while selecting persons to talk by moving in a virtual "sound room". In the second prototype of voiscape called VPII, the FIR Method is used for low-delay HRTF filtering, the sound room - the range of motion - is identified with the room in acoustical cal-culation, and early reflections by the sound room walls are simulated. The early reflections produce out-of-head sound lo-calization and sound distance expression. We also implemented motion-tracking and interpolation algorithms into the spatialization method. VPII enabled a voice communication environment, in which speaker identification is easy, multiple conversation-contexts can be created in a room, and motions of users and objects in a sound room are natural and causes only small noises.

Introduction to this research theme: voiscape

Kanada, Y., 15th ACM International Workshop on Network and Operating System Support for Digital Audio and Video (NOSSDAV 2005), pp. 45-50, June 2005, http://dx.doi.org/10.1145/1065983.1065996

[ 日本語のページ ]
[ Paper PDF file ] [ OHP PDF file ]

Abstract: An improved prototype of the "voiscape" voice communication medium has been developed and subjectively evaluated. Voiscape enables natural and seamless voice communication by using sound to create a virtual "sound room" in which people, who are represented by different sounds, can move freely. It features low-delay motion-tracking spatial audio with simulated early reflections that produce out-of-head sound localization and sound distance expression. It also features virtual-location-based selective communication: a user can walk freely in the sound room using a map- and cursor-key-based user-interface and can select whom to talk to or which sound sources to listen to. A third feature is SIP-presence-event-notification (SIMPLE)-based sound room management: when users move, their locations and directions are distributed using SIP SUBSCRIBE/NOTIFY messages. The combination of these features creates a natural voice-communication space in which two or more parallel conversation contexts can coexist. Limited, subjective testing by around 200 people showed that this medium can be used for cocktail-party-like conversation; i.e., users could distinguish parallel conversations by paying attention to or by moving toward one of them.

Introduction to this research theme: voiscape

Kanada, Y., 2nd IASTED International Conference on Communication and Computer Networks (CCN 2004), November 2004.

[ 日本語のページ ]
[ Paper PDF file ] [ OHP PDF file ]

Abstract: A new voice communication medium, which the author calls "voiscape", will probably appear in near future. Voiscape shall have much improved user interface than the conventional voice communication systems, i.e., telephone and conference systems, and be based on the IP-based conferencing and spatial audio technologies. The author has developed a prototype toward voiscape, which has made a step toward solving two problems of the conventional systems i.e., complicated and restricted conference control and lack of crossed-over multi-context support, by introducing two features. The first function is the virtual-location based communication; i.e., the users can talk with other users and move, in a way similar to face-to-face conversation, in a virtual auditory space created by spatial audio technology without explicit session and floor control. The second function is personalized policy-based communication control; i.e., the users can specify communication policies that protects their privacy and reduce required resources. This function is enabled by a distributed policy-arbitration mechanism. Experiments showed that the basic mechanisms and the policy-based control with a simple policy worked well.

Introduction to this research theme: voiscape

Kanada, Y., Distributed Processing Systems SIG, Information Processing Society of Japan, March 2004.

[ 日本語のページ ]
[ Paper PDF file (in Japanese) ] [ OHP PDF file (in Japanese) ]

Abstract: The author researches toward establishing voice communication media called voiscape which shall replace telephone. A virtual "sound room" that is created by spatial audio technology is used in voiscape. We developed a prototype on PCs, in which 3-D graphic is used for supplementing spatial autio. In this prototype, JMF (Java Media Framework) was used for voice capturing and communication, and Java 3D was used for spatial audio and 3-D graphics. Before the development, the author had believed that the basic functions required for the prototype would be realized by connecting these APIs. However, in fact, they cannot be connected directly, so we used OpenAL through the interface of Java 3D. We also encountered problems of sound quality degradation and delay, but they have been almost solved by refining the program by trial and error.

Introduction to this research theme: voiscape

Kanada, Y., Technical Committee on Multimedia and Virtual Environment (MVE), Information and Communication Engineers (IEICE), October 2003.

[ 日本語のページ ]
[ Paper PDF file (in Japanese) ] [ OHP PDF file (in Japanese) ]

Abstract: The concept of a new communication medium called voiscape is proposed. A virtual "sound room" that is based on the spatial audio technology is shared among the users in voiscape, and a person can move freely in the room, can meet and depart from other people, and can talk with two or more persons by using voiscape. By enabling transmission of presence and peripheral information, voiscape will cover from a telephone-style one-to-one conversation to a variety of communication types that are impossible in conventional media, and will enable sharing the feeling of connection and releaf and sharing tacit knowledge. This paper describes usage scenes and a procedure of voiscape and also describes a PC-based prototype. In this prototype, the user can confirm the situation in front by 3D graphics, and can move around the room by using a mouse.

Introduction to this research theme: voiscape

Kanada, Y., Technical Committee on Internet Architecture (IA), Information and Communication Engineers (IEICE), October 2003.

[ 日本語のページ ]
[ Paper PDF file ] [ OHP PDF file ]

Abstract: As part of research toward establishing voice communication media that shall replace telephone, we developed an architecture and a prototype of a continuously-connected multi-user communication medium called voiscape. A virtual "sound room" that is created by spatial audio technology is used in voiscape. When the user moves within the sound room by using a mouse, the presence information including the position in the room is distributed to other users of the room. If the user becomes closer to or more distant from another user, the communication session begins or ends automatically by using SIP according to predefined policy stored in the terminals. This policy-based session control enables privacy protection and reduction of communication. When a local site requires a session start, the remote site often requires a session start concurrently, so a method of establishing a connection without connecting doubly nor becoming busy was deviced.

Introduction to this research theme: voiscape

Kanada, Y. and O'Keefe, B. J., Journal of Network and Systems Management, Vol. 11, No. 3, pp. 253-275, 2003.

[ 日本語のページ ]
[ JNSM Issue Web Page ] [ Paper PDF file (draft) ]

Abstract: We developed two rule-based building-block architectures, i.e., pipe-connection and label-connection architectures, for describing complex and structured policies, especially network QoS policies. The latter is focused on in this study. The relationships or connections between building blocks are specified by the da-taflow and control flow between them. The dataflow is specified by tags, including virtual flow labels (VFLs), which are data attached to "outside packets". The control flow can be classified and specified by four control structures: concatenation, parallel application, selection, and repetition. We have designed fine-grained and coarse-grained building blocks and methods for specifying dataflow and control flow in differentiated services (Diffserv), and implemented the coarse-grained ones in a policy server. Two cases of building-block use are described, and we concluded that there are five advantages of building-block-based policies, i.e., expressibility, uniform semantics, simplicity, flexibility, and management-task-oriented design. We also developed techniques for transforming building-block policies into executable ones, which are called policy division and fusion.

Introduction to this research theme: Policy-based Networking

Kanada, Y., Information Processing, vol. 44, No. 2, 2003.


[ 日本語のページ ]

Kanada, Y., 3rd International Workshop on Policies for Distributed Systems and Networks (Policy 2002), pp. 236-239, June 2002, http://dx.doi.org/10.1109/policy.2002.1011316
[ 日本語のページ ]
[ Paper PDF file ] [ OHP PDF file ]
[ IEEExplore Paper page ]

要約: This paper proposes a method, called the policy-extension-by-policy method, for quickly and dynamically adding policy classes with new functionality to policy servers and agents. In this method, users can add a new policy class to the policy server by using policy-definition (PD) policies, and they can define a method to translate a policy of the new class and to send to network nodes of different vendors through various types of device interfaces, such as CLI, MIBs, PIBs, APIs or hardware tables, by using policy-embedding (PE) policies. A PE policy also enables translating a policy of an existing class and sending the result to a new type of network node. PE policies contain command templates and methods for filling the templates. A program interpreter is embedded in policy agents to make flexible policy-to-configuration translation possible. A prototype system and example policies, i.e., access control, Diffserv, and VPN policies, were developed.

Introduction to this research theme: Policy-based Networking

Kanada, Y., and Yazaki, T., Communications Quality and Reliability 2002 (CQR 2002), pp. 12-16 2002.

[ 日本語のページ ]
[ Paper PDF file ] [ OHP PDF file ]

Abstract: In policy-based networks, two or more policies often have to cooperate because combined and customized network functions must be controlled using policies. Two types of policy trans-formation, policy fusion and policy division, are sometimes required to implement cooperating policy systems on high-performance hardware routers. Policy fusion transforms two or more policies into one, and policy division transforms a policy into two or more policies. These transformations causes a problem that the original policies must usually be strongly constrained to allow these transformations. This paper shows a method for resolving restrictions on the division of QoS policies by a software-hardware integration, i.e., by implementing virtual flow labels (flow IDs) in hardware and by dividing a policy and deploying the policies onto two filter blocks. We have developed a policy agent (PEP) and a gigabit router integrated by using this method. Both high-performance and flexibility are achieved by this integration.

Introduction to this research theme: Policy-based Networking

Kanada, Y., Information and Communication Engineers (IEICE) Yearly Conference，2002-3.

[ 日本語のページ ]
[ Paper PDF file (in Japanese) ] [ OHP PDF file (in Japanese) ]

Abstract: (Not available)

Introduction to this research theme: Policy-based Networking

Kanada, Y., and O'Keefe, B. J., SIG Information Networks & SIG Network Systems, Institute of Electronics, Information and Communication Engineers (IEICE), March 2002.

[ 日本語のページ ]
[ Paper PDF file ] [ OHP PDF file ]

Abstract: In policy-based networking, policies sometimes have to be combined and applied in cooperation to represent such programmable and customizable network functions as Diffserv. For a policy server called PolicyXpert, we have designed and implemented three types of policies and three types of virtual flow labels (VFLs) to connect the policy rules. The policy combination enables the representation of complex Diffserv policies. Policy combination also allows sub-classing of DSCP-based service classes, and the separation of service and subscriber policies. The careful design of Diffserv policies has enabled simple Diffserv policies to be represented in a simple form.

Introduction to this research theme: Policy-based Networking

Kanada, Y., and O'Keefe, B. J., Asia-Pacific Network Operations and Management Symposium 2001 (APNOMS 2001), September 2001, (poster paper, presentation cancelled)

[ 日本語のページ ]
[ Paper PDF file ] [ Unpublished paper PDF file ]

Abstract: Policies sometimes have to be combined and applied in cooperation to represent such programmable and customizable network functions as Diffserv. In the OpenView PolicyXpert and JP1/PolicyXpert policy servers, three types of policies and three types of virtual flow labels, to connect the policy rules, are defined for Diffserv. The combination of these policies allows the representation of complex Diffserv policies and the separation of service and subscriber policies. Diffserv policies and virtual flow labels make this possible. However, the careful design of Diffserv policies has enabled simple Diffserv policies to be represented in a simple form.

Introduction to this research theme: Policy-based Networking

Kanada, Y., 7th IFIP/IEEE International Symposium on Integrated Network Management (IM 2001), pp. 545-560, May 2001.

[ 日本語のページ ]
[ Paper PDF file ] [ OHP PDF file ]
[ IEEExplore Paper page ]

Abstract: Because higher- and lower-level policies do not necessarily correspond one to one, a higher-level network policy may have to be translated into two or more lower-level policies, and two or more cooperating higher-level policies may have to be translated into one lower-level policy. The former transformation is called a policy division, and the latter transformation is called a policy fusion. These transformations can be performed mechanically under restricted conditions as described in this paper. However, in general, they are very complicated and the restrictions cannot be eliminated completely mainly because of existence of multiple packet classifiers in a set of policies. Thus, this paper concludes that they should not be introduced if it is possible. The policy division and fusion can be avoided in certain cases, but they will not probably be able to be avoided in general. If so, the problem should be solved or relaxed by removing harmful classifiers by introducing virtual flow labels and by further studies. In addition, we may have to find a better method to control network devices than policies in the current sense.

Introduction to this research theme: Policy-based Networking

Kanada, Y., Workshop on Policies for Distributed Systems and Networks (Policy 2001), Lecture Notes in Computer Science, No. 1995, Springer, pp. 171-184, January 2001.

[ 日本語のページ ]
[ Paper PDF file ] [ OHP PDF file ]

Abstract: To control complicated and decomposable networking functions, such as Diffserv, two or more policies must cooperate. Combining two or more mutually dependent policies for a specific purpose is called policy combination. Methods of passing information between combined policies can be classified into real tags and virtual tags, or labels and attributes. Policy combinations can be classified into concatenation, parallel application, selection, and repetition. Explicitly specifying policy combinations makes policy systems semantically clearer and better suited to general use, extends the range of functionality, and improves the possibility of optimization. If policy combinations can be specified in a policy system, two types of policy organizations can be distinguished: homogeneous and heterogeneous. Heterogeneous organization is more service-oriented and seems to meet service-management requirements, but homogeneous organization is more device-oriented and may provide better performance.

Introduction to this research theme: Policy-based Networking

Kanada, Y., IEICE SIG on Information Network, Technical Reports, 100-378, IN 2000-102, pp. 47-54, October 2000.

[ 日本語のページ ]
[ Paper PDF file (in Japanese) ]

Abstract: In a policy-based network, two or more policies must often cooperate to provide a high-level function or policy. To support such building-block policies, two architectures for modeling a set of policies have been developed: pipe-connection architecture and label-connection architecture. It is shown that rule-based building blocks are better for policy-based network control and that the label-connection architecture is currently better. However, the pipe-connection architecture is better in regards to parallelism, which is very important in network environments.

Introduction to this research theme: Policy-based Networking

Kanada, Y., 2nd International Working Conference on Active Networks (IWAN 2000), Lecture Notes in Computer Science, No. 1942, pp. 195-210, Springer, October 2000.

[ 日本語のページ ]
[ Paper PDF file ] [ OHP PDF file ]

Abstract: Policy-based networks can be customized by users by injecting programs called policies into the network nodes. So if general-purpose functions can be specified in a policy-based network, the network can be regarded as an active network in the wider sense. In a policy-based network, two or more policies must often cooperate to provide a high-level function or policy. To support such building-block policies, two architectures for modeling a set of policies have been developed: pipe-connection architecture and label-connection architecture. It is shown that rule-based building blocks are better for policy-based network control and that the label-connection architecture is currently better. However, the pipe-connection architecture is better in regards to parallelism, which is very important in network environments.

Introduction to this research theme: Policy-based Networking

Kanada, Y., International Workshop on Quality of Service 2000 (IWQoS 2000), pp. 161-163, June 2000.

[ 日本語のページ ]
[ Paper PDF file ] [ OHP PDF file ]
[ IEEExplore Paper page ]

Abstract: Network node functions, such as QoS or the security functions of routers, are becoming increasingly complex, so programs, not only configuration parameters, are required to control network nodes. In a policy-based network, a policy is defined at a policy server as a set of rules that deployed at network nodes where it must be translated into an executable program or parameters. Thus, a policy must be represented by a form in which the syntax and semantics are clearly defined, and which can be mechanically translated into an executable program. This is possible if the policy is written in an appropriate rule-based programming language. This paper describes such a language in which functions required for DiffServ can be specified for the interface between a policy server and network nodes. In this language, a policy rule can be composed using predefined primitive building blocks and control structures.

Introduction to this research theme: Policy-based Networking

Kanada, Y., IEICE Networking Architecture Workshop 10th Annual Workshop, pp. 106-113, IEICE, 2000.

[ 日本語のページ ]
[ Paper PDF file ] [ OHP PDF file in Japanese ] [ OHP PDF file in English ]

Abstract: To realize internet-protocol-based QoS-assured networks, using differentiated services under policy-based networking is a promising approach. A QoS policy server must work in multi-vendor environment. To use standard protocol, such as COPS or SNMP, between the policy server and routers is not sufficient, but also to define and to standardize high-level syntax and semantics, i.e., a language, is required for interoperability. This paper describes the outline of a rule-based language for this purpose. Policy rules can be defined in the policy server and can be deployed to routers or router proxies using this language through an appropriate protocol such as COPS, SNMP, or IIOP. The language consists of several types of rules, i.e., matching, policing (or metering), marking, discarding, and scheduling types, and linkage labels that connects rules. A MIB and/or PIB that simulates the language is also explained in this paper. The language will be implemented in near future.

Introduction to this research theme: Policy-based Networking

Kanada, Y., Ikezawa, M., Miyake, S., and Atarashi, Y., draft-kanada-diffserv-qospifmib-00.txt, Internet Draft, November 1999.

[ 日本語のページ ]
[ Local textual version ] [ Slides used in 46th IETF: Configuration Management BOF, Diffserv WG, and RAP WG (not recommended) ]

Abstract: This document describes a QoS PIF MIB (Quality-of-Service Programming-Interface Management-Information-Base) to be used as an SNMP-based programming interface for routers. This MIB is intended to be a programming interface for router QoS functions, especially DiffServ-related [RFC2475] functions including packet scheduling (queuing), dropping, and metering that must be modular and concisely described. Traffic-conditioning rules and metering rules for DiffServ-related functions are defined modularly by using "virtual flow labels" and exclusive conditions in rules, and new classifications for packet-scheduling and packet-dropping functions are introduced. This document focuses on satisfying the requirements on programming interfaces or programming languages for router control. Thus, the focus is different from that of DiffServ MIB [DSMIB] or QoS PIB [QoSPIB].

Introduction to this research theme: Policy-based Networking

Kanada, Y., 18th International Conference on Information and Knowledge Management (CIKM'99), pp. 46-54, November 1999

[ 日本語のページ ]
[ Paper PDF file (ACM DL)] [ Paper PDF file ]

Abstract: A text retrieval method called the thematic geographical search method has been developed and applied to a Japanese encyclopedia called the World Encyclopedia. In this method, the user specifies a search theme using free words, then obtains a sorted list of excerpts and references to encyclopedia sentences that contain geographical names. Using this list, the user can open maps that indicate the location of the names. To generate an index of names for this searching, a method of geographical name extraction has been developed. In this method, geographical names are extracted, matched to names in a geographical name database, and identified. Geographical names, however, often have several types of ambiguities. Ambiguities are resolved using context analysis and several other techniques. As a result, the precision of extracted names is more than 96% on average. This method depends on features of the Japanese language, but the strategy and most of the techniques can be applied to texts in English or other languages.

Introduction to this research theme: Axis-Specified Search (Thematic Search)

Kanada, Y., International Symposium on Digital Library 1999, pp. 135-142, 1999

[ 日本語のページ ]
[ Paper PDF file ] [ Paper PostScript file ]

Abstract: A method of extracting year references for a textual information retrieval method called the thematic chronological-table search method is explained in this paper. This search method generates an index by extracting and collecting year references from a text collection. The resulting index and a full-text index are used for searching statements that contain year references and search words. The results are displayed in the form of a chronological table with hyperlinks to the original text. Seven forms of year or century references are extracted and normalized using string matching patterns. The extraction error rate is reduced by using both local and nonlocal contexts. If the lower two digits of a Gregorian year, which matches a form, occurs, it is normalized by supplementing the upper digits using the non-local context. This method has been applied to a Japanese encyclopedia. An evaluation shows the precision of extraction to be higher than 99% in most cases.

Introduction to this research theme: Axis-Specified Search (Thematic Search)

Kanada, Y., Yamazaki, M., Sawada, M., Hirano, Y., and Fujii, Y., 59th National Conference，3P-9, 1999, Information Processing Society of Japan (published by IPSJ)

[ 日本語のページ ]
[ Paper PDF file (in Japanese) ]

Abstract: In the member's only network called "Net-de-hyakka", a service called the thematic mapping search, in which results of encyclopedia text search is ordered along a geographical axis, is offered. In this search, the statements are searched and sorted by geographical names that occur in the text. A map of one of the geographical names can also be opened. The function and implementation method of this search are summarized here.

Introduction to this research theme: Axis-Specified Search (Thematic Search)

Kanada, Y., IPSJ SIGNL Technical Report, 99-NL-132-2, 1999, Published by IPSJ (in Japanese).

[ 日本語のページ ]
[ Paper PDF file (in Japanese) ] [ Paper PostScript file (in Japanese) ]

Abstract: A text retrieval method called the thematic mapping search method has been developed for Japanese texts. In this method, the user specifies a search theme using free words, then obtains a sorted list of excerpts and hyperlinks to sentences that contain geographical names. Using this list, the user can open maps that indicate the location of the names. To generate an index of names for this searching, a method of geographical name extraction has been developed. In this method, geographical names are extracted, matched to names in a geographical name database, and identified. Geographical names, however, often have several types of ambiguities. Ambiguities are resolved using context analysis and several other techniques. As a result, the precision of extracted names is more than 96% on average when applied to the World Encyclopedia. The rules for information extraction depends on features of the Japanese language, but the strategy and most of the techniques can be applied to texts in English or other languages.

Introduction to this research theme: Axis-Specified Search (Thematic Search)

Kanada, Y., IPSJ SIGFI Technical Report, 99-FI-?, 1999, Published by IPSJ (in Japanese).

[ 日本語のページ ]
[ Paper PDF file (in Japanese) ] [ Paper PostScript file (in Japanese) ]

Abstract: A method of textual information retrieval, which is called the thematic chronological-table search method, has been developed. In this method, an index is generated by extracting and collecting year references from a text collection, the index and a statement-by-statement full-text index are used for searching for year references and search words when the user inputs the words, and the result items are sorted by year and displayed. The result item contains a year reference, a sentence that contains the year, and a hyperlink to the original text. In this paper, the method of information extraction in the thematic chronological-table searching is explained. This method has been applied to a Japanese encyclopedia. An evaluation shows the precision of extraction is higher than 99% in most cases. An efficient and less error-prone data representation for year expression that may contain several units such as century, year, month, day, and so on, are also explained.

Introduction to this research theme: Axis-Specified Search (Thematic Search)

Kanada, Y., Hirano, Y., Sawada, M., Yamazaki, M., and Fujii, Y., 58th National Conference of the Information Processing Society of Japan, 1J-3, 1999, Published by IPSJ (in Japanese).

[ 日本語のページ ]
[ Paper PDF file (in Japanese) ] [ Paper PostScript file (in Japanese) ]

No abstract available.

Introduction to this research theme: Axis-Specified Search (Thematic Search)

Kanada, Y., IPSJ SIGFI Technical Report 98-FI-50-4, pp. 25-32, 1998, Published by IPSJ (in Japanese).

[ 日本語のページ ]
[ Paper PDF file (in Japanese) ] [ Paper PostScript file (in Japanese) ]

Abstract: A full-text search method, which is called an axis-specified search method, is proposed. Excerpts are extracted from documents and ordered by using this method. The user selects an axis, such as year, area or quantity, from a menu, in addition to typing strings to be searched. Then, excerpts related to the axis and strings, and hyperlinks to the original sentences are ordered along the axis and displayed. Even if the number of results is very large, the user can easily survey them, because they are well structured. This method has been applied to an encyclopedia and a newspaper articles. In these applications, distributed descriptions that were related to each other could be gathered, and the user could discover their relationships from the results. For example, by specifying "basin" for a search string and "area" (m²) for an axis, descriptions of the world's largest rivers were extracted from the encyclopedia and sorted according to their basin areas.

Introduction to this research theme: Axis-Specified Search (Thematic Search)

Kanada, Y., 3rd ACM Conference on Digital Libraries, pp. 108-117, 1998, (C) Copyright 1998 by ACM.

[ 日本語のページ ]
[ Paper PDF file (ACM DL)] [ Paper PDF file ] [ Paper PostScript file ]

Abstract: A text search method, which is called an axis-specified search method, is proposed. This method is suitable for full-text searches of a large-scale text collection. In this method, in addition to specifying search strings, the user selects an axis from a predefined set. The system outputs excerpts and hyper-links that are ordered along the axis. The search strings express the specific subject of the search, and the axis specifies a general-purpose method of ordering results. Short sub-topics, which cannot be easily caught by statistical methods, are effectively gathered from the text collection. The user can get satisfactory results using a simple search string. Even if the number of results is very large, the user can easily survey them, because they are well structured. This method has been applied to an electronic encyclopedia and a newspaper database. In these applications, distributed descriptions that were related to each other could be gathered, and the user could discover their relationships from the results. For example, by specifying "semiconductor" for a search string and "year" for an axis, a table listing seven decades of semiconductor-related topics sorted by year was generated from newspaper issues published over a single year. By specifying "basin" for a search string and "area" (m²) for an axis, descriptions of the world's largest rivers were extracted from the encyclopedia and sorted according to their basin areas.

Introduction to this research theme: Axis-Specified Search (Thematic Search)