服务定制网络体系架构的设计与思考

doi:10.11959/j.issn.1000-436x.2024017

Abstract

Abstract:

A new network architecture of SCN (service customized networking) was systematically expounded, which provided a novel network underlying capability and usage method for Internet applications.TCP/IP network architecture served the application with “best effort” quality of service, while SCN converted the subject-object relationship between the application and network that allowed the application to “on-demand customize” the QoS of networks.From the perspective of applications, three major connotations “declarable”, “fine-grained” and “end-to-end” were excavated to deduce the overall design of SCN, where a concrete SCN architecture and a feasible SCN system realization were present.In future, SCN can be applied in scenarios of man-machine-things, such as remote industrial control, and augment reality, to provide a novel and ideal means for NaaS (network as a service).

Key words: future network architecture, service customized networking, NaaS, deterministic network

CLC Number:

TP393

Tao HUANG, Chen ZHANG, Yuming XIAO, Shui YU, Yunjie LIU. Design and research of service customized networking architecture[J]. Journal on Communications, 2024, 45(2): 1-17.

Figures/Tables 14

业务场景		API调用方式
远程控制	运动控制	PLC：Qos_Claim(<Mc_Master, Mc_Slave>, <恒稳速率、恒稳时延、不可丢包、严格保序>, <建路容忍，建链容忍>)
		运动部件：Qos_Claim(<Mc_Slave, Mc_Master>, <恒稳速率、时延上限、不可丢包、严格保序>, <建路容忍，建链容忍>)
	人工维修	操作台：Qos_Claim(<Hm_master, Hm_Slave>, <恒稳速率、恒稳时延、不可丢包、严格保序>, <建路容忍，建链容忍>)
		机械臂：Qos_Claim(<Hm_Slave, Hm_master>, <速率下限、时延上限、丢包上限、局部有序>, <建路容忍，建链容忍>)
算力网络	分布式训练	worker：Qos_Claim(<worker, PS_Slave>, <平均速率、平均时延、不可丢包、严格保序>, <建路容忍，建链容忍>)
		主PS：Qos_Claim(<PS_Master, PS_Slave>, <平均速率、平均时延、不可丢包、严格保序>, <建路容忍，建链容忍>)
		从PS：Qos_Claim(<PS_Slave, Worker>, <平均速率、平均时延、不可丢包、严格保序>, <建路容忍，建链容忍>)
		Qos_Claim(<PS_Slave, PS_Master>, <平均速率、平均时延、不可丢包、严格保序>, <建路容忍，建链容忍>)
	实时性推理	边缘推理：Qos_Claim(<Infer_Coarse, Infer_Precise>, <速率下限、时延上限、逾期丢包、局部有序>, <建路不容忍，建链容忍>)
		核心推理：Qos_Claim(<Infer_Precise, Infer_Coarse>, <速率下限、时延上限、不可丢包、严格保序>, <建路不容忍，建链容忍>)
增强现实	AR直播	主播程序：Qos_Claim(<Person_A, Person_B>, <速率下限、时延上限、丢包上限、局部有序>, <建路不容忍，建链不容忍>)
		观众程序：Qos_Claim(<Person_B, Person_A>, <速率下限、时延上限、不可丢包、严格有序>, <建路容忍，建链容忍>)
	情境识别	捕捉程序：Qos_Claim(<Person_A, Context_Cognition>, <速率下限、时延上限、逾期丢包、紧急插序>, <建路不容忍，建链不容忍>)
		识别程序：Qos_Claim(<Context_Cognition, Person_A>, <速率下限、时延上限、逾期丢包、局部有序>, <建路不容忍，建链不容忍>)

References 44

