Independent Submission K-M. Moller
Request for Comments: 5984 1 April 2011
Category: Experimental
ISSN: 2070-1721
Independent Submission K-M. Moller
Request for Comments: 5984 1 April 2011
Category: Experimental
ISSN: 2070-1721
Increasing Throughput in IP Networks with ESP-Based Forwarding: ESPBasedForwarding
使用基于ESP的转发提高IP网络吞吐量：ESPBasedForwarding
Abstract
摘要
This document proposes an experimental way of reaching infinite bandwidth in IP networks by the use of ESP-based forwarding.
本文提出了一种通过使用基于ESP的转发在IP网络中实现无限带宽的实验方法。
Status of This Memo
关于下段备忘
This document is not an Internet Standards Track specification; it is published for examination, experimental implementation, and evaluation.
本文件不是互联网标准跟踪规范；它是为检查、实验实施和评估而发布的。
This document defines an Experimental Protocol for the Internet community. This is a contribution to the RFC Series, independently of any other RFC stream. The RFC Editor has chosen to publish this document at its discretion and makes no statement about its value for implementation or deployment. Documents approved for publication by the RFC Editor are not a candidate for any level of Internet Standard; see Section 2 of RFC 5741.
本文档为互联网社区定义了一个实验协议。这是对RFC系列的贡献，独立于任何其他RFC流。RFC编辑器已选择自行发布此文档，并且未声明其对实现或部署的价值。RFC编辑批准发布的文件不适用于任何级别的互联网标准；见RFC 5741第2节。
Information about the current status of this document, any errata, and how to provide feedback on it may be obtained at http://www.rfc-editor.org/info/rfc5984.
有关本文件当前状态、任何勘误表以及如何提供反馈的信息，请访问http://www.rfc-editor.org/info/rfc5984.
Copyright Notice
版权公告
Copyright (c) 2011 IETF Trust and the persons identified as the document authors. All rights reserved.
版权所有（c）2011 IETF信托基金和确定为文件作者的人员。版权所有。
This document is subject to BCP 78 and the IETF Trust's Legal Provisions Relating to IETF Documents (http://trustee.ietf.org/license-info) in effect on the date of publication of this document. Please review these documents carefully, as they describe your rights and restrictions with respect to this document.
本文件受BCP 78和IETF信托有关IETF文件的法律规定的约束(http://trustee.ietf.org/license-info)自本文件出版之日起生效。请仔细阅读这些文件，因为它们描述了您对本文件的权利和限制。
Table of Contents
目录
1. Introduction . . . . . . . . . . . . . . . . . . . . . . . . . 2
1.1. Requirements Language . . . . . . . . . . . . . . . . . . . 2
2. Background . . . . . . . . . . . . . . . . . . . . . . . . . . 2
2.1. Experiments with Black Fiber . . . . . . . . . . . . . . . 3
2.2. Schrodinger's Cat Experiment . . . . . . . . . . . . . . . 3
3. ESP-Based Forwarding . . . . . . . . . . . . . . . . . . . . . 4
3.1. Principle of Operation . . . . . . . . . . . . . . . . . . 4
3.2. Architectural Components . . . . . . . . . . . . . . . . . 4
3.2.1. DPAUI . . . . . . . . . . . . . . . . . . . . . . . . . 5
3.2.2. PPG . . . . . . . . . . . . . . . . . . . . . . . . . . 5
3.2.3. IID . . . . . . . . . . . . . . . . . . . . . . . . . . 5
3.2.4. CFE . . . . . . . . . . . . . . . . . . . . . . . . . . 6
3.2.5. PPS . . . . . . . . . . . . . . . . . . . . . . . . . . 6
3.2.6. ND . . . . . . . . . . . . . . . . . . . . . . . . . . 6
4. End User Considerations . . . . . . . . . . . . . . . . . . . . 7
5. TCP Slow-Start Considerations . . . . . . . . . . . . . . . . . 7
6. Market Considerations . . . . . . . . . . . . . . . . . . . . . 7
7. Security Considerations . . . . . . . . . . . . . . . . . . . . 7
8. References . . . . . . . . . . . . . . . . . . . . . . . . . . 8
8.1. Normative References . . . . . . . . . . . . . . . . . . . 8
8.2. Informative References . . . . . . . . . . . . . . . . . . 8
1. Introduction . . . . . . . . . . . . . . . . . . . . . . . . . 2
1.1. Requirements Language . . . . . . . . . . . . . . . . . . . 2
2. Background . . . . . . . . . . . . . . . . . . . . . . . . . . 2
2.1. Experiments with Black Fiber . . . . . . . . . . . . . . . 3
2.2. Schrodinger's Cat Experiment . . . . . . . . . . . . . . . 3
3. ESP-Based Forwarding . . . . . . . . . . . . . . . . . . . . . 4
3.1. Principle of Operation . . . . . . . . . . . . . . . . . . 4
3.2. Architectural Components . . . . . . . . . . . . . . . . . 4
3.2.1. DPAUI . . . . . . . . . . . . . . . . . . . . . . . . . 5
3.2.2. PPG . . . . . . . . . . . . . . . . . . . . . . . . . . 5
3.2.3. IID . . . . . . . . . . . . . . . . . . . . . . . . . . 5
3.2.4. CFE . . . . . . . . . . . . . . . . . . . . . . . . . . 6
3.2.5. PPS . . . . . . . . . . . . . . . . . . . . . . . . . . 6
3.2.6. ND . . . . . . . . . . . . . . . . . . . . . . . . . . 6
4. End User Considerations . . . . . . . . . . . . . . . . . . . . 7
5. TCP Slow-Start Considerations . . . . . . . . . . . . . . . . . 7
6. Market Considerations . . . . . . . . . . . . . . . . . . . . . 7
7. Security Considerations . . . . . . . . . . . . . . . . . . . . 7
8. References . . . . . . . . . . . . . . . . . . . . . . . . . . 8
8.1. Normative References . . . . . . . . . . . . . . . . . . . 8
8.2. Informative References . . . . . . . . . . . . . . . . . . 8
Mechanisms for efficient packet forwarding has evolved over the past years. The demand for bandwidth is always increasing. Instead of optimizing forwarding performance and link capacity in an incremental fashion, we propose a brand new concept in packet forwarding that will provide unsurpassed end user performance regardless of link capacity, distance, and number of hops.
在过去的几年中，高效数据包转发机制不断发展。对带宽的需求一直在增加。我们没有以增量方式优化转发性能和链路容量，而是提出了一种全新的分组转发概念，无论链路容量、距离和跳数如何，都能提供无与伦比的最终用户性能。
The key words "MUST", "MUST NOT", "REQUIRED", "SHALL", "SHALL NOT", "SHOULD", "SHOULD NOT", "RECOMMENDED", "MAY", and "OPTIONAL" in this document are to be interpreted as described in RFC 2119 [RFC2119].
本文件中的关键词“必须”、“不得”、“要求”、“应”、“不应”、“应”、“不应”、“建议”、“可”和“可选”应按照RFC 2119[RFC2119]中所述进行解释。
During the past years, there have been a lot of improvements made in the domain of packet forwarding. Both software and hardware optimizations combined with increased link capacities have cut down round-trip times. Despite these improvements, many users find themselves frustrated since their demand for bandwidth has increased faster than the supply.
在过去的几年中，在包转发领域有了很多改进。软件和硬件优化以及链路容量的增加都减少了往返时间。尽管有这些改进，但许多用户发现自己感到沮丧，因为他们对带宽的需求增长速度快于供应。
The current incremental approach to lower latency and increase capacity will soon reach the end of the road. The reason for this has been known for some time and is stated in RFC 1925 [RFC1925] clause 2:
目前用于降低延迟和增加容量的增量方法很快将走到尽头。原因已经知道一段时间了，并在RFC 1925[RFC1925]第2条中说明：
"(2) No matter how hard you push and no matter what the priority, you can't increase the speed of light."
（2）无论你推得多么用力，无论你的优先级如何，你都不能提高光速
Our research has finally been able to circumvent this boundary by the development of zero-latency network paths.
我们的研究最终能够通过开发零延迟网络路径绕过这一界限。
Inspired by RFC 1072 [RFC1072], where a network containing a long, fat pipe is called LFN (pronounced "elephan(t)"), we will refer to an internet path with zero-latency as "infinitely fat", and a network containing this path as "IFN" (pronounced "infan(t)").
受RFC 1072[RFC1072]的启发，其中包含长而胖的管道的网络称为LFN（发音为“elephan（t）”），我们将零延迟的internet路径称为“无限胖”，包含此路径的网络称为“IFN”（发音为“infan（t）”）。
Before the invention of this new forwarding principle, several experimental methods were tried. We have chosen to share our failed attempts in order help others avoid the same mistakes that we encountered. The following two methods have been dismissed:
在发明这种新的转发原理之前，人们尝试了几种实验方法。我们选择分享我们失败的尝试，以帮助他人避免我们遇到的同样错误。以下两种方法已被取消：
o Black Fiber o Schrodinger's cat experiment
o 黑纤维o薛定谔猫实验
Attempting to push the speed-of-light limitation by means of using black fiber looked promising at first. Shortly after initiating the experiment, lack of light was detected in the black fiber. This was interpreted as proof of successful data transmission faster than the speed of light. After popping the champagne, the following problems were detected:
起初，试图通过使用黑色光纤来提高光速限制似乎很有希望。实验开始后不久，在黑色光纤中检测到光线不足。这被解释为比光速更快的数据传输成功的证据。开香槟后，检测到以下问题：
1. No data reached the receiver. 2. The fiber was not connected at the transmitting side.
1. 没有数据到达接收器。2.光纤未在传输侧连接。
This clearly spoiled the mood of the party.
这显然破坏了聚会的气氛。
The Schrodinger's netcat experiment was based on an attempt to implement the method described by E. Schrodinger [Schrodinger35]. The original procedure includes locking up cats in boxes with radioactive materials and poisonous gas. Data communication capabilities were added to the experiment, by using netcat. The research team was dumbfounded by the notion that the cat experiment seemed to work and not work at the same time. This was also confirmed by a friend of Wigner's [Wigner].
薛定谔的netcat实验是基于试图实现E.Schrodinger[Schrodinger35]描述的方法。最初的程序包括把猫关在装有放射性物质和有毒气体的盒子里。通过使用netcat，实验中增加了数据通信能力。研究小组被猫的实验似乎同时起作用和不起作用的想法吓呆了。维格纳的一位朋友也证实了这一点。
A detailed analysis of the experiment indicated that the probability vectors collapsed whenever traffic was sent to the box. The conclusion was that this approach would only work without traffic, thus eliminating all practical applications.
对实验的详细分析表明，每当流量被发送到盒子时，概率向量就会崩溃。得出的结论是，这种方法只能在没有流量的情况下工作，从而消除了所有实际应用。
Experiments with ESP-based (Extra Sensory Perception) forwarding has proved to successfully remove the limitation in RFC 1925 [RFC1925].
基于ESP（超感官感知）转发的实验已经证明成功地消除了RFC1925[RFC1925]中的限制。
The foundation for the ESP-based forwarding scheme is to reduce latency by means of precognitive datagram detection and generation. By applying this technology, latency will not only reach zero, but might even become negative.
基于ESP的转发方案的基础是通过预知数据报检测和生成来减少等待时间。通过应用这项技术，延迟不仅会达到零，甚至可能变成负延迟。
Experiments performed by Benjamin Libet [Libet85] regarding the readiness potential (Bereitschaftspotential) concludes that the end user latency from impulse to the conscious mind is approximately 350 - 400 ms. In order to reach the highest possible data transport without confusing the end user, it is important to take this latency into consideration.
Benjamin Libet[Libet85]就准备就绪潜能（Bereitschafts潜能）进行的实验得出结论，最终用户从冲动到意识的延迟约为350-400毫秒。为了在不混淆最终用户的情况下达到最高可能的数据传输，重要的是要考虑到这种延迟。
Traffic between the end user and the server reaches the ESP-enabled router. Inside the ESP-based router, the data stream is first analyzed by the DPAUI (Deep Packet And User Inspection). The DPAUI sends a signal to the PPG (Deep Packet And User Inspection), which generates uplink IP datagrams supported by the IID (Infinite Improbability Drive). The generated IP datagram is sent to the CFE (Clairvoyant Forwarding Engine) that forwards the datagram. Finally, the "real" uplink, the end user datagram is received and forwarded to the ND (Null Device).
最终用户和服务器之间的通信量到达启用ESP的路由器。在基于ESP的路由器内，数据流首先由DPAUI（深度数据包和用户检查）进行分析。DPAUI向PPG（深度分组和用户检查）发送信号，PPG生成IID（无限不可能性驱动器）支持的上行链路IP数据报。生成的IP数据报被发送到转发数据报的CFE（透视转发引擎）。最后，在“真实”上行链路中，最终用户数据报被接收并转发到ND（空设备）。
The current ESP-based forwarding architecture includes the following components:
当前基于ESP的转发架构包括以下组件：
o DPAUI o PPG o IID o CFE o PPS o ND
o DPAUI o PPG o IID o CFE o PPS o ND
The DPAUI (Deep Packet And User Inspection) monitors the data streams for all individual users. The DPAUI is implemented by means of implementing a learning agent that analyzes each individual user. The output from the DPAUI is a signal that indicates that an IP datagram will be sent by the end user within a couple of seconds.
DPAUI（深度数据包和用户检查）监视所有单个用户的数据流。DPAUI是通过实现一个分析每个用户的学习代理来实现的。DPAUI的输出是一个信号，指示最终用户将在几秒钟内发送IP数据报。
The purpose of the PPG (Precognitive Packet Generator) is to generate the IP datagram that the end user will trigger to be sent. In order to craft such a datagram, the PPG will perform a lookup based on the offset and length parameters generated by the IID. The PPG will generate the future packet by means of the function:
PPG（预感知分组生成器）的目的是生成最终用户将触发发送的IP数据报。为了制作这样的数据报，PPG将根据IID生成的偏移量和长度参数执行查找。PPG将通过以下功能生成未来数据包：
struct mbuf * CopyDatagramFromPi( insane long offset, unsigned int len);
结构mbuf*CopyDatagramFromPi（疯狂长偏移量，无符号整数长度）；
The CopyDatagramFromPi() function will return a pointer to an mbuf containing the IP datagram. The offset value and len matches a corresponding offset and length in the decimal set for pi that contains the bit pattern for the future datagram. This method of operation will reduce the complex matter of precognitive packet generation to a simple lookup.
函数的作用是：返回一个指向包含IP数据报的mbuf的指针。偏移量值和len与包含未来数据报位模式的pi的十进制集合中的相应偏移量和长度相匹配。这种操作方法将预感知数据包生成的复杂问题简化为简单的查找。
Concerns have been raised that the full decimal set of pi requires an infinite amount of memory. This might have a negative effect on the manufacturing cost of the router. These concerns were successfully managed by using a perfectly circular buffer. This reduced the previous stated memory requirements at least by half.
有人担心，完整的十进制pi集需要无限大的内存。这可能会对路由器的制造成本产生负面影响。通过使用完美的循环缓冲区，成功地管理了这些问题。这至少将先前规定的内存需求减少了一半。
The purpose of the IID (Infinite Improbability Drive) is to assist the PPG and PPS with improbable probabilities (and the other way around). The IID was originally invented by Douglas Adams [Adams79]. The original implementation was based on hooking up the logic circuits of a Bambleweeny 57 sub-meson Brain to an atomic vector plotter suspended in a strong Brownian motion producer (i.e., a nice hot cup of tea).
IID（无限不可能驱动）的目的是帮助PPG和PPS获得不可能的概率（反之亦然）。IID最初由道格拉斯·亚当斯发明[Adams79]。最初的实现是基于将Bambleweeny 57亚介子大脑的逻辑电路连接到悬挂在强布朗运动发生器（即一杯热茶）中的原子矢量绘图仪。
The research team struggled with the implementation of the strong Brownian motion producer. As a matter of fact, the majority of the research budget was wasted before it was fully conceived that a warm cup of tea and router equipment rarely mix.
研究团队努力实现强布朗运动生成器。事实上，在充分考虑到一杯热茶和路由器设备很少混合之前，大部分研究预算都被浪费了。
Aided by the gastronomical department (working on Bistromathic Drive), the research team managed to attach a brownie on top of a radio controlled hovercraft full of eels. This not only caused a lot of noise and disarray, but also a sufficient amount of Brownian motion. The research team is still working on an entirely software-based solution. Hopefully, the eel-filled hovercraft will soon be replaced with a different type of python script.
在美食部门的帮助下（在双色差驱动上工作），研究小组设法在一艘装满鳗鱼的无线电控制气垫船上贴上了一块巧克力蛋糕。这不仅造成了大量的噪音和混乱，而且还造成了大量的布朗运动。研究团队仍在致力于一个完全基于软件的解决方案。希望填充鳗鱼的气垫船不久将被另一种类型的python脚本所取代。
After the IP datagram has been produced by the PPG, the CFE (Clairvoyant Forwarding Engine) will attempt to find the right route. Since the route might not exist yet, direct access to a routing table might result in routing errors.
PPG生成IP数据报后，CFE（透视转发引擎）将尝试找到正确的路由。由于路由可能还不存在，直接访问路由表可能会导致路由错误。
The implementation of the CFE is very straightforward: any off-the-shelf routing stack with a routing table and a routing daemon can be used. A standard Ouija board is simply put on top of the routing table. For each datagram, the CFE initiates an Ouija board session that will establish a connection with the routing deamons. The CFE will seek guidance for the future of the IP datagram and then send it along for a low cost, to meet a tall, dark server rack.
CFE的实现非常简单：可以使用任何带有路由表和路由守护进程的现成路由堆栈。标准的占卜板简单地放在路由表的顶部。对于每个数据报，CFE启动一个占卜板会话，该会话将与路由执事建立连接。CFE将为IP数据报的未来寻求指导，然后以低成本发送，以满足高而暗的服务器机架。
The PPS (Pre-Preemptive Scheduler) is synchronized by means of an NTP connection to the IID based NTP server. This ensures that the ESP process will execute ten seconds ahead of local time (layman's term: "into the future"). This value should ensure operation even with very long Round Trip Times and should also include the readiness potential of the end user.
PPS（预抢占式调度程序）通过NTP连接与基于IID的NTP服务器同步。这确保ESP进程将比当地时间提前10秒执行（外行术语：“进入未来”）。即使往返时间很长，该值也应确保运行，并且还应包括最终用户的准备就绪潜力。
The pre-preemptive scheduler not only provides a separate user space, but a separate dimension for the code to execute in. The dimension alignment is based on string theory and has been implemented in the language C, simply by including the library string.h and then using strcpy to copy the PPS function pointer into an eleven-dimensional array.
预抢占式调度程序不仅提供了一个单独的用户空间，而且为代码执行提供了一个单独的维度。维度对齐是基于弦论的，并已在C语言中实现，只需包含库字符串.h，然后使用strcpy将PPS函数指针复制到一个11维数组中。
After a little time, less than the 'end user to server' Round-trip time (RTT), the real end user datagram will reach the ingress side of the ESP-based router, since the datagram has already been sent, routed and returned. The datagram is directly routed to the ND (Null Device) and the ingress packet counter is decremented.
一段时间后，由于数据报已经发送、路由和返回，小于“最终用户到服务器”的往返时间（RTT），实际最终用户数据报将到达基于ESP的路由器的入口端。数据报直接路由到ND（空设备），入口数据包计数器递减。
Experimentation showed that the ND is a perfect source of entropy and is able to store all digits of pi. The research team had great hopes of reducing the memory footprint for the PPG even further, but ran into problems with read access times.
实验表明，ND是一个完美的熵源，能够存储pi的所有数字。研究小组曾对进一步减少PPG的内存占用寄予厚望，但在读取访问时间方面遇到了问题。
The ND is readily available in most operating systems.
ND在大多数操作系统中都是现成的。
End user considerations and differentiated traffic classes:
最终用户注意事项和不同的流量类别：
1. In order to facilitate a pleasant end user gaming experience, packets destined for the spinal cord (i.e., force feedback information, etc.) must be delayed by 350 ms in order to synchronize with the traffic that is routed by the end user to the cerebrum and cortex.
1. 为了促进令人愉快的最终用户游戏体验，发送到脊髓的数据包（即，力反馈信息等）必须延迟350 ms，以便与最终用户路由到大脑和皮质的流量同步。
2. RFC 1216 [RFC1216], Section 3.3 states that "bad news travels fast". This means that additional delay must be introduced when the end user is browsing on news sites. Negative latency might make the end user suspect that the news is even worse than indicated by the news sites.
2. RFC 1216[RFC1216]第3.3节规定“坏消息传得快”。这意味着最终用户在浏览新闻网站时必须引入额外的延迟。负延迟可能会让最终用户怀疑新闻比新闻网站所显示的更糟糕。
3. Machine-to-Machine (M2M) communication might experience reduced performance due to difficulties for the DPAUI to work correctly. When the concept starts working for M2M communication, this can be used as an indication that a technological singularity might be near.
3. 由于DPAUI难以正常工作，机器对机器（M2M）通信的性能可能会降低。当这个概念开始为M2M通信工作时，这可以作为技术奇点可能即将出现的迹象。
The lack of RTT of IFNs might cause some problems with TCP slow-start. More precisely, it will most likely not be slow at all. This might be handled by implementing a congestion avoidance mechanism, but will need further study.
IFN缺乏RTT可能会导致TCP慢启动出现一些问题。更准确地说，它很可能一点也不慢。这可以通过实施拥塞避免机制来解决，但需要进一步研究。
Unfortunately, we foresee that this product will never be ready for the market. This is especially true for the Pre-preemptive Scheduler, which by nature, will always be slightly ahead of its time.
不幸的是，我们预见这种产品永远不会上市。这对于预抢占式调度程序来说尤其如此，它的本质总是稍微超前于它的时间。
o Introducing an end user RTT delay of zero might cause crashes in badly implemented TCP/IP stacks. This is because division by zero might occur when calculating bandwidth-delay product.
o 引入最终用户RTT延迟为零可能会导致实现不佳的TCP/IP堆栈崩溃。这是因为在计算带宽延迟积时，可能会出现除以零的情况。
o ESP forwarding of traffic generated by psychics might lead to problems with recursiveness.
o ESP转发由通灵者产生的流量可能会导致递归性问题。
o Lawful Intercept of the Deep User and Intention Inspection might violate personal integrity.
o 对深度用户的合法拦截和意图检查可能会侵犯个人诚信。
o Terrorist organizations might exploit the "bad news travels fast" loophole in RFC 1216 [RFC1216].
o 恐怖组织可能利用RFC1216[RFC1216]中的“坏消息传播速度快”漏洞。
[RFC2119] Bradner, S., "Key words for use in RFCs to Indicate Requirement Levels", BCP 14, RFC 2119, March 1997.
[RFC2119]Bradner，S.，“RFC中用于表示需求水平的关键词”，BCP 14，RFC 2119，1997年3月。
[Adams79] Adams, D., "Hitchhiker's guide to the galaxy.", 1979.
[Adams79]Adams，D.，《银河系搭便车指南》，1979年。
[Libet85] Libet, B., "Unconscious cerebral initiative and the role of conscious will in voluntary action.", 1985.
[Libet85]Libet，B.，“无意识大脑主动性和自觉意志在自愿行动中的作用”，1985年。
[RFC1072] Jacobson, V. and R. Braden, "TCP extensions for long-delay paths", RFC 1072, October 1988.
[RFC1072]Jacobson，V.和R.Braden，“长延迟路径的TCP扩展”，RFC 1072，1988年10月。
[RFC1216] Richard, P. and Kynikos, "Gigabit network economics and paradigm shifts", RFC 1216, April 1991.
[RFC1216]Richard，P.和Kynikos，“千兆网络经济和范式转变”，RFC 1216，1991年4月。
[RFC1925] Callon, R., "The Twelve Networking Truths", RFC 1925, April 1996.
[RFC1925]卡隆，R.，“十二个网络真理”，RFC19251996年4月。
[RFC1928] Leech, M., Ganis, M., Lee, Y., Kuris, R., Koblas, D., and L. Jones, "SOCKS Protocol Version 5", RFC 1928, March 1996.
[RFC1928]Leech，M.，Ganis，M.，Lee，Y.，Kuris，R.，Koblas，D.，和L.Jones，“SOCKS协议版本5”，RFC 19281996年3月。
[Schrodinger35] Schrodinger, E., "The Present Situation In Quantum Mechanics", 1935, <http://www.tu-harburg.de/rzt/rzt/it/QM/cat.html>.
[Schrodinger 35]Schrodinger，E.，“量子力学的现状”，1935年<http://www.tu-harburg.de/rzt/rzt/it/QM/cat.html>.
[Wigner] Wikipedia, "Wikipedia: Wigner's friend.", <http://en.wikipedia.org/wiki/Wigner's_friend>.
[维格纳]维基百科，“维基百科：维格纳的朋友。”<http://en.wikipedia.org/wiki/Wigner's\u friend>。
Author's Address
作者地址
Karl-Magnus Moller Tankesaft
卡尔·马格纳斯·穆勒·坦克斯福特
EMail: kalle@tankesaft.se
EMail: kalle@tankesaft.se