Research on Network Service Architecture and Its Formal Model

Yang Peng and Wu Jiagao

Journal of Computer Research and Development > 2005 > 42(7): 1115-1122.

Yang Peng and Wu Jiagao. Research on Network Service Architecture and Its Formal Model[J]. Journal of Computer Research and Development, 2005, 42(7): 1115-1122.

Citation:

Yang Peng and Wu Jiagao. Research on Network Service Architecture and Its Formal Model[J]. Journal of Computer Research and Development, 2005, 42(7): 1115-1122.

Citation:

Yang Peng and Wu Jiagao. Research on Network Service Architecture and Its Formal Model[J]. Journal of Computer Research and Development, 2005, 42(7): 1115-1122.

PDF (370 KB)

Research on Network Service Architecture and Its Formal Model

Yang Peng and Wu Jiagao

(Department of Computer Science and Engineering, Southeast University, Nanjing 210096) (Key Laboratory of Computer Network and Information Integration, Ministry of Education, Southeast University, Nanjing 210096)

More Information

Published Date: July 14, 2005

Graphical Abstract

Abstract

Abstract

The essence of next generation network is that it is an information infrastructure which not only aims to support various information services, but also can sustain the complete informatization of politics, economy, culture, education and national defense of every country. The traditional network architecture layered only by the basic communication functions can no longer fit the requirements of next generation network. An interaction based network service architecture (INSA) is proposed in this paper, which can act as a reference model for next generation network service architecture. The whole structure and the functions of each layer of INSA are described in detail. An abstract formal model of next generation network service architecture is also proposed, which provides a new approach to describing, analyzing and verifying the service related characters of the next generation network service architecture.
- next generation network,
- information infrastructure,
- network service architecture,
- interaction,
- formal model

FullText(HTML)

References (0)

[1]	Li Chen, Chen Yidong, Lu Zhonghua, Yang Xueying, Wang Zitian, Chi Xuebin. A Parallel Multi-Objective Dividing Rectangles Algorithm Based on Normalized Decomposition[J]. Journal of Computer Research and Development, 2024, 61(11): 2909-2922. DOI: 10.7544/issn1000-1239.202330093
[2]	Liu Quan, Fu Qiming, Yang Xudong, Jing Ling, Li Jin, Li Jiao. A Scalable Parallel Reinforcement Learning Method Based on Intelligent Scheduling[J]. Journal of Computer Research and Development, 2013, 50(4): 843-851.
[3]	Zhou Hanxun, Zhao Hong, Wen Yingyou. Modeling and Analysis of Divide-and-Rule-Hybrid-Benign Worms[J]. Journal of Computer Research and Development, 2009, 46(7): 1110-1116.
[4]	Li Jianfu, Guo Maozu, and Liu Yang. An Evolutionary Tree Reconstruction Method Combining Quartet Puzzling and Neighbor Joining[J]. Journal of Computer Research and Development, 2008, 45(11): 1965-1973.
[5]	Li Kenli, Liu Jie, Yang Lei, Liu Wenbin. An O(1.414\+n) Volume Molecular Solutions for the Exact Cover Problem on DNA-Based Supercomputing[J]. Journal of Computer Research and Development, 2008, 45(10): 1782-1788.
[6]	Wang Li, Zhang Suwei, Li Zhansheng, Song Linjian. A Multi-Path Routing Protocol Based on Divide and Conquer Strategy in Ad Hoc Network[J]. Journal of Computer Research and Development, 2008, 45(1).
[7]	Lin Jiao, Wang Shanying, Wang Chongyu. A Study of Parallel DVM-DAC Algorithm in Multiscale Physics[J]. Journal of Computer Research and Development, 2007, 44(10): 1667-1672.
[8]	Li Kenli, Yao Fengjuan, Li Renfa, Xu Jin. Improved Molecular Solutions for the Knapsack Problem on DNA-Based Supercomputing[J]. Journal of Computer Research and Development, 2007, 44(6): 1063-1070.
[9]	He Lijian and Zhang Wei. An Agent Organization Structure for Solving DCOP Based on the Partitions of Constraint Graph[J]. Journal of Computer Research and Development, 2007, 44(3).
[10]	Hou Yuexian, Ding Zheng, and He Pilian. Self-Organizing Isometric Embedding[J]. Journal of Computer Research and Development, 2005, 42(2): 188-195.