[1]	CERF V , KAHN R . A protocol for packet network intercommunication[J]. IEEE Transactions on Communications, 1974,22(5): 637-648.
[2]	POSTEL J B . RFC 791:Internet protocol[S]. 1981.
[3]	FLOYD S . RFC 793 transmission control protocol[S]. 2001.
[4]	FOROUZAN B A . TCP/IP protocol suite[M]. New York: McGraw-Hill Higher Education, 2002.
[5]	CLARK D D . Designing an internet[M]. Massachusetts: MIT Press, 2018.
[6]	WU D P , HOU Y T , ZHU W W ,et al. Streaming video over the Internet:approaches and directions[J]. IEEE Transactions on Circuits and Systems for Video Technology, 2001,11(3): 282-300.
[7]	HANDLEY M , SCHULZRINNE H , SCHOOLER E ,et al. RFC2543:SIP:session initiation protocol[J]. Encyclopedia of Internet Technologies ＆ Applications, 2015,58(2): 1869-1877.
[8]	ZHANG L , BERSON S , HERZOG S ,et al. RFC 2205:resource res-ervation protocol (RSVP)——version 1 functional specification[S]. 1997.
[9]	ROSEN E , VISWANATHAN A , CALLON R . RFC 3031:multiprotocol label switching architecture[S]. 2001.
[10]	AWDUCHE D , MALCOLM J , AGOGBUA J ,et al. RFC 2702:requirements for traffic engineering over MPLS[S]. 1999.
[11]	AWDUCHE D , BERGER L , GAN D ,et al. RFC 3209:RSVP-TE:extensions to RSVP for LSP tunnels[S]. 2001.
[12]	ANDERSSON L , CALLON R , DANTU R ,et al. RFC 3212:constraint-based LSP setup using LDP[S]. 2002.
[13]	KATZ D , KOMPELLA K , YEUNG D . RFC 3630:Traffic engineering (TE) extensions to OSPF version 2[S]. 2003.
[14]	LE ROUX J L , VASSEUR J P , BOYLE J . RFC 4105:requirements for inter-area MPLS traffic engineering[S]. 2005.
[15]	AYYANGAR A , VASSEUR J P . RFC 5151:inter-domain MPLS and GMPLS traffic engineering--resource reservation protocol-traffic engineering (RSVP-TE) extensions[S]. 2008.
[16]	GINSBERG L , DECRAENE B , LITKOWSKI S ,et al. RFC 8402:Segment routing architecture[S]. 2018.
[17]	PETER O , PRADHAN A , MBOHWA C . Industrial Internet of things (IIoT):opportunities,challenges,and requirements in manufacturing businesses in emerging economies[J]. Procedia Computer Science, 2023,217: 856-865.
[18]	GUO H , WANG F , ZHANG L J ,et al. A hierarchical optimization strategy of the energy router-based energy Internet[J]. IEEE Transactions on Power Systems, 2019,34(6): 4177-4185.
[19]	CHENG R Z , WU N , VARVELLO M ,et al. Are we ready for metaverse? a measurement study of social virtual reality platforms[C]// Proceedings of the 22nd ACM Internet Measurement Conference. New York:ACM Press, 2022: 504-518.
[20]	VALASKOVA K , VOCHOZKA M , L?Z?ROIU G . Immersive 3D technologies,spatial computing and visual perception algorithms,and event modeling and forecasting tools on blockchain-based metaverse platforms[J]. Analysis and Metaphysics, 2022,21: 74-90.
[21]	刘韵洁, 黄韬, 张娇 ,等. 服务定制网络[J]. 通信学报, 2014,35(12): 1-9.
	LIU Y J , HUANG T , ZHANG J ,et al. Service customized networking[J]. Journal on Communications, 2014,35(12): 1-9.
[22]	KALITA L . Socket programming[J]. International Journal of Computer Science and Information Technologies, 2014,5(3): 4802-4807.
[23]	BAGNULO M , MATTHEWS P , BEIJNUM I V . Stateful NAT64:network address and protocol translation from IPv6 clients to IPv4 servers[S]. 2011.
[24]	DERI L , FUSCO F . Using deep packet inspection in cybertraffic analysis[C]// Proceedings of the 2021 IEEE International Conference on Cyber Security and Resilience (CSR). Piscataway:IEEE Press, 2021: 89-94.
[25]	LACHOS D , XIANG Q , ROTHENBERG C ,et al. Towards deep network ＆ application integration:possibilities,challenges,and research directions[C]// Proceedings of the Workshop on Network Application Integration/CoDesign. New York:ACM Press, 2020: 1-7.
[26]	LEDDY J , VOYER D , MATSUSHIMA S ,et al. RFC 8986:segment routing over IPv6 (SRv6) network programming[S]. 2021.
[27]	FANG K , LI Y , CAI F . Segment routing over UDP[S]. 2020.
[28]	WANG S , GAO K H , QIAN K ,et al. Predictable vFabric on informative data plane[C]// Proceedings of the ACM SIGCOMM 2022 Conference. New York:ACM Press, 2022: 615-632.
[29]	MIYASAKA T , HEI Y , KITAHARA T . NetworkAPI:an in-band signalling application-aware traffic engineering using SRv6 and IP anycast[C]// Proceedings of the Workshop on Network Application Integration/CoDesign. New York:ACM Press, 2020: 8-13.
[30]	NICHOLS K , BLAKE S , BAKER F ,et al. RFC 2474:definition of the differentiated services field (DS field) in the IPv4 and IPv6 headers[S]. 1998.
[31]	AMANTE S , CARPENTER B , JIANG S ,et al. RFC 6437:IPv6 flow label specification[S]. 2011.
[32]	BELSHE M , PEON R , THOMSON M . RFC 7540:hypertext transfer protocol version 2 (HTTP/2)[S]. 2015.
[33]	KUMAR S , TIWARI R , OBAIDAT M S ,et al. CPNDD:content placement approach in content centric networking[C]// Proceedings of the 2020 IEEE International Conference on Communications (ICC). Piscataway:IEEE Press, 2020: 1-6.
[34]	KIESEL S , PREVIDI S , ROOME W ,et al. RFC 7285:application-layer traffic optimization (ALTO) protocol[S]. 2014.
[35]	IYENGAR J , THOMSON M . RFC 9000:QUIC:a UDP-based multiplexed and secure transport[S]. 2021.
[36]	LEONARDI L , BELLO L L , PATTI G.Performance assessment of the IEEE 802 . 1Qch in an automotive scenario[C]// Proceedings of the 2020 AEIT International Conference of Electrical and Electronic Technologies for Automotive (AEIT AUTOMOTIVE). Piscataway:IEEE Press, 2020: 1-6.
[37]	WANG S , WU B W , ZHANG C ,et al. Large-scale deterministic IP networks on CENI[C]// Proceedings of the 2021 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS). Piscataway:IEEE Press, 2021: 1-6.
[38]	PAULY T , TRAMMELL B , BRUNSTROM A ,et al. An architecture for transport services[S]. 2018.
[39]	PENG S P , MAO J W , HU R Z ,et al. Demo abstract:APN6:application-aware IPv6 networking[C]// Proceedings of the 2020 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS). Piscataway:IEEE Press, 2020: 1330-1331.
[40]	HEINANEN J , GUERIN R . RFC 2697:a single rate three color marker[S]. 1999.
[41]	HEINANEN J , GUéRIN R . RFC 2698:a two rate three color marker[S]. 1999.
[42]	HAUSER F , H?BERLE M , MERLING D ,et al. A survey on data plane programming with P4:fundamentals,advances,and applied research[J]. Journal of Network and Computer Applications, 2023,212:103561.
[43]	CRACIUNAS S S , OLIVER R S , CHMELíK M , et al.Scheduling real-time communication in IEEE 802 . 1Qbv time sensitive networks[C]// Proceedings of the 24th International Conference on Real-Time Networks and Systems. New York:ACM Press, 2016: 183-192.
[44]	GOSWAMI B , KULKARNI M , PAULOSE J . A survey on P4 challenges in software defined networks:P4 programming[J]. IEEE Access, 2023,11: 54373-54387.

Metrics

Recommended 0

No Suggested Reading articles found!

能力需求	现有相关技术	不足
表达服务质量需求	API	应用无法提供入口与出口中继设备的地址信息
（可声明）	NetworkAPI	只适用于单域场景
	RSVP	只能在不影响选路的前提下预约带宽，且无法定制时延等指标
	DSCP	无法量化表达带宽、时延等需求
	TAPS	无法表达带宽、时延需求
业务流级需求声明	Flow Label	被用于中继设备上的随机负载均衡，与QoS相悖
（细粒度）	Stream ID	通常以加密形式存在，无法被网络感知
	APN6	一定程度解决“可声明”与“细粒度”问题，但其设计初衷是避免协议交互，因此在流量准入方面存在缺陷
	CCN	业务状态在全网扩散使网络扩展性受限，并且未系统性解决QoS问题
跨域服务质量保障	ALTO	作为一种辅助技术向应用提供端到端网络地图，但并不关注网络服务质量保障
（端到端）	QUIC	其设计仍以底层QoS随机波动为前提，同时未考虑其可靠与顺序处理在端到端中所引入的速率限制与额外时延
	QUIC-SR	一定程度解决“细粒度”与“端到端”问题，但其要求应用掌握网络全部控制权，因此只能采用叠加式组网，导致无法获得底层网络的QoS保障
	确定性网络技术，如IEEE802.1Qch、DIP等	当前确定性技术只能作用于有限域（局域或广域），无法实现端到端跨域的时延、抖动保证

变量	含义
Tkt_A / Tkt_B	主机在子网中的逐程票
Tkt_GwA / Tkt_GwB	主机通过子网到达锚定网关的逐程票
Ticket_ID	联程票标识
Subnet_Ticket_ID	子网内部票标识
Tkt_AB / Tkt_BA	为主机协议栈之间通信所分配的联程票
Src_ID	源端应用标识
Dst_ID	宿端应用标识
ID_A / ID_B	应用A / B的标识
Loc_GwA / Loc_GwB	网关A / B的定位符
Fl_AB	本地流标识
Association_ID	关联标识
Asc_Random	在所需关联激活前随机生成的关联
Asc_A / Asc_B	为特定可靠/顺序性指标生成的关联

Design and research of service customized networking architecture

RichHTML

PDF

Knowledge

Abstract

Cite this article

share this article

Figures/Tables 14

References 44

Related Articles 12

Metrics

Recommended 0

[1]	Sijin YANG, Lei ZHUANG, Yu SONG, Jiaxing WANG, Xinyu YANG. Intelligent scheduling mechanism of time-sensitive network modal in polymorphic network [J]. Journal on Communications, 2022, 43(5): 82-91.
[2]	Qingmin JIA, Yujiao HU, Huayu ZHANG, Kailai PENG, Pingping CHEN, Renchao XIE, Tao HUANG. Research on deterministic computing power network [J]. Journal on Communications, 2022, 43(10): 55-64.
[3]	Peng WANG, Xiushe ZHANG, Long SUO, Keyi SHI. Time deterministic network routing algorithm based on stochastic temporal graph [J]. Journal on Communications, 2021, 42(9): 21-30.
[4]	Shuopeng LI, Juan FANG, Ken CHEN. DetNet service share protection scheme based on SRv6 [J]. Journal on Communications, 2021, 42(10): 32-42.
[5]	Jianzhong SU, Huayu ZHANG, Hailong ZHU. Computing method for periodic stream reservation in TSN combined with SDN controller [J]. Journal on Communications, 2021, 42(10): 23-31.
[6]	Tao HUANG, Jiang LIU, Shuo WANG, Chen ZHANG, Yunjie LIU. Survey of the future network technology and trend [J]. Journal on Communications, 2021, 42(1): 130-150.
[7]	HUANG Tao,WANG Shuo,HUANG Yudong,ZHENG Yao,LIU Jiang,LIU Yunjie. Survey of the deterministic network [J]. Journal on Communications, 2019, 40(6): 160-176.
[8]	Bo-hao FENG,Hua-chun ZHOU,Hong-ke ZHANG,Ming-chuan ZHANG. Cache allocation policy of service contents along delivery paths for the smart collaborative network [J]. Journal on Communications, 2016, 37(3): 129-138.
[9]	. Survey of research on future network architectures [J]. Journal on Communications, 2014, 35(8): 23-197.
[10]	Tao HUANG,Jiang LIU,Ru HUO,Liang WEI,Yun-jie LIU. Survey of research on future network architectures [J]. Journal on Communications, 2014, 35(8): 184-197.
[11]	Qing-hua LI,Zhi-gang CHEN,Lian-ming ZHANG,Feng ZENG,Xiang LI. Deterministic upper bounds on QoS performance about wireless ad hoc network based on network calculus [J]. Journal on Communications, 2008, 29(9): 32-39.
[12]	Lian-ming ZHANG,Zhi-gang CHEN,Ming ZHAO,Lei WANG. Deterministic upper bounds on performance of generalized processor sharing based on fractal regulators [J]. Journal on Communications, 2007, 28(2): 51-56.